Method and device for video coding using local illumination compensation-based prediction in geometric partitioning mode

By applying local lighting compensation to prediction signals in geometric segmentation mode, the method addresses the challenge of illumination changes, enhancing video coding efficiency and quality in video compression.

WO2024237549A1PCT designated stage expired Publication Date: 2024-11-21HYUNDAI MOTOR CO LTD +2

Patent Information

Application Number
PCT/KR2024/006159
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-05-07
Filing Date
2024-05-08
Publication Date
2024-11-21

AI Technical Summary

Technical Problem

Current video coding technologies, such as VVC, face challenges in efficiently compressing video data due to increasing size, resolution, and frame rate, leading to higher data amounts that require improved coding efficiency and picture quality, particularly in geometric segmentation modes where local and global illumination changes affect prediction accuracy.

Method used

The method involves applying local lighting compensation to prediction signals during geometric segmentation mode by blending reference blocks and deriving parameters for a linear relationship between neighboring pixels, enabling effective compensation for lighting changes between frames.

Benefits of technology

This approach enhances video coding efficiency and quality by accurately predicting blocks with varying lighting conditions, improving the overall compression performance and picture quality in geometric segmentation modes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure KR2024006159_21112024_PF_FP_ABST
    Figure KR2024006159_21112024_PF_FP_ABST
Patent Text Reader

Abstract

The present embodiment provides a video coding method and device using local illumination compensation-based prediction in a geometric partitioning mode. In the present embodiment, an image decoding device decodes a geometric partitioning mode index, and partitions a current block into partitioned blocks according to the geometric partitioning mode index. The image decoding device generates reference blocks of the partitioned blocks by using motion information, and generates a prediction block of the current block by blending the reference blocks. When neighboring reference pixels of the current block are available and all or some of neighboring reference pixels of each reference block are available, the image decoding device generates neighboring reference pixels of a blended prediction block by blending the neighboring reference pixels of the reference blocks, and derives parameters of a linear relational expression between the neighboring reference pixels of the current block and the neighboring reference pixels of the blended prediction block. The image decoding device generates a final prediction block of the current block by applying local illumination compensation to the blended prediction block by using the parameters of the linear relational expression.
Need to check novelty before this filing date? Find Prior Art

Description

Method and device for video coding using local illumination compensation-based prediction in geometric segmentation mode

[0001] The present disclosure relates to a video coding method and apparatus using local illumination compensation-based prediction in a geometric segmentation mode.

[0002] The content described below merely provides background information related to the present invention and does not constitute prior art.

[0003] Since video data has a large amount of data compared to voice data or still image data, it requires a lot of hardware resources, including memory, to store or transmit it without processing for compression.

[0004] Therefore, when storing or transmitting video data, an encoder is used to compress the video data and store or transmit it, and a decoder receives the compressed video data, decompresses it, and plays it back. Examples of such video compression technologies include H.264 / AVC, HEVC (High Efficiency Video Coding), and VVC (Versatile Video Coding), which improves encoding efficiency by about 30% compared to HEVC.

[0005] However, as the size, resolution, and frame rate of images are gradually increasing, and the amount of data that needs to be encoded is also increasing, a new compression technology that has better encoding efficiency and better image quality improvement than existing compression technologies is required.

[0006] In VVC, Geometric Partitioning Mode (GPM) is adopted as an inter-prediction technique to perform prediction based on more flexible partitioning than square and rectangular partitioning. In GPM, the encoder provides the decoder with a mode index indicating one of the predefined geometric partitioning modes and motion information for the two partitions. The decoder compensates for the motion of the two partitions using the transmitted information and weights the two partitions using a blending matrix according to the geometric partitioning mode, thereby generating the final prediction signals of the current block.

[0007] When generating prediction signals for the current block using motion compensation based on inter prediction, local or global illumination changes between the current frame and the reference frame may occur. LIC (Local Illumination Compensation) is a technique that can improve the prediction efficiency of the current block by compensating for changed illumination values. Therefore, to enhance video encoding efficiency and improve video quality, a method for efficiently utilizing illumination compensation during inter prediction based on GPM is needed.

[0008] The present disclosure aims to provide a video coding method and device for applying local illumination compensation to prediction signals of a current block to compensate for local or global illumination changes between a current frame and a reference frame when predicting a current block according to a geometric partitioning mode.

[0009] According to an embodiment of the present disclosure, a method for restoring a current block, performed by an image decoding device, comprises: decoding a geometric partitioning mode index from a bitstream; dividing the current block into partition blocks according to the geometric partitioning mode index; generating reference blocks of the partition blocks using motion information, wherein the reference blocks include a first reference block and a second reference block; blending the reference blocks of the partition blocks to generate a prediction block of the current block; and checking the availability of surrounding reference pixels of the current block at the top and left of the current block, and if the surrounding reference pixels of the current block are available, further comprising checking the availability of surrounding reference pixels of each reference block at the top and left of the reference block, and if all or a part of the surrounding reference pixels of each reference block are available, blending the surrounding reference pixels of the reference blocks to generate surrounding reference pixels of the blended prediction block. A method is provided, characterized by comprising: a step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the blended prediction block; and a step of applying local lighting compensation to the blended prediction block using the parameters of the linear relationship, thereby generating a final prediction block of the current block.

[0010] According to another embodiment of the present disclosure, a method for encoding a current block, performed by a video encoding apparatus, comprises the steps of: determining a geometric partitioning mode index; dividing the current block into partition blocks according to the geometric partitioning mode index; generating reference blocks of the partition blocks using motion information, wherein the reference blocks include a first reference block and a second reference block; blending the reference blocks of the partition blocks to generate a prediction block of the current block; and checking the availability of surrounding reference pixels of the current block at the top and the left of the current block, and if the surrounding reference pixels of the current block are available, further comprising the step of checking the availability of surrounding reference pixels of each reference block at the top and the left of the reference block, and if all or a part of the surrounding reference pixels of each reference block are available, blending the surrounding reference pixels of the reference blocks to generate surrounding reference pixels of the blended prediction block. A method is provided, characterized by comprising: a step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the blended prediction block; and a step of applying local lighting compensation to the blended prediction block using the parameters of the linear relationship, thereby generating a first final prediction block of the current block.

[0011] According to another embodiment of the present disclosure, a method for providing video data to a video decoding device comprises: encoding the video data into a bitstream; and transmitting the bitstream to the video decoding device, wherein the encoding the video data comprises: determining a geometric partitioning mode index; dividing a current block into partition blocks according to the geometric partitioning mode index; generating reference blocks of the partition blocks using motion information, wherein the reference blocks include a first reference block and a second reference block; generating a prediction block of the current block by blending the reference blocks of the partition blocks; And a step of checking the availability of surrounding reference pixels of the current block at the top and left of the current block, and if the surrounding reference pixels of the current block are available, a step of checking the availability of surrounding reference pixels of each reference block at the top and left of the respective reference blocks, and if all or part of the surrounding reference pixels of each reference block are available, a step of blending the surrounding reference pixels of the reference blocks to generate surrounding reference pixels of the blended prediction block; a step of deriving parameters of a linear relationship between the surrounding reference pixels of the current block and the surrounding reference pixels of the blended prediction block; and a step of applying local illumination compensation to the blended prediction block using the parameters of the linear relationship, thereby generating a final prediction block of the current block.

[0012] As described above, according to the present embodiment, when predicting a current block according to a geometric partitioning mode, a video coding method and device are provided that apply local illumination compensation to prediction signals of a current block to compensate for local or global illumination changes between a current frame and a reference frame, thereby improving video encoding efficiency and enhancing video quality.

[0013] FIG. 1 is an exemplary block diagram of an image encoding device capable of implementing the techniques of the present disclosure.

[0014] Figure 2 is a drawing for explaining a method of dividing a block using the QTBTTT (QuadTree plus BinaryTree TernaryTree) structure.

[0015] FIGS. 3A and 3B are diagrams illustrating multiple intra prediction modes, including wide-angle intra prediction modes.

[0016] Figure 4 is an example diagram of the surrounding blocks of the current block.

[0017] FIG. 5 is an exemplary block diagram of an image decoding device capable of implementing the techniques of the present disclosure.

[0018] Figure 6 is an example diagram showing block division according to geometric division.

[0019] Figures 7a and 7b are examples showing straight lines that divide a block into two.

[0020] Figure 8 is an example diagram showing a GPM (Geometric Partition Mode) merge list used for geometric motion prediction.

[0021] FIG. 9 is a block diagram illustrating in detail a portion of an image decoding device according to one embodiment of the present disclosure.

[0022] FIG. 10 is an exemplary diagram showing blending of surrounding reference pixels of reference blocks according to one embodiment of the present disclosure.

[0023] FIG. 11 is an exemplary diagram showing blending of surrounding reference pixels of reference blocks according to another embodiment of the present disclosure.

[0024] FIG. 12 is an exemplary diagram showing blending of surrounding reference pixels of reference blocks according to another embodiment of the present disclosure.

[0025] FIGS. 13A and 13B are exemplary diagrams showing a blending mask of reference pixels according to one embodiment of the present disclosure.

[0026] FIGS. 14A and 14B are exemplary diagrams showing a blending mask of reference pixels according to another embodiment of the present disclosure.

[0027] FIG. 15 is a flowchart illustrating a method for an image encoding device to encode a current block according to one embodiment of the present disclosure.

[0028] FIG. 16 is a flowchart illustrating a method for an image decoding device to restore a current block according to an embodiment of the present disclosure.

[0029] Hereinafter, embodiments of the present invention will be described in detail with reference to exemplary drawings. When designating components in each drawing, it should be noted that, where possible, identical components are given the same reference numerals, even if they appear in different drawings. Furthermore, in describing the present embodiments, detailed descriptions of related known structures or functions will be omitted if they are deemed to obscure the gist of the present embodiments.

[0030] FIG. 1 is an exemplary block diagram of an image encoding device capable of implementing the techniques of the present disclosure. Hereinafter, the image encoding device and its subcomponents will be described with reference to the illustration in FIG. 1.

[0031] The video encoding device may be configured to include a picture segmentation unit (110), a prediction unit (120), a subtractor (130), a transformation unit (140), a quantization unit (145), a reordering unit (150), an entropy encoding unit (155), an inverse quantization unit (160), an inverse transformation unit (165), an adder (170), a loop filter unit (180), and a memory (190).

[0032] Each component of the video encoding device may be implemented in hardware, software, or a combination of hardware and software. Furthermore, the functions of each component may be implemented in software, with a microprocessor executing the software functions corresponding to each component.

[0033] A single image (video) is composed of one or more sequences containing multiple pictures. Each picture is divided into multiple regions, and encoding is performed for each region. For example, a single picture is divided into one or more tiles and / or slices. Here, one or more tiles can be defined as a tile group. Each tile or slice is divided into one or more Coding Tree Units (CTUs). Each CTU is then divided into one or more Coding Units (CUs) by a tree structure. Information applied to each CU is encoded as the syntax of the CU, and information commonly applied to CUs included in a CTU is encoded as the syntax of the CTU. In addition, information commonly applied to all blocks within a single slice is encoded as the syntax of the slice header, and information applied to all blocks constituting one or more pictures is encoded in the Picture Parameter Set (PPS) or the picture header. Furthermore, information commonly referenced by multiple pictures is encoded in a Sequence Parameter Set (SPS). And, information commonly referenced by one or more SPS is encoded in a Video Parameter Set (VPS). In addition, information commonly applied to one tile or tile group may be encoded as syntax of a tile or tile group header. Syntaxes included in an SPS, PPS, slice header, tile or tile group header may be referred to as high level syntax.

[0034] The picture segmentation unit (110) determines the size of the CTU. Information about the size of the CTU (CTU size) is encoded as the syntax of SPS or PPS and transmitted to the image decoding device.

[0035] The picture segmentation unit (110) divides each picture constituting an image into a plurality of CTUs having a predetermined size, and then recursively divides the CTUs using a tree structure. A leaf node in the tree structure becomes a CU, which is a basic unit of encoding.

[0036] The tree structure may be a QuadTree (QT) in which an upper node (or parent node) is divided into four lower nodes (or child nodes) of the same size, a BinaryTree (BT) in which an upper node is divided into two lower nodes, or a TernaryTree (TT) in which an upper node is divided into three lower nodes in a 1:2:1 ratio, or a structure that mixes two or more of the QT structures, BT structures, and TT structures. For example, a QTBT (QuadTree plus BinaryTree) structure may be used, or a QTBTTT (QuadTree plus BinaryTree TernaryTree) structure may be used. Here, BTTT may be combined and referred to as a MTT (Multiple-Type Tree).

[0037] Figure 2 is a drawing for explaining a method of dividing a block using the QTBTTT structure.

[0038] As illustrated in FIG. 2, a CTU may first be split into a QT structure. The quadtree splitting may be repeated until the size of the splitting block reaches the minimum block size (MinQTSize) of the leaf node allowed in the QT. A first flag (QT_split_flag) indicating whether each node of the QT structure is split into four nodes of the lower layer is encoded by the entropy encoding unit (155) and signaled to the image decoding device. If the leaf node of the QT is not larger than the maximum block size (MaxBTSize) of the root node allowed in the BT, it may be further split into one or more of the BT structure or the TT structure. There may be multiple splitting directions in the BT structure and / or the TT structure. For example, there may be two directions in which the block of the corresponding node is split horizontally and two directions in which the block is split vertically. As illustrated in FIG. 2, when MTT splitting begins, a second flag (mtt_split_flag) indicating whether nodes have been split, and if splitting has occurred, a flag indicating the splitting direction (vertical or horizontal) and / or a flag indicating the splitting type (Binary or Ternary) are encoded by the entropy encoding unit (155) and signaled to the image decoding device.

[0039] Alternatively, before encoding the first flag (QT_split_flag) indicating whether each node is split into four nodes of a lower layer, a CU split flag (split_cu_flag) indicating whether the node is split may be encoded. If the CU split flag (split_cu_flag) value indicates that the node is not split, the block of the corresponding node becomes a leaf node in the split tree structure and becomes a CU (coding unit), which is a basic unit of encoding. If the CU split flag (split_cu_flag) value indicates that the node is split, the video encoding device starts encoding from the first flag in the above-described manner.

[0040] As another example of a tree structure, when QTBT is used, there may be two types: a type that horizontally splits the block of the corresponding node into two blocks of the same size (i.e., symmetric horizontal splitting) and a type that vertically splits it (i.e., symmetric vertical splitting). A split flag (split_flag) indicating whether each node of the BT structure is split into blocks of a lower layer and split type information indicating the type of split are encoded by the entropy encoding unit (155) and transmitted to the image decoding device. Meanwhile, there may additionally be a type that splits the block of the corresponding node into two blocks of an asymmetrical shape. The asymmetric shape may include a shape that splits the block of the corresponding node into two rectangular blocks with a size ratio of 1:3, or a shape that splits the block of the corresponding node in a diagonal direction.

[0041] A CU can have various sizes depending on the QTBT or QTBTTT partitioning from the CTU. Hereinafter, the block corresponding to the CU to be encoded or decoded (i.e., the leaf node of the QTBTTT) is referred to as the "current block." Depending on the QTBTTT partitioning employed, the current block may be rectangular as well as square.

[0042] The prediction unit (120) predicts the current block and generates a prediction block. The prediction unit (120) includes an intra prediction unit (122) and an inter prediction unit (124).

[0043] In general, each current block within a picture can be predictively coded. Prediction of the current block can typically be performed using either intra-prediction (using data from the picture containing the current block) or inter-prediction (using data from a picture coded before the picture containing the current block). Inter-prediction encompasses both unidirectional and bidirectional prediction.

[0044] The intra prediction unit (122) predicts pixels within the current block using pixels (reference pixels) located around the current block within the current picture including the current block. There are multiple intra prediction modes depending on the prediction direction. For example, as shown in Fig. 3a, the multiple intra prediction modes may include two non-directional modes including the Planar mode and the DC mode, and 65 directional modes. The surrounding pixels to be used and the calculation formula are defined differently depending on each prediction mode.

[0045] For efficient directional prediction for a rectangular current block, directional modes (intra prediction modes 67 to 80 and -1 to -14) indicated by dotted arrows in Fig. 3b may be additionally used. These may be referred to as "wide-angle intra-prediction modes." In Fig. 3b, the arrows point to corresponding reference samples used for prediction, and do not indicate the prediction direction. The prediction direction is opposite to the direction indicated by the arrows. Wide-angle intra-prediction modes are modes that perform prediction in the opposite direction of a specific directional mode without additional bit transmission when the current block is rectangular. At this time, among the wide-angle intra-prediction modes, some wide-angle intra-prediction modes available for the current block may be determined based on the ratio of the width and height of the rectangular current block. For example, wide-angle intra prediction modes (intra prediction modes 67 to 80) having an angle less than 45 degrees are available when the current block is a rectangular shape whose height is smaller than its width, and wide-angle intra prediction modes (intra prediction modes -1 to -14) having an angle greater than -135 degrees are available when the current block is a rectangular shape whose width is larger than its height.

[0046] The intra prediction unit (122) can determine an intra prediction mode to be used to encode the current block. In some examples, the intra prediction unit (122) can encode the current block using multiple intra prediction modes and select an appropriate intra prediction mode to be used from the tested modes. For example, the intra prediction unit (122) can calculate bit-rate distortion values ​​using rate-distortion analysis for multiple tested intra prediction modes and select an intra prediction mode with the best bit-rate distortion characteristics among the tested modes.

[0047] The intra prediction unit (122) selects one intra prediction mode from among multiple intra prediction modes and predicts the current block using surrounding pixels (reference pixels) and an operation formula determined according to the selected intra prediction mode. Information about the selected intra prediction mode is encoded by the entropy encoding unit (155) and transmitted to the image decoding device.

[0048] The inter prediction unit (124) generates a prediction block for the current block using a motion compensation process. The inter prediction unit (124) searches for a block most similar to the current block within reference pictures that were encoded and decoded before the current picture, and generates a prediction block for the current block using the searched block. Then, a motion vector (MV) corresponding to the displacement between the current block within the current picture and the prediction block within the reference picture is generated. Generally, motion estimation is performed on the luma component, and the motion vector calculated based on the luma component is used for both the luma component and the chroma component. The motion information including information on the reference picture used to predict the current block and information on the motion vector is encoded by the entropy encoding unit (155) and transmitted to the image decoding device.

[0049] The inter prediction unit (124) may perform interpolation on a reference picture or a reference block to improve prediction accuracy. That is, subsamples between two consecutive integer samples are interpolated by applying filter coefficients to a plurality of consecutive integer samples including the two integer samples. When a process of searching for a block most similar to the current block is performed on the interpolated reference picture, the motion vector can be expressed up to a precision in decimal units rather than a precision in integer sample units. The precision or resolution of the motion vector can be set differently for each target region to be encoded, such as a slice, tile, CTU, CU, etc. When such adaptive motion vector resolution (AMVR) is applied, information on the motion vector resolution to be applied to each target region must be signaled for each target region. For example, when the target region is a CU, information on the motion vector resolution applied to each CU is signaled. Information on the motion vector resolution may be information indicating the precision of a differential motion vector, which will be described later.

[0050] Meanwhile, the inter prediction unit (124) can perform inter prediction using bi-prediction. In the case of bi-prediction, two reference pictures and two motion vectors indicating the block position most similar to the current block within each reference picture are used. The inter prediction unit (124) selects a first reference picture and a second reference picture from reference picture list 0 (RefPicList0) and reference picture list 1 (RefPicList1), respectively, and searches for a block similar to the current block within each reference picture to generate a first reference block and a second reference block. Then, the first reference block and the second reference block are averaged or weighted averaged to generate a prediction block for the current block. Then, motion information including information on two reference pictures used to predict the current block and information on two motion vectors is transmitted to the entropy encoding unit (155). Here, reference picture list 0 may be composed of pictures that are before the current picture in display order among the restored pictures, and reference picture list 1 may be composed of pictures that are after the current picture in display order among the restored pictures. However, this is not necessarily limited to this, and restored pictures that are after the current picture in display order may be additionally included in reference picture list 0, and conversely, restored pictures that are before the current picture may be additionally included in reference picture list 1.

[0051] Various methods can be used to minimize the number of bits required to encode motion information.

[0052] For example, if the reference picture and motion vector of the current block are identical to those of a neighboring block, the motion information of the current block can be transmitted to the image decoding device by encoding information that can identify the neighboring block. This method is called 'merge mode'.

[0053] In merge mode, the inter prediction unit (124) selects a predetermined number of merge candidate blocks (hereinafter referred to as 'merge candidates') from the surrounding blocks of the current block.

[0054] As the surrounding blocks for deriving merge candidates, all or part of the left block (A0), the lower left block (A1), the upper block (B0), the upper right block (B1), and the upper left block (B2) adjacent to the current block within the current picture may be used, as illustrated in FIG. 4. In addition, a block located within a reference picture (which may or may not be the same as the reference picture used to predict the current block) other than the current picture in which the current block is located may be used as a merge candidate. For example, a block co-located with the current block within the reference picture or blocks adjacent to the block at the co-located block may be additionally used as a merge candidate. If the number of merge candidates selected by the method described above is less than a preset number, a 0 vector is added to the merge candidates.

[0055] The inter prediction unit (124) uses these surrounding blocks to construct a merge list containing a predetermined number of merge candidates. Among the merge candidates included in the merge list, the merge candidate to be used as motion information of the current block is selected and merge index information for identifying the selected candidate is generated. The generated merge index information is encoded by the entropy encoding unit (155) and transmitted to the video decoding device.

[0056] Merge Skip mode is a special case of merge mode. After quantization, when all transform coefficients for entropy encoding are close to zero, only neighboring block selection information is transmitted without transmitting residual signals. By utilizing merge skip mode, relatively high encoding efficiency can be achieved for low-motion images, still images, and screen content images.

[0057] Hereinafter, merge mode and merge skip mode are collectively referred to as merge / skip mode.

[0058] Another method for encoding motion information is Advanced Motion Vector Prediction (AMVP) mode.

[0059] In AMVP mode, the inter prediction unit (124) derives predicted motion vector candidates for the motion vector of the current block using neighboring blocks of the current block. As neighboring blocks used to derive predicted motion vector candidates, all or some of the left block (A0), the lower left block (A1), the upper block (B0), the upper right block (B1), and the upper left block (B2) adjacent to the current block in the current picture as shown in FIG. 4 may be used. In addition, a block located in a reference picture (which may or may not be the same as the reference picture used to predict the current block) other than the current picture in which the current block is located may be used as the neighboring block used to derive predicted motion vector candidates. For example, a block co-located with the current block in the reference picture or blocks adjacent to the block in the co-located block may be used. If the number of motion vector candidates is less than a preset number by the method described above, a 0 vector is added to the motion vector candidates.

[0060] The inter prediction unit (124) derives predicted motion vector candidates using the motion vectors of these surrounding blocks, and determines a predicted motion vector for the motion vector of the current block using the predicted motion vector candidates. Then, the predicted motion vector is subtracted from the motion vector of the current block to produce a differential motion vector.

[0061] The predicted motion vector can be obtained by applying a predefined function (e.g., median, mean, etc.) to the predicted motion vector candidates. In this case, the image decoding device also knows the predefined function. In addition, since the surrounding blocks used to derive the predicted motion vector candidates are blocks that have already been encoded and decoded, the image decoding device also already knows the motion vectors of the surrounding blocks. Therefore, the image encoding device does not need to encode information to identify the predicted motion vector candidates. Therefore, in this case, information about the differential motion vector and information about the reference picture used to predict the current block are encoded.

[0062] Alternatively, the predicted motion vector can be determined by selecting one of the predicted motion vector candidates. In this case, information for identifying the selected predicted motion vector candidate is additionally encoded, along with information about the differential motion vector and the reference picture used to predict the current block.

[0063] The subtractor (130) subtracts the prediction block generated by the intra prediction unit (122) or inter prediction unit (124) from the current block to generate a residual block.

[0064] The transformation unit (140) transforms residual signals within a residual block having pixel values ​​in a spatial domain into transform coefficients in a frequency domain. The transformation unit (140) may transform the residual signals within the residual block using the entire size of the residual block as a transformation unit, or may divide the residual block into a plurality of sub-blocks and use the sub-blocks as transformation units to perform the transformation. Alternatively, the residual signals may be transformed using only the transformation domain sub-block as a transformation unit by dividing the sub-blocks into two sub-blocks, that is, a transformation domain and a non-transform domain. Here, the transformation domain sub-block may be one of two rectangular blocks having a size ratio of 1:1 with respect to the horizontal axis (or vertical axis). In this case, a flag (cu_sbt_flag) indicating that only a sub-block has been converted, directionality (vertical / horizontal) information (cu_sbt_horizontal_flag), and / or position information (cu_sbt_pos_flag) are encoded by the entropy encoding unit (155) and signaled to the image decoding device. In addition, the size of the conversion area sub-block may have a size ratio of 1:3 with respect to the horizontal axis (or vertical axis), and in this case, a flag (cu_sbt_quad_flag) distinguishing the corresponding division is additionally encoded by the entropy encoding unit (155) and signaled to the image decoding device.

[0065] Meanwhile, the transformation unit (140) can individually perform transformations on the residual block in the horizontal and vertical directions. For the transformation, various types of transformation functions or transformation matrices can be used. For example, a pair of transformation functions for horizontal transformation and vertical transformation can be defined as a Multiple Transform Set (MTS). The transformation unit (140) can select one transformation function pair with the best transformation efficiency among the MTS and transform the residual block in the horizontal and vertical directions, respectively. Information (mts_idx) on the transformation function pair selected among the MTS is encoded by the entropy encoding unit (155) and signaled to the image decoding device.

[0066] The quantization unit (145) quantizes the transform coefficients output from the transform unit (140) using quantization parameters and outputs the quantized transform coefficients to the entropy encoding unit (155). The quantization unit (145) may directly quantize a related residual block without transformation for a certain block or frame. The quantization unit (145) may also apply different quantization coefficients (scaling values) according to the positions of the transform coefficients within the transform block. The quantization matrix applied to the quantized transform coefficients arranged in two dimensions may be encoded and signaled to an image decoding device.

[0067] The rearrangement unit (150) can perform rearrangement of coefficient values ​​for quantized residual values.

[0068] The reordering unit (150) can change a two-dimensional coefficient array into a one-dimensional coefficient sequence by using coefficient scanning. For example, the reordering unit (150) can output a one-dimensional coefficient sequence by scanning from the DC coefficient to the coefficients of the high-frequency region by using a zig-zag scan or a diagonal scan. Depending on the size of the transformation unit and the intra prediction mode, a vertical scan that scans the two-dimensional coefficient array in the column direction or a horizontal scan that scans the two-dimensional block-shaped coefficients in the row direction may be used instead of the zig-zag scan. That is, depending on the size of the transformation unit and the intra prediction mode, the scanning method to be used may be determined among the zig-zag scan, the diagonal scan, the vertical scan, and the horizontal scan.

[0069] The entropy encoding unit (155) generates a bitstream by encoding a sequence of one-dimensional quantized transform coefficients output from the rearrangement unit (150) using various encoding methods such as CABAC (Context-based Adaptive Binary Arithmetic Code) and Exponential Golomb.

[0070] In addition, the entropy encoding unit (155) encodes information related to block division, such as CTU size, CU division flag, QT division flag, MTT division type, and MTT division direction, so that the image decoding device can divide the block in the same manner as the image encoding device. In addition, the entropy encoding unit (155) encodes information about a prediction type indicating whether the current block is encoded by intra prediction or inter prediction, and encodes intra prediction information (i.e., information about an intra prediction mode) or inter prediction information (information about an encoding mode of motion information (merge mode or AMVP mode), a merge index in the case of a merge mode, and a reference picture index and a differential motion vector in the case of an AMVP mode) according to the prediction type. In addition, the entropy encoding unit (155) encodes information related to quantization, that is, information about a quantization parameter and information about a quantization matrix.

[0071] The inverse quantization unit (160) inversely quantizes the quantized transform coefficients output from the quantization unit (145) to generate transform coefficients. The inverse transform unit (165) transforms the transform coefficients output from the inverse quantization unit (160) from the frequency domain to the spatial domain to restore the residual block.

[0072] An adder (170) adds the restored residual block and the predicted block generated by the prediction unit (120) to restore the current block. The pixels within the restored current block are used as reference pixels when intra-predicting the next block.

[0073] The loop filter unit (180) performs filtering on restored pixels to reduce blocking artifacts, ringing artifacts, blurring artifacts, etc. that occur due to block-based prediction and transformation / quantization. The loop filter unit (180) may include all or part of a deblocking filter (182), a sample adaptive offset (SAO) filter (184), and an adaptive loop filter (ALF, 186) as an in-loop filter.

[0074] The deblocking filter (182) filters the boundaries between restored blocks to remove blocking artifacts caused by block-based encoding / decoding, and the SAO filter (184) and the ALF (186) perform additional filtering on the deblocking-filtered image. The SAO filter (184) and the ALF (186) are filters used to compensate for the differences between restored pixels and original pixels caused by lossy coding. The SAO filter (184) improves not only subjective image quality but also encoding efficiency by applying an offset in units of CTUs. In contrast, the ALF (186) performs block-based filtering, and compensates for distortion by applying different filters by distinguishing the edges and degrees of variation of the corresponding block. Information on filter coefficients to be used in the ALF can be encoded and signaled to an image decoding device.

[0075] The restored blocks filtered through the deblocking filter (182), SAO filter (184), and ALF (186) are stored in the memory (190). When all blocks within a picture are restored, the restored picture can be used as a reference picture for inter-predicting blocks within a picture to be encoded later.

[0076] The video encoding device can store the bitstream of encoded video data on a non-transitory storage medium or transmit it to the video decoding device using a communication network.

[0077] FIG. 5 is an exemplary block diagram of an image decoding device capable of implementing the techniques of the present disclosure. Hereinafter, the image decoding device and its subcomponents will be described with reference to FIG. 5.

[0078] The video decoding device may be configured to include an entropy decoding unit (510), a rearrangement unit (515), an inverse quantization unit (520), an inverse transformation unit (530), a prediction unit (540), an adder (550), a loop filter unit (560), and a memory (570).

[0079] Similar to the video encoding device of FIG. 1, each component of the video decoding device may be implemented in hardware, software, or a combination of hardware and software. Furthermore, the functions of each component may be implemented in software, with a microprocessor executing the software functions corresponding to each component.

[0080] The entropy decoding unit (510) decodes the bitstream generated by the image encoding device to extract information related to block division, thereby determining the current block to be decoded, and extracts prediction information, information on residual signals, etc. required to restore the current block.

[0081] The entropy decoding unit (510) extracts information about the CTU size from the Sequence Parameter Set (SPS) or the Picture Parameter Set (PPS), determines the size of the CTU, and divides the picture into CTUs of the determined size. Then, the CTU is determined as the top layer of the tree structure, i.e., the root node, and the CTU is divided using the tree structure by extracting division information about the CTU.

[0082] For example, when splitting a CTU using the QTBTTT structure, first, the first flag (QT_split_flag) related to the splitting of QT is extracted, and each node is split into four nodes of the lower layer. Then, for the nodes corresponding to the leaf nodes of QT, the second flag (mtt_split_flag) related to the splitting of MTT and the split direction (vertical / horizontal) and / or split type (binary / ternary) information are extracted, and the corresponding leaf nodes are split into the MTT structure. Accordingly, each node below the leaf nodes of QT are split recursively into the BT or TT structure.

[0083] As another example, when splitting a CTU using the QTBTTT structure, the CU split flag (split_cu_flag) indicating whether the CU is split is first extracted, and if the block is split, the first flag (QT_split_flag) may be extracted. During the splitting process, each node may undergo zero or more repeated QT splits followed by zero or more repeated MTT splits. For example, a CTU may undergo an MTT split right away, or conversely, may undergo only multiple QT splits.

[0084] As another example, when splitting a CTU using the QTBT structure, the first flag (QT_split_flag) related to the splitting of QT is extracted, and each node is split into four nodes of the lower layer. Furthermore, for nodes corresponding to leaf nodes of QT, a split flag (split_flag) indicating whether to further split into BTs and splitting direction information are extracted.

[0085] Meanwhile, when the entropy decoding unit (510) determines the current block to be decoded by using the division of the tree structure, it extracts information on the prediction type indicating whether the current block is intra-predicted or inter-predicted. If the prediction type information indicates intra-prediction, the entropy decoding unit (510) extracts syntax elements for intra-prediction information (intra-prediction mode) of the current block. If the prediction type information indicates inter-prediction, the entropy decoding unit (510) extracts syntax elements for inter-prediction information, i.e., information indicating a motion vector and a reference picture referenced by the motion vector.

[0086] Additionally, the entropy decoding unit (510) extracts information about the quantized transform coefficients of the current block as information related to quantization and information about residual signals.

[0087] The rearrangement unit (515) can change the sequence of one-dimensional quantized transform coefficients entropy-decoded in the entropy decoding unit (510) back into a two-dimensional coefficient array (i.e., block) in the reverse order of the coefficient scanning performed by the image encoding device.

[0088] The inverse quantization unit (520) inversely quantizes the quantized transform coefficients and inversely quantizes the quantized transform coefficients using the quantization parameters. The inverse quantization unit (520) may also apply different quantization coefficients (scaling values) to the quantized transform coefficients arranged in two dimensions. The inverse quantization unit (520) may perform inverse quantization by applying a matrix of quantized coefficients (scaling values) from an image encoding device to a two-dimensional array of quantized transform coefficients.

[0089] The inverse transform unit (530) inversely transforms the inverse quantized transform coefficients from the frequency domain to the spatial domain to restore residual signals, thereby generating a residual block for the current block.

[0090] In addition, when the inverse transform unit (530) inversely transforms only a portion of a transform block (sub-block), it extracts a flag (cu_sbt_flag) indicating that only a sub-block of the transform block has been transformed, directionality (vertical / horizontal) information (cu_sbt_horizontal_flag) of the sub-block, and / or position information (cu_sbt_pos_flag) of the sub-block, and inversely transforms the transform coefficients of the corresponding sub-block from the frequency domain to the spatial domain to restore residual signals, and fills “0” values ​​with residual signals for areas that have not been inversely transformed, thereby generating a final residual block for the current block.

[0091] In addition, when MTS is applied, the inverse transform unit (530) determines a transform function or a transform matrix to be applied in the horizontal and vertical directions using MTS information (mts_idx) signaled from the image encoding device, and performs inverse transform on the transform coefficients within the transform block in the horizontal and vertical directions using the determined transform function.

[0092] The prediction unit (540) may include an intra prediction unit (542) and an inter prediction unit (544). The intra prediction unit (542) is activated when the prediction type of the current block is intra prediction, and the inter prediction unit (544) is activated when the prediction type of the current block is inter prediction.

[0093] The intra prediction unit (542) determines the intra prediction mode of the current block among a plurality of intra prediction modes from the syntax elements for the intra prediction mode extracted from the entropy decoding unit (510), and predicts the current block using reference pixels around the current block according to the intra prediction mode.

[0094] The inter prediction unit (544) uses the syntax elements for the inter prediction mode extracted from the entropy decoding unit (510) to determine the motion vector of the current block and the reference picture referenced by the motion vector, and predicts the current block using the motion vector and the reference picture.

[0095] An adder (550) adds the residual block output from the inverse transform unit (530) and the predicted block output from the inter prediction unit (544) or the intra prediction unit (542) to restore the current block. The pixels within the restored current block are used as reference pixels when intra-predicting a block to be decoded later.

[0096] The loop filter unit (560) may include a deblocking filter (562), an SAO filter (564), and an ALF (566) as in-loop filters. The deblocking filter (562) deblocks the boundaries between restored blocks to remove blocking artifacts caused by block-by-block decoding. The SAO filter (564) and the ALF (566) perform additional filtering on restored blocks after deblocking filtering to compensate for differences between restored pixels and original pixels caused by lossy coding. The filter coefficients of the ALF are determined using information about filter coefficients decoded from the non-stream.

[0097] The restored blocks filtered through the deblocking filter (562), SAO filter (564), and ALF (566) are stored in the memory (570). When all blocks within a picture are restored, the restored picture is used as a reference picture for inter-predicting blocks within a picture to be encoded later.

[0098]

[0099] The present embodiment relates to encoding and decoding of images (videos) as described above. More specifically, the present invention provides a video coding method and device for applying local illumination compensation to prediction signals of a current block to compensate for local illumination changes between a current frame and a reference frame when predicting a current block according to a geometric partitioning mode.

[0100] The following embodiments may be performed by an inter prediction unit (124) within a video encoding apparatus. Additionally, they may be performed by an inter prediction unit (544) within a video decoding apparatus.

[0101] The video encoding device can generate signaling information related to the present embodiment in terms of rate distortion optimization in encoding the current block. The video encoding device can encode the signaling information using the entropy encoding unit (155) and then transmit it to the video decoding device. The video decoding device can decode the signaling information related to the decoding of the current block from the bitstream using the entropy decoding unit (510).

[0102] In the following description, the term "target block" may be used interchangeably with the current block or coding unit (CU). Alternatively, the term "target block" may also refer to a portion of a coding unit.

[0103] Also, a value of a flag being true indicates that the flag is set to 1. Also, a value of a flag being false indicates that the flag is set to 0.

[0104] I-1. Merge / Skip Mode and MMVD in Inter Prediction

[0105] Hereinafter, a method for constructing a merge candidate list of motion information in the merge / skip mode of inter prediction is described. To support the merge / skip mode, a video encoding device can construct a merge candidate list by selecting a preset number of merge candidates (e.g., 6).

[0106] The video encoding device searches for spatial merge candidates. The video encoding device searches for spatial merge candidates from surrounding blocks, as illustrated in FIG. 4. Up to four spatial merge candidates can be selected.

[0107] A video encoding device searches for temporal merge candidates. The video encoding device may add a co-located block as a temporal merge candidate, which is a block located in the same location as the current block within a reference picture (which may or may not be the same as the reference picture used to predict the current block) other than the current picture in which the target block is located. Only one temporal merge candidate may be selected.

[0108] A video encoding device searches for HMVP (History-based Motion Vector Predictor) candidates. The video encoding device can store the motion vectors of the previous h CUs (where h is a natural number) in a table and use them as merge candidates. The table size is 6, and the motion vectors of the previous CUs are stored in a First-in First Out (FIFO) manner. This indicates that up to 6 HMVP candidates are stored in the table. The video encoding device can set the most recent motion vectors among the HMVP candidates stored in the table as merge candidates.

[0109] The video encoding device searches for PAMVP (Pairwise Average MVP) candidates. The video encoding device can set the motion vector average of the first and second candidates in the merge candidate list as the merge candidate.

[0110] If the merge candidate list cannot be filled even after performing all of the above-described search processes (i.e., if the preset number cannot be filled), the video encoding device adds a zero motion vector as a merge candidate.

[0111] In terms of optimizing encoding efficiency, a video encoding device can determine a merge index that indicates one candidate within a merge candidate list. The video encoding device can then derive a motion vector predictor (MVP) from the merge candidate list using the merge index, and then determine the MVP as the motion vector of the current block. Furthermore, the video encoding device can signal the merge index to a video decoding device.

[0112] The video encoding device uses the same motion vector transmission method as the merge mode in the skip mode, but does not transmit the residual block corresponding to the difference between the current block and the predicted block.

[0113] The method for constructing the aforementioned merge candidate list can be performed in the same manner by a video decoding device. The video decoding device can decode the merge index. The video decoding device can then derive an MVP from the merge candidate list using the merge index, and then determine the MVP as the motion vector of the current block.

[0114] Meanwhile, when using MMVD (Merge mode with Motion Vector Difference) technology, the video encoding device can derive the MVP from the merge candidate list using the merge index. For example, the first or second candidate in the merge candidate list can be used as the MVP. In addition, in terms of optimizing encoding efficiency, the video encoding device determines a distance index and a direction index. The video encoding device can derive a motion vector difference (MVD) using the distance index and the direction index, and then reconstruct the motion vector of the current block by adding the MVD and the MVP. In addition, the video encoding device can signal the merge index, the distance index, and the direction index to the video decoding device.

[0115] The aforementioned MMVD technique can be performed in the same manner by the inter prediction unit (544) within the video decoding device. The video decoding device can decode a merge index, a size index, and a direction index. The video decoding device can construct a merge candidate list and then derive an MVP from the merge candidate list using the merge index. The video decoding device can derive an MVD using the size index and the direction index and then add the MVD and the MVP to restore the motion vector of the current block.

[0116] I-2. AMVP mode of inter prediction

[0117] The following embodiments are described with a focus on the inter prediction unit (124) within the image encoding device, but can also be performed by the inter prediction unit (544) within the image decoding device as described above.

[0118] Hereinafter, a method for constructing a candidate list of motion information in the Advanced Motion Vector Prediction (AMVP) mode of inter prediction is described. To support the AMVP mode, the inter prediction unit (124) within the video encoding device can construct a candidate list by selecting a preset number of candidates (e.g., 2).

[0119] The video encoding device searches for spatial candidates. The video encoding device searches for spatial candidates from surrounding blocks, as illustrated in FIG. 4. Up to two spatial candidates can be selected.

[0120] A video encoding device searches for temporal candidates. The video encoding device may add a block in the same position as the current block within a reference picture (which may or may not be the same as the reference picture used to predict the current block) as a temporal candidate, rather than the current picture where the target block is located. Only one temporal candidate may be selected.

[0121] If the candidate list cannot be filled even after performing all of the above-described search processes (i.e., if the preset number cannot be filled), the video encoding device adds a zero motion vector as a candidate.

[0122] In terms of optimizing encoding efficiency, a video encoding device can determine a candidate index that indicates one candidate within a candidate list. The video encoding device can then derive an MVP from the candidate list using the candidate index. Furthermore, in terms of optimizing encoding efficiency, the video encoding device determines a motion vector and then calculates an MVD by subtracting the MVP from the motion vector. Furthermore, the video encoding device can signal the candidate index and the MVD to a video decoding device.

[0123] The method for constructing the aforementioned AMVP candidate list can be performed in the same manner by the inter prediction unit (544) within the video decoding device. The video decoding device can decode the candidate index and the MVD. The video decoding device can derive the MVP from the candidate list using the candidate index. The video decoding device can reconstruct the motion vector of the current block by adding the MVD and the MVP.

[0124] I-3. Geometric Partitioning Mode (GPM) for Inter-Prediction

[0125] The following embodiments are described with a focus on an image decoding device, but can be implemented identically or similarly in an image encoding device.

[0126] In VVC (Versatile Video Coding), GPM (Geometric Partitioning Mode) uses prediction units of various shapes other than square shapes.

[0127] Figure 6 is an example diagram showing block division according to geometric division.

[0128] The video decoding device divides the current block into two parts based on a straight line perpendicular to a line segment having a constant angle (θ) and a constant distance (ρ) from the center of the block. Hereinafter, the two divided blocks are referred to as the first block partition and the second block partition. The term "block partition" is used interchangeably with the term "partitioned block." The straight line that divides the current block into two parts is referred to as the partitioning boundary.

[0129] Here, the center of the block represents a virtual position where the position at half the height of the block and the position at half the width of the block intersect with respect to the current block before division. The angle (θ) represents the angle rotated counterclockwise from the virtual horizontal axis passing through the center of the block to the line segment perpendicular to the division boundary. The distance (ρ) represents the distance between the center of the block and the division boundary.

[0130] As described above, the straight line that divides the block, i.e., the division boundary, divides the current block into two different block divisions. The image decoding device uses the geometric division described above to divide the current block into two blocks, a first block division and a second block division, based on the division boundary, for performing separate predictions.

[0131] As an example, in a conventional GPM, information on segmentation boundaries, such as the example in FIG. 6, is signaled from an image encoding device to an image decoding device. The image decoding device can decode geometric block segments of the current block using the information on the parsed segmentation boundaries. Here, the information on the segmentation boundaries can include an angle (θ) and a distance (ρ) based on the center of the block. In addition, the image encoding device can additionally signal information indicating whether or not to apply the GPM to the image decoding device.

[0132] Hereinafter, information on the segmentation boundary according to the geometric segmentation mode is used interchangeably with geometric segmentation mode information, geometric segmentation information, or segmentation information.

[0133] Figures 7a and 7b are examples showing straight lines that divide a block into two.

[0134] As another example, a lookup table including combinations of angles and distances for dividing a current block into a first block division and a second block division, as shown in FIGS. 7A and 7B and Table 1, may be constructed. Thereafter, an index indicating a combination of angles and distances within the lookup table may be signaled from a video encoding device to a video decoding device. The combination of angles and distances corresponding to each index may be defined based on a fixed lookup table according to an agreement between the video encoding device and the video decoding device. As another example, the lookup table may be adaptively reconfigured according to a pre-agreed rule.

[0135] As described above, the geometric segmentation shape is based on the segmentation boundary, which is a straight line representing the division of the block. Information about this straight line may include an index distanceIdx representing the distance (ρ) from the center of the block to the segmentation boundary, and an index angleIdx representing the angle (θ) of the line segment perpendicular to the segmentation boundary. The index representing the angle of the line segment perpendicular to the segmentation boundary may be set as illustrated in Fig. 7a. In addition, 64 geometric segmentation shapes according to these angles and distances may be set as illustrated in Fig. 7b.

[0136] 64 geometric partition shapes can be signaled using the merge_gpm_partition_idx syntax, which is an index indicating a geometric partition shape, as shown in Table 1. That is, the shapes that divide the current block into the first block partition and the second block partition according to various angles and various distances can be efficiently signaled using a single index.

[0137]

[0138] The index distanceIdx derived from the example in Fig. 7b is a value that excludes the size of the current block. Therefore, the actual distance between a pixel in the current block and a straight line can be calculated using the size information of the current block, the index angleIdx indicating the angle, and the index distanceIdx indicating the distance. Here, the actual distance is a value expressed in pixel units.

[0139] Meanwhile, weights for each pixel within the current block can be calculated using the actual distance. For example, for a pixel within the first block partition, as the actual distance between the pixel and the straight line increases, the weight of the predictor of the first block partition, as described above, may increase, and the weight of the predictor of the second block partition may decrease. For pixels located on the partition boundary, the two predictors may use weights with the same value. In this case, the sum of the weights of the two predictors for a single pixel remains 1.

[0140] For two different block divisions of the current block within the current picture, the video decoding device performs prediction using each motion vector (mv0 or mv1). The video decoding device applies a weighted-sum-based blending process to the prediction block for the first block division and the prediction block for the second block division to generate a final prediction block of the current block.

[0141] In order to perform inter prediction of the current block, the video decoding device obtains a first prediction block using a motion vector for the first block division, and obtains a second prediction block using a motion vector for the second block division. At this time, the video decoding device, in the process of obtaining the prediction block for each block division, may obtain the prediction block in a form in which different weights are multiplied according to pixel positions as described above. In addition, the video decoding device may use a shift operation and a clipping operation in the process of generating a final prediction block from the prediction blocks in a form in which weights are multiplied.

[0142] Figure 8 is an example diagram showing a GPM (Geometric Partition Mode) merge list used for geometric motion prediction.

[0143] As in the example of Fig. 8, the video decoding device can select motion information for motion prediction from a merge list and then use the selected motion information.

[0144] However, unlike the existing block-based motion prediction technology, for geometric motion prediction, the image decoding device performs unidirectional prediction for one block division by limiting the prediction directionality, as illustrated in FIG. 8. This is because, compared to block-based motion prediction, when motion prediction is performed according to bidirectional prediction for each block division in geometric motion prediction, the memory bandwidth used for prediction doubles. Therefore, to efficiently solve the aforementioned memory bandwidth increase problem, a technology for limiting the prediction directionality for each block division can be applied.

[0145] In the case where the direction of prediction is limited for each block partition in geometric motion prediction, a GPM merge list for geometric motion prediction can be generated using an existing merge list rule. To generate a GPM merge list, the image decoding device first configures the merge list as described above. Thereafter, the image decoding device can generate a GPM merge list for geometric motion prediction from the merge list according to the prediction direction and the order in the list. At this time, the image decoding device adds motion information in the L0 direction to the GPM merge list to generate a merge candidate for geometric motion prediction of the first block partition. In addition, the image decoding device can add motion information in the L1 direction to the GPM merge list to generate a merge candidate for geometric motion prediction of the second block partition. That is, the image decoding device can derive unidirectional motion information in one direction from the existing bidirectional motion information, and then add the derived motion information to the GPM merge list.

[0146] As in the example of Fig. 8, in the existing geometric motion prediction method, the image decoding device can directly use the merge candidates in the GPM merge list as motion information for motion prediction of the first block division and the second block division.

[0147] Meanwhile, the video decoding device can derive motion information related to GPM in the AMVP mode of inter prediction similarly to what was described above.

[0148] II. Local Illumination Compensation (LIC)

[0149] When generating prediction signals for the current block using motion compensation based on inter-prediction, local or global illumination changes between the current frame and the reference frame may occur. LIC (Local Illumination Compensation) is a technology that can improve prediction efficiency for the current block by performing illumination compensation according to changes in the image acquisition environment.

[0150] To effectively perform local illumination compensation, an image decoding device derives parameters representing a linear relationship between the surrounding L-shaped template of a current block and the surrounding L-shaped template of a reference block. For example, the parameters of the linear relationship can be derived based on the linear least square method. In this case, the surrounding L-shaped template of the current block exists in the original restoration area of ​​the current block. The image decoding device uses the parameters of the derived linear relationship to perform local illumination compensation of the current block based on the reference block, as shown in Equation 1.

[0151]

[0152] In Equation 1, α and β are parameters of the linear relationship, representing the slope and offset, respectively. P(x,y) represents a pixel within the reference block (i.e., a predicted pixel), and P'(x,y) represents a predicted pixel within the current block to which local illumination compensation has been applied.

[0153] As described above, local lighting compensation is applied to the current block, and a linear relationship is derived based on the surrounding reference pixels adjacent to the reference block and the surrounding reference pixels adjacent to the current block. If there are no available pixels among the surrounding reference pixels of the reference block, local lighting compensation may not be performed on the current block. If available pixels are not present on both the left and top of the reference block, but are present in a portion of the top or left, local lighting compensation may be performed using some of the available pixels.

[0154] The parameters α and β of the linear relationship used in local illumination compensation are calculated identically in both the image encoding device and the image decoding device. Therefore, the image encoding device may not separately transmit the parameters of the linear relationship to the image decoding device.

[0155] If the mode is merged and LIC is applied to a neighboring block selected based on a merge index, the video decoding device applies the LIC parameters of the corresponding block to the current block to perform LIC. If the mode is AMVP, a flag indicating whether LIC is performed is signaled, and the video decoding device derives the LIC parameters using the template of the current block and the template of the reference block. In addition, LIC is applied in case of unidirectional prediction, and if the current block is predicted based on CIIP (Combined Inter Intra Prediction), LIC is not applied. CIIP is a technology that generates a block based on intra prediction (i.e., an intra-prediction block) and a block based on inter prediction (i.e., an inter-prediction block) for the current block, and then weights and adds the intra-prediction block and the inter-prediction block to generate a final predicted block of the current block.

[0156] The following embodiments are described with a focus on an image decoding device, but can be implemented identically or similarly in an image encoding device.

[0157] III. Embodiments according to the present disclosure

[0158] The video decoding device according to the present embodiment determines prediction and transformation units, and performs prediction and inverse transformation on the current block corresponding to the determined unit using the determined prediction technique and prediction mode, thereby finally generating a restoration block of the current block. The example illustrated in FIG. 9 may be performed by the inverse transformation unit (530), the prediction unit (540), and the adder (550) of the video decoding device. Meanwhile, the same operations as the example illustrated in FIG. 9 may be performed by the inverse transformation unit (165), the picture division unit (110), the prediction unit (120), and the adder (170) of the video encoding device. At this time, the video decoding device uses encoding information parsed from the bitstream, but the video encoding device may use encoding information set from a higher level in terms of minimizing rate distortion. Hereinafter, for convenience, the present embodiment will be described with a focus on the video decoding device.

[0159] As shown in the example of FIG. 5, the prediction unit (540) includes an intra prediction unit (542) and an inter prediction unit (544) depending on the prediction technology, but as shown in FIG. 9, the prediction unit (540) may include all or part of the prediction unit determination unit (902), the prediction technology determination unit (904), the prediction mode determination unit (906), and the prediction execution unit (908).

[0160] If the color format of the input video is a YUV format (such as YUV420, YUV411, YUV422, YUV444), the video decoding device can perform prediction and restoration of the chroma component after performing prediction and restoration of the luma component. That is, the luma component and the chroma component can be sequentially restored by the components illustrated in Fig. 9. Meanwhile, if the color format of the input video is RGB, the video encoding device can perform color format conversion from RGB to YUV and then encode the converted video. Here, in the case of the YUV format, the color format represents the correspondence between the pixels of the luma component and the pixels of the chroma component.

[0161] The prediction unit determination unit (902) determines a prediction unit (PU). The prediction technique determination unit (904) determines a prediction technique (e.g., intra prediction, inter prediction, IBC (Intra Block Copy) mode, palette mode, etc.) for the prediction unit. The prediction mode determination unit (906) determines a detailed prediction mode for the prediction technique. The prediction execution unit (908) generates a prediction block of the current block according to the determined prediction mode.

[0162] The inverse transform unit (530) includes a transform unit determination unit (910) and an inverse transform execution unit (912). The transform unit determination unit (910) determines a transform unit (TU) for the inverse quantization signals of the current block, and the inverse transform execution unit (912) inversely transforms the transform unit expressed as the inverse quantization signals to generate residual signals.

[0163] An adder (550) adds the prediction block and residual signals to generate a restoration block. The restoration block is stored in memory and can be used to predict other blocks.

[0164] The prediction unit determined by the prediction unit determination unit (902) may be the current block or one of the sub-blocks into which the current block is divided. At this time, the prediction unit of the chroma component may have a size corresponding to the prediction unit of the luma component according to the color format. Alternatively, after the prediction units of the luma component and the chroma component are determined separately, prediction may be performed on the prediction unit of the chroma component.

[0165] The prediction technology determination unit (904) determines the prediction technology for each prediction unit. As described above, the prediction technology may be one of inter-prediction, intra-prediction, IBC mode, and palette mode. In this case, the prediction technology for the chroma component can be determined in the same manner as the prediction technology for the corresponding luma component, without separate signaling or parsing of information.

[0166] For example, if the prediction technique of the current block is not intra prediction, the video decoding device parses 1-bit flag information. For example, if the parsed flag indicates Skip mode, the video decoding device determines the prediction mode of the current block as the merge mode of inter prediction or the IBC merge mode. In the case of Skip mode, the video decoding device can use the prediction signals as restored signals without performing the inverse transformation process (i.e., without parsing the residual signals).

[0167] On the other hand, if the parsed flag does not indicate a Skip mode for the current block, the prediction technique determination unit (904) can parse a series of 1-bit flags to determine the prediction technique of the current block as one of techniques such as inter prediction, intra prediction, IBC mode, palette mode, etc.

[0168] For example, if Skip is not applied to the current block and the prediction technique is determined to be Inter-Prediction or IBC mode, the video decoding device parses a 1-bit flag. Depending on the parsed flag, the prediction mode of the current block can be determined as either General Merge mode or Advanced Motion Vector Prediction (AMVP) mode.

[0169] The prediction mode determination unit (906) determines a detailed prediction mode for the prediction technology.

[0170] For example, if the prediction technology of the current block is inter prediction, the prediction mode determining unit (906) can determine the general merge mode or AMVP mode as the prediction mode of the current block. In the general merge mode or AMVP mode, the image decoding device generates prediction blocks according to one or more motion compensations based on parsed motion information, and weights and combines the generated multiple prediction blocks to generate final prediction signals of the current block.

[0171] As another example, if the prediction technique of the current block is inter prediction, the prediction mode determining unit (906) may determine Geometric Partitioning Mode (GPM) as the prediction mode of the current block. In GPM, the image decoding device divides the current block into two or more partition blocks according to geometric partitioning, generates prediction blocks according to one or more motion compensations based on motion information of the parsed current block, and weights and combines the generated multiple prediction blocks to generate final prediction signals of the current block. For example, as described above, the current block may be divided into two partition blocks.

[0172] The prediction execution unit (908) generates a prediction block of the current block according to the determined prediction technology and prediction mode.

[0173] As an example, the prediction performing unit (908) generates a prediction block of the current block according to the prediction mode, and the adder (550) adds the prediction block of the current block and residual signals to generate a restoration block.

[0174] Meanwhile, the entropy decoding unit (510) can restore the quantized second-order transform coefficients when the second-order transform is applied. On the other hand, when the second-order transform is not applied, the entropy decoding unit (510) can restore the quantized first-order transform coefficients. The inverse quantization unit (520) can apply inverse quantization to the restored transform coefficients based on the quantization parameter to generate inverse quantized transform coefficients.

[0175] The transformation unit determination unit (910) of the inverse transformation unit (530) determines a transformation unit (TU) for the inverse quantized transformation coefficients. At this time, if one TU is divided into multiple sub-blocks, one sub-block can be used as a TU.

[0176] The inverse transform unit (530) can determine a non-separable second-order inverse transform kernel and a separable first-order inverse transform kernel when a second-order transform is applied. On the other hand, when the second-order transform is not applied, the inverse transform unit (530) can determine a separable first-order inverse transform kernel or a non-separable first-order inverse transform kernel.

[0177] Hereinafter, the geometric partitioning mode, GPM partitioning mode, and GPM-based partitioning mode are used interchangeably. In addition, as described above, the two partition blocks according to GPM are defined as the first partition block and the second partition block, respectively.

[0178] As an example, if the prediction technology of the current block is inter prediction and the current block is predicted according to GPM, the prediction performing unit (908) in the image decoding device according to the present disclosure can predict the current block as follows.

[0179] When the current block is predicted according to GPM, the video decoding device generates a merge list according to the general merge mode, and then generates a GPM (motion vector) merge list using the merge list. The GPM merge list may be the GPM merge list illustrated in FIG. 8. The video decoding device decodes gpm_mode_idx and merge_index. Here, the GPM index gpm_mode_idx may be merge_gpm_partition_idx according to Table 1 and indicates one of the GPM partition modes. The merge index merge_index may indicate a motion information predictor in the GPM merge list. The video decoding device determines a geometric partition mode according to gpm_mode_idx, and determines motion information, i.e., motion vectors, of partitioned blocks using merge_idx and the GPM merge list.

[0180] FIG. 10 is an exemplary diagram showing blending of surrounding reference pixels of reference blocks according to one embodiment of the present disclosure.

[0181] As in the example of Fig. 10, the video decoding device calculates a first reference block (B) based on the motion vector of the upper left block (i.e., the first split block) and a second reference block (B) based on the motion vector of the lower right block (i.e., the second split block). The video decoding device can blend the two reference blocks to generate a prediction block (B`) and use the blended prediction block to generate final prediction signals of the current block.

[0182] At this time, in order to apply local lighting compensation to the current block, the image decoding device selects reference pixels (i.e., reference templates) B_refp1 and B_refp2 for local lighting compensation for each of the two reference blocks (B). The image decoding device applies blending mask-based filtering to the reference pixels to derive surrounding reference pixels B_refp` of the blended prediction block. The image decoding device calculates LIC parameters α and β according to a linear relationship as in Equation 2 based on the surrounding reference pixels B_refp` of the blended prediction block (i.e., templates of the blended prediction block) and the surrounding reference pixels A_refp of the current block (i.e., templates of the current block).

[0183]

[0184] In Equation 2, for example, the LIC parameters can be derived based on the least squares method as in Equations 3 and 4.

[0185]

[0186]

[0187] In Equations 3 and 4, C(n) are pixel values ​​within the template of the current block used to derive LIC parameters, and R(n) are pixel values ​​within the template of the blended prediction block used to derive LIC parameters. N represents the number of pixels used to derive LIC parameters.

[0188] To apply local illumination compensation in geometric segmentation mode, the image decoding device can generate final prediction signals of the current block by applying the calculated LIC parameters to the blended prediction block B.

[0189] Hereinafter, a method for applying local illumination compensation in GPM mode by an image decoding device according to the present disclosure is described in detail.

[0190] An image decoding device determines whether to apply local illumination compensation-based prediction in GPM mode by using decoding of related syntax. At this time, whether to apply local illumination compensation-based prediction may be transmitted from an image encoding device to an image decoding device using a higher-level syntax. Alternatively, the syntax may be transmitted from an image encoding device to an image decoding device using a syntax of a block unit or block group of a specific size, such as each CTU, CU, etc. The image decoding device determines whether a current block is predicted according to a geometric partitioning mode and whether local illumination compensation is applied based on the decoded syntax. Here, the syntax may include a flag indicating whether to apply the GPM mode and a flag indicating whether to apply the local illumination compensation-based prediction.

[0191] To apply LIC to the current block, the image decoding device determines the availability of surrounding reference pixels used to model the linear relationship for local illumination compensation. Here, the availability includes not only the presence of previously decoded surrounding reference pixels (A_refp, B_refp1, and B_refp2, i.e., reference templates), but also whether the surrounding reference pixels can be used to apply local illumination compensation to the current block. If the template A_refp of the current block to be used for local illumination compensation is not available, the image decoding device can perform prediction / decoding of the current block without performing the steps related to local illumination compensation. Alternatively, the image decoding device can perform prediction / decoding of the current block by assigning α to 1 and β to 0 without performing the steps for calculating LIC parameters.

[0192] When the surrounding reference pixels A_refp of the current block are available, the image decoding device determines the predicted blocks (i.e., reference blocks) B of the divided blocks by performing compensation based on the motion vector for each of the divided blocks according to the geometrical division mode. At this time, as described above, the motion information of the divided blocks can be generated from the merge index and the GPM merge list.

[0193] The video decoding device determines the availability of B_refp1 and B_refp2, which are surrounding reference pixels of the reference blocks. At this time, although B exists, all or part of B_refp1 and B_refp2 may not be available depending on the location of B. If neither B_refp1 nor B_refp2 is available, the video decoding device can perform prediction / decoding of the current block without performing the step related to local illumination compensation. Alternatively, the video decoding device can perform prediction / decoding of the current block by assigning α to 1 and β to 0 without performing the step for calculating LIC parameters.

[0194] When the surrounding reference pixels A_refp of the current block are available and the surrounding reference pixels B_refp1 and B_refp2 of the reference blocks are both available, the image decoding device blends B_refp1 and B_refp2 to generate the surrounding reference pixels B_refp` of the prediction block. Thereafter, the image decoding device can calculate the LIC parameters α and β based on the surrounding reference pixels B_refp` of the blended prediction block and the surrounding reference pixels A_refp of the current block, and apply the calculated LIC parameters to the blended prediction block to generate the final prediction signals of the current block.

[0195] As another example, the image decoding device may not use all pixels included in A_refp, B_refp1, and B_refp2. The image decoding device may filter A_refp, B_refp1, and B_refp2 or extract some pixels from A_refp, B_refp1, and B_refp2 to generate some pixels, and use some of the generated pixels to calculate the LIC parameters α and β.

[0196] As another example, if some of B_refp1 and B_refp2 are available depending on the position of B, the video decoding device can calculate the LIC parameters α, β using only the available some. For example, as in the example of FIG. 11, if only the left pixels of B_refp1 and the top pixels of B_refp2 are available, the video decoding device can calculate the LIC parameters α, β using the left pixels of A_refp, the left pixels of B_refp1, the top pixels of A_refp, and the top pixels of B_refp2, instead of blending B_refp1 and B_refp2.

[0197] As another example, as in the example of Fig. 12, when only the left pixels of B_ref1 and the left pixels of B_ref2 are available, the image decoding device applies blending to the available pixels to derive B_refp`. The image decoding device can calculate the LIC parameters α and β using the left pixels of A_refp and B_refp`.

[0198] As another example, if only some of B_refp1 and B_refp2 are available, the image decoding device can perform prediction / decoding of the current block without performing the steps related to local illumination compensation. Alternatively, the image decoding device can perform prediction / decoding of the current block by assigning α to 1 and β to 0 without performing the steps for calculating the LIC parameters.

[0199] FIGS. 13A and 13B are exemplary diagrams showing a blending mask of reference pixels according to one embodiment of the present disclosure.

[0200] The image decoding device can use a mask of the same form as the mask used for B as a blending mask for blending B_refp1 and B_refp2 as illustrated in FIG. 13a. More precisely, as illustrated in FIG. 13b, the image decoding device can blend the reference pixels using a mask of the same form as the mask used in the pixel line within the B block that is closest to the surrounding reference pixels. In the blending mask illustrated in FIG. 13b, as the color of the pixel approaches white, the weight of the pixel increases.

[0201] FIGS. 14A and 14B are exemplary diagrams showing a blending mask of reference pixels according to another embodiment of the present disclosure.

[0202] As another example, the image decoding device can determine the shape of the mask by using the partition structure of the block including A_refp as the blending mask of B_refp1 and B_refp2, as in the example of FIG. 14a. The image decoding device can configure a mask according to the shape of the determined mask, as in the example of FIG. 14b, and then blend the reference pixels using the configured mask. In the blending mask illustrated in FIG. 14b, as the color of the pixel approaches white, the weight of the pixel increases.

[0203] When local illumination compensation is applied, the image decoding device can perform in-loop filtering by reflecting the local illumination compensation. For example, when determining the filtering strength of the deblocking filter (562) at the boundary between two adjacent blocks, the image decoding device can include the LIC parameters α and β in the parameters determining the filtering strength. For example, if (i) local illumination compensation is applied to blocks including pixels to be subjected to in-loop filtering and (ii) the α value of the two blocks is not 1 and the β value of the two blocks is not 0, even if the reference images of the two blocks including the pixels to be filtered are the same, the image decoding device can perform filtering at the boundary between the two blocks by determining BS, which determines the filtering strength of the deblocking filter (562), as 1. Alternatively, if the α values ​​of the two blocks including the pixels to be filtered are different, the image decoding device can perform filtering at the boundary between the two blocks by determining BS, which determines the filtering strength of the deblocking filter (562), as 1. Additionally, the above can also be applied when the video encoding device determines the filtering strength of the deblocking filter (182).

[0204] Below, a method of applying LIC when the current block is predicted according to GPM using the cities of FIGS. 15 and 16 is described.

[0205] FIG. 15 is a flowchart illustrating a method for an image encoding device to encode a current block according to one embodiment of the present disclosure.

[0206] The video encoding device determines a GPM index (S1500). In terms of rate distortion optimization, the video encoding device can determine a GPM index that indicates the geometric division shape of the current block.

[0207] The video encoding device divides the current block into split blocks according to the GPM index (S1502). For example, the current block may be divided into a first split block and a second split block.

[0208] The video encoding device generates a merge list according to the general merge mode, and then uses the merge list to generate a GPM (motion vector) merge list. In terms of rate distortion optimization, the video encoding device can determine a merge index. The video encoding device determines the motion information of the split blocks using the merge index and the GPM merge list.

[0209] The video encoding device generates reference blocks of the segmented blocks using motion information (S1504). Here, the reference blocks include a first reference block and a second reference block. In this case, the first reference block and the second reference block correspond to the first segmented block and the second segmented block, respectively.

[0210] The video encoding device blends reference blocks of the split blocks to generate a prediction block of the current block (S1506).

[0211] The video encoding device performs the following steps to check the availability of surrounding reference pixels used for linear modeling for local illumination compensation. In this case, the availability may include, in addition to the presence of decoded surrounding reference pixels (A_refp, B_refp1, and B_refp2), whether the surrounding reference pixels can be used for applying local illumination compensation to the current block.

[0212] The video encoding device checks the availability of surrounding reference pixels of the current block at the top and left of the current block (S1508).

[0213] If the surrounding reference pixels (A_refp) of the current block are available (Yes in S1508), the video encoding device performs the following steps.

[0214] The video encoding device checks the availability of surrounding reference pixels of each reference block at the top and left of each reference block (S1510).

[0215] As an example, when some of the surrounding reference pixels (B_refp1) of the first reference block and some of the surrounding reference pixels (B_refp2) of the second reference block are available, as in the example of FIG. 11 or FIG. 12, the image encoding device can use the available B_refp1 and B_refp2.

[0216] If all or part of the surrounding reference pixels (B_refp1 and B_refp2) of each reference block are available (Yes in S1510), the video encoding device performs the following steps.

[0217] The image encoding device blends surrounding reference pixels of reference blocks to generate surrounding reference pixels of the blended prediction block (S1512).

[0218] The image encoding device derives parameters of a linear relationship between the surrounding reference pixels of the current block and the surrounding reference pixels of the blended prediction block (S1514).

[0219] As an example, an image encoding device selects pixels used for linear modeling among the surrounding reference pixels (A_refp) of a current block and the surrounding reference pixels (B_refp') of a blended prediction block, and then calculates parameters (α, β) of a linear relationship using the selected reference pixels. The pixels used for calculating the parameters may be all or part of the surrounding reference pixels (A_refp) of the current block and the surrounding reference pixels (B_refp') of the blended prediction block. At this time, the surrounding reference pixels of the blended prediction block corresponding to the positions of the surrounding reference pixels of the current block are used for deriving the parameters.

[0220] The image encoding device applies local lighting compensation to the blended prediction block using parameters of a linear relationship, thereby generating a first final prediction block of the current block (S1516).

[0221] If the surrounding reference pixels (A_refp) of the current block are not available (No in S1508) or the surrounding reference pixels (B_refp1 and B_refp2) of the reference blocks are not available (No in S1510), the video encoding device derives the blended prediction block as the second final prediction block of the current block (S1518). For example, the video encoding device generates the second final prediction block of the current block without performing operations related to local illumination compensation. Alternatively, the video encoding device omits the process of deriving parameters of the linear relationship. That is, the video encoding device generates the second final prediction block of the current block by assigning α to 1 and β to 0 and omitting local illumination compensation.

[0222] The image encoding device determines a flag indicating whether to apply local lighting compensation based on the first final prediction block and the second final prediction block (S1520).

[0223] In terms of rate distortion optimization, the video encoding device can determine a flag indicating whether to apply local illumination compensation. For example, if the first final prediction block is optimal, the video encoding device sets the flag to true. Conversely, if the second final prediction block is optimal, the video encoding device sets the flag to false.

[0224] The video encoding device encodes a flag (S1522).

[0225] For example, an image encoding device can determine whether to apply local illumination compensation to an image or slice. A flag indicating whether to apply local illumination compensation can be transmitted using a higher-level syntax, or using syntax at the block level or block group level, such as a CTU or CU.

[0226] Depending on the value of the flag indicating whether to apply local illumination compensation, the image encoding device generates a residual block by subtracting the first final prediction block or the second final prediction block from the current block. The image encoding device transforms / quantizes the residual block to generate quantized transform coefficients and encodes the quantized transform coefficients.

[0227] FIG. 16 is a flowchart illustrating a method for an image decoding device to restore a current block according to one embodiment of the present disclosure.

[0228] The video decoding device decodes a GPM index from a bitstream (S1600).

[0229] The video decoding device divides the current block into split blocks according to the GPM index (S1602). For example, the current block may be divided into a first split block and a second split block.

[0230] The video decoding device generates a merge list according to the general merge mode, and then generates a GPM (motion vector) merge list using the merge list. The video decoding device can decode the merge index from the bitstream. The video decoding device determines the motion information of the split blocks using the merge index and the GPM merge list.

[0231] The video decoding device generates reference blocks of the segmented blocks using motion information (S1604). Here, the reference blocks include a first reference block and a second reference block. In this case, the first reference block and the second reference block correspond to the first segmented block and the second segmented block, respectively.

[0232] The video decoding device blends reference blocks of the split blocks to generate a prediction block of the current block (S1606).

[0233] The video decoding device decodes a flag indicating whether to apply local lighting compensation from the bitstream (S1608).

[0234] For example, an image decoding device can determine whether to apply local illumination compensation to an image or slice. A flag indicating whether to apply local illumination compensation can be transmitted using high-level syntax, or using syntax at the block level or block group level, such as a CTU or CU.

[0235] The video decoding device checks the flag (S1610).

[0236] If the flag indicating whether to apply local lighting compensation is true (Yes in S1610), the image decoding device performs the following steps to check the availability of surrounding reference pixels used for linear modeling for local lighting compensation. In this case, the availability may include, in addition to the presence of decoded surrounding reference pixels (A_refp, B_refp1, and B_refp2), whether the surrounding reference pixels can be used for applying local lighting compensation to the current block.

[0237] The video decoding device checks the availability of surrounding reference pixels of the current block (S1612).

[0238] If the surrounding reference pixels (A_refp) of the current block are available (Yes in S1612), the image decoding device performs the following steps.

[0239] The video decoding device checks the availability of surrounding reference pixels of each reference block at the top and left of each reference block (S1614).

[0240] As an example, when some of the surrounding reference pixels (B_refp1) of the first reference block and some of the surrounding reference pixels (B_refp2) of the second reference block are available, as in the example of FIG. 11 or FIG. 12, the image decoding device can use the available B_refp1 and B_refp2.

[0241] When all or part of the surrounding reference pixels (B_refp1 and B_refp2) of each reference block are available, the image decoding device performs the following steps.

[0242] The image decoding device blends surrounding reference pixels of reference blocks to generate surrounding reference pixels of the blended prediction block (S1616).

[0243] The image decoding device derives parameters of a linear relationship between the surrounding reference pixels of the current block and the surrounding reference pixels of the blended prediction block (S1618).

[0244] As an example, an image decoding device selects pixels used for linear modeling among the surrounding reference pixels (A_refp) of the current block and the surrounding reference pixels (B_refp') of the blended prediction block, and then calculates parameters (α, β) of the linear relationship using the selected reference pixels. The pixels used for calculating the parameters may be all or part of the surrounding reference pixels (A_refp) of the current block and the surrounding reference pixels (B_refp') of the blended prediction block. At this time, the surrounding reference pixels of the blended prediction block corresponding to the positions of the surrounding reference pixels of the current block are used for deriving the parameters.

[0245] The image decoding device applies local lighting compensation to the blended prediction block using parameters of a linear relationship, thereby generating a final prediction block of the current block (S1620).

[0246] On the other hand, if the flag indicating whether to apply local lighting compensation is false (No in S1610), if the surrounding reference pixels (A_refp) of the current block are not available (No in S11612), or if the surrounding reference pixels (B_refp1 and B_refp2) of the reference blocks are not available (No in S11614), the image decoding device derives the blended prediction block as the final prediction block of the current block (S1630).

[0247] As another example, even if some of the surrounding reference pixels (B_refp1 and B_refp2) of the reference block are available, the image decoding device derives the blended prediction block as the final prediction block of the current block.

[0248] For example, the image decoding device generates the final predicted block of the current block without performing operations related to local illumination compensation. Alternatively, the image decoding device omits the process of deriving the parameters of the linear relationship. That is, the image decoding device generates the final predicted block of the current block by assigning α to 1 and β to 0, omitting local illumination compensation.

[0249] The video decoding device decodes quantized transform coefficients from the bitstream and dequantizes / inversely transforms the quantized transform coefficients to restore the residual block. The video decoding device adds the final prediction block of the current block and the residual block to generate a restored block of the current block.

[0250] Although the flowchart / timing diagram of this specification describes each process as being executed sequentially, this is merely an illustrative description of the technical idea of ​​one embodiment of the present disclosure. In other words, a person of ordinary skill in the art to which one embodiment of the present disclosure belongs may modify and apply various modifications and variations by changing the order described in the flowchart / timing diagram without departing from the essential characteristics of one embodiment of the present disclosure, or by executing one or more of the processes in parallel. Therefore, the flowchart / timing diagram is not limited to a chronological order.

[0251] It should be understood that the exemplary embodiments described above can be implemented in many different ways. The functions or methods described in one or more examples can be implemented in hardware, software, firmware, or any combination thereof. It should be understood that the functional components described herein are labeled as "units" to further emphasize their implementation independence.

[0252] Meanwhile, the various functions or methods described in this embodiment may also be implemented as instructions stored on a non-transitory storage medium that can be read and executed by one or more processors. Non-transitory storage media include, for example, all types of storage devices that store data in a form readable by a computer system. For example, non-transitory storage media include storage media such as erasable programmable read-only memory (EPROM), flash drives, optical drives, magnetic hard drives, and solid-state drives (SSDs).

[0253] The above description is merely an example of the technical idea of ​​the present embodiment, and those skilled in the art will appreciate that various modifications and variations can be made without departing from the essential characteristics of the present embodiment. Therefore, the present embodiments are not intended to limit the technical idea of ​​the present embodiment, but rather to explain it, and the scope of the technical idea of ​​the present embodiment is not limited by these embodiments. The scope of protection of the present embodiment should be interpreted by the claims below, and all technical ideas within a scope equivalent thereto should be interpreted as being included in the scope of rights of the present embodiment.

[0254] (Explanation of symbols)

[0255] 124: Inter Prediction Department

[0256] 544: Inter Prediction Department

[0257] 902: Prediction Unit Decision Unit

[0258] 904: Prediction Technology Decision Division

[0259] 906: Prediction mode decision unit

[0260] 908: Prediction Performance Department

[0261]

[0262] CROSS-REFERENCE TO RELATED APPLICATION

[0263] This patent application claims priority to Korean patent application No. 10-2023-0063330, filed in Korea on May 16, 2023, and Korean patent application No. 10-2024-0059764, filed in Korea on May 7, 2024, the entire contents of which are incorporated herein by reference.

Claims

1. A method for restoring a current block performed by a video decoding device, A step of decoding a geometric partitioning mode index from a bitstream; A step of dividing the current block into split blocks according to the geometric splitting mode index; A step of generating reference blocks of the above-described segmented blocks using motion information, wherein the reference blocks include a first reference block and a second reference block; A step of generating a prediction block of the current block by blending reference blocks of the above split blocks; and A step of checking the availability of surrounding reference pixels of the current block at the top and left of the current block. Including, If the surrounding reference pixels of the current block are available, Step of checking the availability of surrounding reference pixels of each reference block at the top and left of each reference block. Including more, If all or part of the surrounding reference pixels of each of the above reference blocks are available, A step of generating surrounding reference pixels of the blended prediction block by blending surrounding reference pixels of the above reference blocks; A step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the blended prediction block; and A step of generating a final prediction block of the current block by applying local lighting compensation to the blended prediction block using the parameters of the linear relationship above. A method, characterized by including:

2. In paragraph 1, A step of decoding a flag indicating whether to apply the local lighting compensation from the bitstream; and Steps to check the above flags Including more, A method characterized in that, if the above flag is true, a step of checking the availability of surrounding reference pixels of the current block is performed.

3. In paragraph 1, If the above flag is false, A step of deriving the blended prediction block as the final prediction signals of the current block. A method, characterized in that it further comprises:

4. In paragraph 1, If the surrounding reference pixels of the current block are not available, or if the surrounding reference pixels of each reference block are not available, A step of deriving the blended prediction block as the final prediction signals of the current block. A method, characterized in that it further comprises:

5. In paragraph 1, The step of deriving the parameters of the above linear relationship is: A method characterized in that the parameters are derived by applying a linear least square method to the surrounding reference pixels of the current block and the surrounding reference pixels of the blended prediction block.

6. In paragraph 1, The step of deriving the parameters of the above linear relationship is: A method characterized in that, when only the left peripheral reference pixels of the first reference block and the upper peripheral reference pixels of the second reference block are available, the parameters of the linear relationship are derived using the left peripheral reference pixels of the current block and the left peripheral reference pixels of the first reference block, and the upper peripheral reference pixels of the current block and the upper peripheral reference pixels of the second reference block, without blending the left peripheral reference pixels of the first reference block and the upper peripheral reference pixels of the second reference block.

7. In paragraph 1, When only the left peripheral reference pixels of the first reference block and the left peripheral reference pixels of the second reference block are available, The step of generating surrounding reference pixels of the above blended prediction block is: A method characterized in that the left peripheral reference pixels of the first reference block and the left peripheral reference pixels of the second reference block are blended to generate the left peripheral reference pixels of the blended prediction block.

8. In paragraph 7, The step of deriving the parameters of the above linear relationship is: A method characterized in that parameters of the linear relationship are derived using left surrounding reference pixels of the current block and left surrounding reference pixels of the blended prediction block.

9. In paragraph 1, The step of generating surrounding reference pixels of the above blended prediction block is: A method characterized by blending surrounding reference pixels of the reference blocks using the same blending mask used to generate the blended prediction block.

10. In paragraph 1, The step of generating surrounding reference pixels of the above blended prediction block is: A method characterized by blending surrounding reference pixels of the reference blocks using a blending mask determined according to a division structure of a block including the current block.

11. In paragraph 1, Further comprising a step of applying in-loop filtering to the boundary between the final predicted block to which the above local lighting compensation is applied and the adjacent block, The step of applying the above in-loop filtering is: A method characterized in that the filtering strength at the boundary is determined by using parameters of linear relationships between the final prediction block and adjacent blocks.

12. A method for encoding a current block performed by a video encoding device, A step of determining a geometric partitioning mode index; A step of dividing the current block into split blocks according to the geometric splitting mode index; A step of generating reference blocks of the above-described segmented blocks using motion information, wherein the reference blocks include a first reference block and a second reference block; A step of generating a prediction block of the current block by blending reference blocks of the above split blocks; and A step of checking the availability of surrounding reference pixels of the current block at the top and left of the current block. Including, If the surrounding reference pixels of the current block are available, Step of checking the availability of surrounding reference pixels of each reference block at the top and left of each reference block. Including more, If all or part of the surrounding reference pixels of each of the above reference blocks are available, A step of generating surrounding reference pixels of the blended prediction block by blending surrounding reference pixels of the above reference blocks; A step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the blended prediction block; and A step of generating a first final prediction block of the current block by applying local lighting compensation to the blended prediction block using the parameters of the linear relationship above. A method, characterized by including:

13. In paragraph 12, A step of deriving the blended prediction block as the second final prediction block of the current block; A step of determining a flag indicating whether to apply the local lighting compensation based on the first final prediction block and the second final prediction block; and Step of encoding the above flag A method, characterized in that it further comprises:

14. In paragraph 12, If the surrounding reference pixels of the current block are not available, or if the surrounding reference pixels of the reference block are not available, A method characterized in that the step of generating the first final prediction block is omitted.

15. A method for providing video data to a video decoding device, A step of encoding the above video data into a bitstream; and A step of transmitting the above bitstream to the image decoding device Including, The step of encoding the above video data is: A step of determining a geometric partitioning mode index; A step of dividing the current block into split blocks according to the geometric partitioning mode index; A step of generating reference blocks of the above-described segmented blocks using motion information, wherein the reference blocks include a first reference block and a second reference block; A step of generating a prediction block of the current block by blending reference blocks of the above split blocks; and A step of checking the availability of surrounding reference pixels of the current block at the top and left of the current block. Including, If the surrounding reference pixels of the current block are available, Step of checking the availability of surrounding reference pixels of each reference block at the top and left of each reference block. Including more, If all or part of the surrounding reference pixels of each of the above reference blocks are available, A step of generating surrounding reference pixels of the blended prediction block by blending surrounding reference pixels of the above reference blocks; A step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the blended prediction block; and A step of generating a final prediction block of the current block by applying local lighting compensation to the blended prediction block using the parameters of the linear relationship above. A method, characterized by including:

Citation Information

Patent Citations

  • Deblocking filtering for displaced intra prediction and template matching

    KR101705138B1

  • Auto combining apparatus for hardware

    KR1020230040745A

  • Apparatus for supplying lubricant and looper equipment having the same

    KR1020240044215A

  • Method for processing video signal by using local illumination compensation (LIC) mode, and apparatus therefor

    WO2023033617A1

  • KR20220101638A

Cited By

  • Encoding method, decoding method, bitstream, encoder, decoder, and storage medium

    WO2026143534A1