Method and apparatus for video coding using local illumination compensation in affine model-based prediction

By applying local lighting compensation using affine model-based prediction and control point motion vectors, the method enhances video coding efficiency and quality, addressing the challenges of increasing video data sizes and inter prediction accuracy.

WO2024237453A1PCT designated stage expired Publication Date: 2024-11-21HYUNDAI MOTOR CO LTD +2
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
PCT/KR2024/003431
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-03-18
Filing Date
2024-03-19
Publication Date
2024-11-21

AI Technical Summary

Technical Problem

Current video coding technologies face challenges in achieving high coding efficiency and picture quality due to increasing video data sizes, particularly in inter prediction, where illumination compensation is needed to improve prediction efficiency.

Method used

The method involves deriving a linear relationship between surrounding reference pixels of a current block and a reference block using affine model-based prediction, applying local lighting compensation to enhance video coding efficiency and quality by dividing blocks into subblocks and using control point motion vectors to generate motion vectors and prediction blocks.

Benefits of technology

This approach improves video coding efficiency and quality by accurately predicting blocks through local lighting compensation, reducing computational complexity and bit requirements, while maintaining high prediction accuracy.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure KR2024003431_21112024_PF_FP_ABST
    Figure KR2024003431_21112024_PF_FP_ABST
Patent Text Reader

Abstract

The present embodiment discloses a method and apparatus for video coding using local illumination compensation in affine model-based prediction. In the present embodiment, an image decoding apparatus generates motion vectors of sub-blocks by using the form of an affine model and control point motion vectors. The image decoding apparatus generates a reference block of the current block by deriving sub-reference blocks of the sub-blocks by using the motion vectors. When adjacent reference pixels of the current block are available, the image decoding apparatus selects locations of adjacent reference pixels of each sub-reference block for upper sub-reference blocks and left sub-reference blocks of the reference block. When adjacent reference pixels of the reference block are available at the selected locations, the image decoding apparatus derives a linear relation between the adjacent reference pixels of the current block and the adjacent reference pixels of the reference block, and applies local illumination compensation on the reference block by using the linear relation to generate a prediction block of the current block.
Need to check novelty before this filing date? Find Prior Art

Description

Method and device for video coding using local illumination compensation in affine model-based prediction

[0001] The present disclosure relates to a video coding method and device using local illumination compensation in affine model-based prediction.

[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] To improve the prediction efficiency of inter prediction, a method of compensating for the illumination of a decoded image based on a reference image can be applied. The decoder derives a local illumination difference between the reference block and the current block using the surrounding pixels of the reference block and the surrounding pixels of the current block, and then applies the derived relationship to the reference block to perform local illumination compensation (LIC) of the current block. Meanwhile, to enhance video encoding efficiency and improve video quality, a method of applying the aforementioned local illumination compensation to affine model-based prediction needs to be considered.

[0007] The purpose of the present disclosure is to provide a video coding method and device for predicting a current block in units of subblocks based on an affine model, deriving a linear relationship between surrounding reference pixels of a current block and surrounding reference pixels of a reference block, and applying local lighting compensation to the reference block using the linear relationship.

[0008] According to an embodiment of the present disclosure, a method for restoring a current block, performed by an image decoding device, comprises: obtaining a shape of an affine model of the current block and deriving control point motion vectors; generating motion vectors of sub-blocks using the shape of the affine model and the control point motion vectors, wherein the sub-blocks are blocks into which the current block is divided; deriving sub-reference blocks of the sub-blocks using the motion vectors, thereby generating a reference 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, calculating positions of surrounding reference pixels of each sub-reference block with respect to the top sub-reference blocks and the left sub-reference blocks of the reference block; And the method further comprises a step of checking the availability of the surrounding reference pixels of each sub-reference block at the calculated positions, thereby checking the availability of the surrounding reference pixels of the reference block, and, if all or part of the surrounding reference pixels of the reference block are available, 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 reference block; and a step of applying local lighting compensation to the reference block using the parameters of the linear relationship, thereby generating a prediction block of the current block.

[0009] According to another embodiment of the present disclosure, a method for encoding a current block, performed by a video encoding apparatus, comprises: determining a form of an affine model of the current block and deriving control point motion vectors; generating motion vectors of sub-blocks using the affine model and the control point motion vectors, wherein the sub-blocks are blocks into which the current block is divided; deriving sub-reference blocks of the sub-blocks using the motion vectors, thereby generating a reference 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, calculating positions of surrounding reference pixels of each sub-reference block with respect to the top sub-reference blocks and the left sub-reference blocks of the reference block; And the method further comprises a step of checking the availability of the surrounding reference pixels of each sub-reference block at the calculated positions, thereby checking the availability of the surrounding reference pixels of the reference block, and, if all or part of the surrounding reference pixels of the reference block are available, 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 reference block; and a step of applying local lighting compensation to the reference block using the parameters of the linear relationship, thereby generating a first prediction block of the current block.

[0010] According to another embodiment of the present disclosure, a computer-readable recording medium storing a bitstream generated by an image encoding method comprises: determining a form of an affine model of a current block and deriving control point motion vectors; generating motion vectors of sub-blocks using the affine model and the control point motion vectors, wherein the sub-blocks are blocks into which the current block is divided; deriving sub-reference blocks of the sub-blocks using the motion vectors, thereby generating a reference 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, calculating positions of surrounding reference pixels of each sub-reference block with respect to the top sub-reference blocks and the left sub-reference blocks of the reference block; And the step of checking the availability of the surrounding reference pixels of each sub-reference block at the calculated positions to check the availability of the surrounding reference pixels of the reference block, and when all or part of the surrounding reference pixels of the reference block are available, the step of deriving parameters of a linear relationship between the surrounding reference pixels of the current block and the surrounding reference pixels of the reference block; and the step of applying local lighting compensation to the reference block using the parameters of the linear relationship, thereby generating a prediction block of the current block is provided.

[0011] As described above, according to the present embodiment, when predicting a current block in units of sub-blocks based on an affine model, a linear relationship is derived between the surrounding reference pixels of the current block and the surrounding reference pixels of the reference block, and local lighting compensation is applied to the reference block using the linear relationship, thereby providing a video coding method and device, thereby making it possible to improve video encoding efficiency and enhance video quality.

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

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

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

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

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

[0017] FIG. 6 is an exemplary diagram illustrating calculation of an affine model per pixel according to one embodiment of the present disclosure.

[0018] FIG. 7 is an exemplary diagram showing the calculation of an affine model using a center vector according to one embodiment of the present disclosure.

[0019] FIG. 8 is an exemplary diagram illustrating calculation of an affine model in sub-block units according to one embodiment of the present disclosure.

[0020] Figure 9 is an example diagram showing local lighting compensation.

[0021] Figure 10 is another example showing local lighting compensation.

[0022] FIG. 11 is an exemplary diagram showing local lighting compensation in affine model-based prediction according to one embodiment of the present disclosure.

[0023] FIG. 12 is an exemplary diagram showing surrounding reference pixels used for local illumination compensation according to one embodiment of the present disclosure.

[0024] FIG. 13 is an exemplary diagram showing a method for an image encoding device to encode a current block according to one embodiment of the present disclosure.

[0025] FIG. 14 is an exemplary diagram showing surrounding reference pixels used for local illumination compensation according to another embodiment of the present disclosure.

[0026] FIG. 15 is an exemplary diagram showing a method for an image decoding device to restore a current block according to one embodiment of the present disclosure.

[0027] 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.

[0028] 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.

[0029] 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).

[0030] 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.

[0031] 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.

[0032] 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.

[0033] 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.

[0034] 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).

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

[0036] 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.

[0037] 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.

[0038] 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.

[0039] 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.

[0040] 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).

[0041] 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.

[0042] 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.

[0043] 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.

[0044] 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.

[0045] 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.

[0046] 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.

[0047] 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.

[0048] 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.

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

[0050] 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'.

[0051] 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.

[0052] 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.

[0053] 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.

[0054] 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.

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

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

[0057] 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.

[0058] 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.

[0059] 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.

[0060] 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.

[0061] 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.

[0062] 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.

[0063] 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.

[0064] 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.

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

[0066] 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.

[0067] 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.

[0068] 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.

[0069] 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.

[0070] 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.

[0071] 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.

[0072] 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.

[0073] 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.

[0074] 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.

[0075] 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.

[0076] 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).

[0077] 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.

[0078] 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.

[0079] 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.

[0080] 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.

[0081] 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.

[0082] 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.

[0083] 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.

[0084] 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.

[0085] 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.

[0086] 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.

[0087] 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.

[0088] 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.

[0089] 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.

[0090] 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.

[0091] 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.

[0092] 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.

[0093] 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.

[0094] 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.

[0095] 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.

[0096]

[0097] The present embodiment relates to encoding and decoding of images (video) as described above. More specifically, a video coding method and device are provided, which, when predicting a current block in sub-block units based on an affine model, derives a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the reference block, and applies local lighting compensation to the reference block using the linear relationship.

[0098] 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.

[0099] 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).

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

[0101] 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.

[0102] I. Affine Model-Based Prediction

[0103] An affine model derives geometric relationships between object signals or background signals in a video that change according to the movement of the camera or object in space and time, and models these relationships. Theoretically, if a relationship representing a three-dimensional affine model for the same object is perfectly derived, perfect prediction is possible using this relationship. However, such perfect prediction is only theoretically possible. In video coding, prediction errors can be compensated for using the predicted signal and the differential signal predicted based on the model. Prediction methods based on affine models have the effect of improving encoding efficiency by relying on improved prediction accuracy, but they also increase the computational complexity required to calculate the affine model.

[0104] FIG. 6 is an exemplary diagram illustrating calculation of an affine model per pixel according to one embodiment of the present disclosure.

[0105] In order to reduce the computational complexity, in the embodiment of FIG. 6, the possibility that the pixel values ​​and motion information of the current block and the surrounding blocks are the same or similar is utilized. The image decoding device predicts the control point motion vector (CPMV) using the motion vector of the block adjacent to the position corresponding to the vertex (A, B, C) of the current block. The image decoding device models the geometric transformation relationship between the current block and the predicted block, i.e., the affine model, using the control point motion vectors, and then performs the prediction of the current block based on the modeled transformation relationship. In the example of FIG. 6, a 6-parameter model using the control point motion vectors of three points A, B, and C is presented, but a 4-parameter model using the control point motion vectors of two points A, B or A, C may be used depending on the embodiment. According to the 4-parameter model and the 6-parameter model, the motion vector (mv) at the target block (x, y) pixelx , mv y ) can be expressed as in mathematical expressions 1 and 2, respectively, using the control point motion vector and the position of each pixel.

[0106]

[0107]

[0108] Here, W and H represent the width and height of the current block. (cpmv ix , cpmv iy ) represents the motion vector of the i-th control point. The predicted value for each pixel of the current block can be predicted using the motion vector calculated according to Equation 1 or Equation 2. Although not included in the affine model, CPMVP4 can be defined for location D, as in the example of Fig. 6. Since location D is a pixel that has not yet been restored, the motion vector of the co-located pixel in the reference picture can be used as CPMVP4.

[0109] In the example of Fig. 6, CPMVP represents a control point motion vector predictor in the affine AMVP mode. Since the motion vector difference (MVD) is not transmitted in the affine merge mode, CPMVP is identical to CPMV. Since the motion vector difference is transmitted in the affine AMVP mode, CPMV can be calculated by adding the CPMVP and MVD. The example of Fig. 6 shows a method of using a combination among the methods for generating a control point motion vector predictor in the affine AMVP mode. The affine merge mode and the affine AMVP mode will be described later.

[0110] FIG. 7 is an exemplary diagram showing the calculation of an affine model using a center vector according to one embodiment of the present disclosure.

[0111] In addition, in order to reduce computational complexity according to an embodiment, the image decoding device may perform block-by-block prediction using each control point motion vector as a center vector, as in the example of FIG. 7. At this time, assuming that the current block has four control point motion vectors, the current block may be divided into four blocks. In the method illustrated in FIG. 7, blocks using each control point motion vector as a center vector may be predicted based on the same motion vector. Therefore, compared to the embodiment in which calculation is performed on a pixel-by-pixel basis, the prediction accuracy may be lower, but the computational complexity may be reduced.

[0112] FIG. 8 is an exemplary diagram illustrating calculation of an affine model in sub-block units according to one embodiment of the present disclosure.

[0113] For example, in order to reduce computational complexity, an image decoding device may perform prediction in units of subblocks, as in the example of FIG. 8. If the width or height of a current block is greater than the width or height of a subblock, the image decoding device may divide the current block into subblocks. The image decoding device derives a control point motion vector at each vertex position of each subblock using the control point motion vectors of the current block, and then derives one representative motion vector from among the control point motion vectors of each subblock. The image decoding device generates a prediction block in units of subblocks using the derived representative motion vector, and then combines the prediction blocks in units of subblocks to generate a first prediction block of the current block.

[0114] As another example, the video decoding device calculates the motion vector of each subblock by substituting the center position of each subblock into (x, y) of Equation 1 or Equation 2. Here, the center position may be the actual center point of the subblock or the lower right sample position of the center point. For example, in the case of a subblock having a size of 4×4 where the coordinate of the upper left sample is (0, 0), the center position of the subblock may be (1.5, 1.5) or (2, 2). The video decoding device generates a prediction block in units of subblocks using the derived motion vector, and then combines the prediction blocks in units of subblocks to generate a first prediction block of the current block.

[0115] In some embodiments, the video decoding device may filter the first prediction block to generate a second prediction block. Thereafter, the video decoding device may generate a final prediction block of the current block using one of the first prediction block and the second prediction block.

[0116] To reduce the amount of bits required for encoding control point motion vectors, the general inter prediction (translational motion prediction) methods described above, i.e., affine merge mode and affine AMVP mode, can be applied. Hereinafter, affine merge mode and affine AMVP mode are referred to as control point motion vector prediction methods.

[0117] As an example, in the case of the affine merge mode, the inter prediction unit (124) of the video encoding device constructs a predefined number (e.g., 5) of affine merge candidate lists. First, the video encoding device derives inherited affine merge candidates from the surrounding blocks of the target block. For example, the merge candidate list is generated by deriving a predefined number of inherited affine merge candidates from the surrounding samples (A0, A1, B0, B1, B2) of the target block illustrated in FIG. 4. Each of the inherited affine merge candidates included in the candidate list corresponds to a combination of two or three CPMVs.

[0118] An image encoding device derives inherited affine merge candidates from control point motion vectors of neighboring blocks of a target block predicted in an affine mode. In some embodiments, the number of merge candidates derived from neighboring blocks predicted in an affine mode may be limited. For example, the image encoding device may derive two inherited affine merge candidates, one from A0 and A1, and one from B0, B1, and B2, from neighboring blocks predicted in an affine mode. The priorities may be in the order of A0 and A1, and then in the order of B0, B1, and B2.

[0119] Meanwhile, when the total number of merge candidates is three or more, the image encoding device can derive the insufficient number of constructed affine merge candidates from the translational motion vectors of the surrounding blocks, as in the example of FIG. 6.

[0120] The video encoding device derives control point motion vectors CPMV1, CPMV2, and CPMV3 from the neighboring block group {B2, B3, A2}, the neighboring block group {B1, B0}, and the neighboring block group {A1, A0}, respectively. As an example, the priorities within each neighboring block group may be in the order of B2, B3, and A2, the order of B1, B0, and the order of A1, A0. In addition, another control point motion vector CPMV4 is derived from the co-located block C0 within the reference picture. The video encoding device generates the insufficient number of combined affine merge candidates by combining two or three of the four control point motion vectors. The priorities of the combinations are as follows. The elements within each group are listed in the order of upper-left, upper-right, and lower-left control point motion vectors.

[0121] {CPMV1, CPMV2, CPMV3}, {CPMV1, CPMV2, CPMV4}, {CPMV1, CPMV3, CPMV4},

[0122] {CPMV2, CPMV3, CPMV4}, {CPMV1, CPMV2}, {CPMV1, CPMV3}

[0123] If the merge candidate list cannot be filled using the inherited affine merge candidates and the combined affine merge candidates, the video encoding device can add a zero motion vector as a candidate.

[0124] In order to optimize encoding efficiency, a video encoding device selects a merge candidate from a merge candidate list and determines a merge index indicating the merge candidate. The video encoding device performs affine motion prediction on a target block using the selected merge candidate. When the merge candidate consists of two control point motion vectors, affine motion prediction is performed using a 4-parameter model. On the other hand, when the merge candidate consists of three control point motion vectors, affine motion prediction is performed using a 6-parameter model. The video encoding device encodes the merge index and signals it to a video decoding device.

[0125] The video decoding device decodes the merge index. The inter prediction unit (544) of the video decoding device constructs a merge candidate list in the same manner as the video encoding device, and performs affine motion prediction using control point motion vectors corresponding to the merge candidates indicated by the merge index.

[0126] As another example, in the case of the affine AMVP mode, in terms of optimizing encoding efficiency, the inter prediction unit (124) of the video encoding device determines the form of the affine model and the actual control point motion vectors according to the affine model for the target block. The video encoding device calculates the MVD, which is the difference between the actual control point motion vector and the MVP (i.e., the control point motion vector predictor) of each control point, for each control point, and then encodes the MVD of each control point. To derive each control point motion vector predictor, the inter prediction unit (124) constructs a list of affine AMVP candidates of a predefined number (e.g., 2). When the target block is of the 4-parameter type, the candidates included in the list each consist of pairs of two control point motion vectors. On the other hand, when the target block is of the 6-parameter type, the candidates included in the list each consist of pairs of three control point motion vectors.

[0127] Below, we describe a method for constructing a candidate list in the affine AMVP mode. The affine AMVP candidate list can be derived similarly to the method for constructing the affine merge candidate list described above.

[0128] The video encoding device verifies whether the reference picture of the inherited affine AMVP candidate is identical to the reference picture of the current block. Here, the inherited affine AMVP candidate may be a block predicted in affine mode among the neighboring blocks (A0, A1, B0, B1, B2) of the target block illustrated in FIG. 4, as in the aforementioned affine merge mode.

[0129] If the reference picture of the inherited affine AMVP candidate and the reference picture of the current block are the same, the video encoding device adds the corresponding inherited affine AMVP candidate.

[0130] On the other hand, if the reference picture of the inherited affine AMVP candidate and the reference picture of the current block are not the same, the video encoding device checks whether the reference pictures of all CPMVs of the combined affine AMVP candidate and the reference picture of the current block are the same. Here, all CPMVPs of the combined affine AMVP candidate can be derived from the motion vectors of the surrounding samples shown in Fig. 6, as in the affine merge mode described above. If the reference pictures of all CPMVPs of the combined affine AMVP candidate and the reference picture of the current block are the same, the video encoding device adds the corresponding combined affine AMVP candidate.

[0131] At this time, the affine model form of the target block must be considered. If the affine model form of the target block is a 4-parameter type, the video encoding device derives two control point motion vectors (upper-left and upper-right control point motion vectors of the target block) using the affine model of the surrounding block. If the affine model form of the target block is a 6-parameter type, it derives three control point motion vectors (upper-left, upper-right, and lower-left control point motion vectors of the target block) using the affine model of the surrounding block.

[0132] If the reference pictures of all CPMVPs and the reference picture of the current block are not the same, the video encoding device adds a translational motion vector as an affine AMVP candidate.

[0133] If the candidate list cannot be filled even after performing all of the above processes (i.e., the preset number cannot be filled), the video encoding device adds the zero motion vector as an affine AMVP candidate.

[0134] The video encoding device selects one candidate from the affine AMVP list and determines a candidate index indicating the selected candidate. At this time, each control point motion vector of the selected candidate corresponds to each control point motion vector predictor. In terms of optimizing encoding efficiency, the video encoding device determines the actual control point motion vector for each control point of the target block, and then calculates the MVD between the actual control point motion vector and the control point motion vector predictor. The video encoding device encodes the affine model form of the target block, the candidate index, and the MVD of each control point, and signals them to the video decoding device.

[0135] The video decoding device decodes the affine model form, candidate indices, and MVDs of each control point. The inter prediction unit (544) of the video decoding device generates an affine AMVP list in the same manner as the video encoding device, and selects a candidate indicated by the candidate index within the affine AMVP list. The video decoding device adds the MVD corresponding to each control point motion vector predictor of the selected candidate to restore each control point motion vector. The video decoding device performs affine motion prediction using the restored control point motion vectors.

[0136] 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.

[0137] II. Local Illumination Compensation (LIC)

[0138] Figure 9 is an example diagram showing local lighting compensation.

[0139] To improve the prediction efficiency of the current block, local illumination compensation performs illumination compensation according to changes in the image acquisition environment. To effectively perform local illumination compensation, an image decoding device derives parameters representing a linear relationship between the surrounding reference pixels (A_refp) of the current block A and the surrounding reference pixels (B_refp) of the reference block B. For example, the parameters of the linear relationship can be derived based on the linear least square method. The image decoding device performs local illumination compensation of the current block A based on the reference block B using the parameters of the derived linear relationship, as shown in Equation 3.

[0140]

[0141] In Equation 3, α and β are parameters of the linear relationship, representing the slope and offset, respectively. p[x] represents a pixel within the reference block, and Pred[x] represents a predicted pixel within the current block to which local illumination compensation is applied.

[0142] As described above, local lighting compensation is applied to the current block, and a linear relationship is derived based on the surrounding reference pixels (B_refp) adjacent to the reference block B and the surrounding reference pixels (A_refp) adjacent to the current block A. At this time, if there is no available pixel among the surrounding reference pixels of the reference block B (i.e., if B_refp does not exist), local lighting compensation may not be performed for the current block. If B_refp does not exist on both the left and top of the reference block B, but exists on a part of the top or left, local lighting compensation may be performed using some of the existing pixels, as in the example of Fig. 10.

[0143] As an example, an image decoding device can derive a linear relationship using only some of the pixels corresponding to A_refp and B_refp. For example, if the sizes of blocks A and B are 16×16, A_refp can generally be composed of 32 pixels, and B_refp can also be composed of 32 pixels. In the example of FIG. 9 or FIG. 10, the image decoding device extracts or downsamples pixels at specific locations to generate candidate pixels corresponding to A_refp and B_refp, and derives parameters of the linear relationship using some of the candidate pixels. Thereafter, the image decoding device can perform local illumination compensation using the derived linear relationship, thereby generating a prediction block of the current block.

[0144] As another example, A_refp and B_refp may be limited to integer position pixels. For example, if a reference block predicted according to a motion vector does not exist at an integer position, the image decoding device performs inter prediction of the current block by applying filtering to the integer position pixel values ​​of the reference image to calculate the pixel values ​​at decimal positions. At this time, B_refp, which are the surrounding reference pixels of the reference block, may also be pixel values ​​at positions calculated according to the filtering. However, according to an embodiment, the image decoding device may set nearby integer pixels as B_refp without performing filtering, and use the set B_refp as surrounding reference pixels for linear modeling.

[0145] As another example, A_refp and B_refp may be composed of multiple pixel lines other than a single pixel line. For example, if the sizes of blocks A and B are 16×16, A_refp and B_refp may be in the form of 16×N+M×16. That is, A_refp and B_refp may be composed of 16×N+16×M pixels, including the forms of ‘block width×multiple pixel lines’ and ‘multiple pixel lines×block height’. Here, N represents multiple pixel lines at the top of the block, and M represents multiple pixel lines at the left side of the block. As another example, the embodiment using the multiple pixel lines described above and the embodiment using only some of the pixels among the candidate pixels may be combined. That is, the image decoding device sets pixels of the multiple pixel lines as candidates, and derives parameters of the linear relationship using some of the candidate pixels.

[0146] The parameters α and β of the linear relationship used in local illumination compensation are calculated identically in both the image encoding and decoding devices. Therefore, the image encoding device may not separately transmit the parameters of the linear relationship to the image decoding device. As another example, the linear relationship can be defined by fixing α to a non-zero value and calculating only β.

[0147] III. Applying local illumination compensation to affine model-based predictions

[0148] FIG. 11 is an exemplary diagram showing local lighting compensation in affine model-based prediction according to one embodiment of the present disclosure.

[0149] As described above, in affine model-based prediction, the image decoding device generates control point motion vectors from the positions corresponding to the vertices of the current block, using the motion vectors of the current block. The image decoding device models the geometric transformation relationship between the current block and the predicted block using the generated control point motion vectors, and then performs prediction based on the modeled affine model. At this time, each pixel value of the current block can be predicted using the control point motion vectors and the positions of each pixel.

[0150] In some embodiments, in order to reduce computational complexity, the image decoding device may perform prediction in units of arbitrary blocks (i.e., sub-blocks) using each control point motion vector as a center vector. The image decoding device divides the current block into units of arbitrary blocks and then performs prediction for each arbitrary block. At this time, each arbitrary block has a separate motion vector. Therefore, when applying local illumination compensation, the image decoding device derives parameters of a linear relationship using the surrounding reference pixels of each arbitrary block in correspondence with the surrounding reference pixels (B_refp) of the reference block B. As in the example of Fig. 11, the surrounding reference pixels of arbitrary blocks existing on the top and left are used to derive the parameters of the linear relationship.

[0151] Meanwhile, B_refp may be a reference pixel at a position considering the control point motion vector of the current block. That is, as in the example of Fig. 12, B_refp does not exist at an adjacent position in the image coordinate system of arbitrary blocks, but rather exists at an adjacent position calculated based on the control point motion vector.

[0152] The video decoding device can calculate B_refp for arbitrary blocks of B by extrapolating center vectors for arbitrary blocks of B. For example, in the example of FIG. 12, b_refp among B_refp can be calculated as follows. For example, the video decoding device can infer the center vector of an arbitrary block containing b_refp by extrapolating the center vectors of blocks b1 and b2, and derive b_refp from the arbitrary block having the inferred center vector. Reference pixels can be derived for other parts of B_refp as illustrated in FIG. 12 in a similar manner. After deriving the entire B_refp as described above, the video decoding device can perform the remaining process for local illumination compensation.

[0153] Meanwhile, the image decoding device may reflect the application of local illumination compensation during in-loop filtering. For example, when determining the filtering strength at the boundary between two adjacent blocks, the image decoding device may use parameters α and β of the linear relationship. For example, if (i) local illumination compensation is applied to two blocks containing in-loop target pixels 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 are the same, the image decoding device may apply filtering to the boundary between the two blocks by determining the parameter BS, which determines the filtering strength, as 1. Alternatively, if the α values ​​of the two blocks containing the filtering target pixels are different, the image decoding device may apply filtering to the boundary between the two blocks by determining BS as 1.

[0154] Hereinafter, a method of applying local lighting compensation in affine model-based prediction using the cities of FIGS. 13 to 15 is described.

[0155] FIG. 13 is an exemplary diagram showing a method for an image encoding device to encode a current block according to one embodiment of the present disclosure.

[0156] The video encoding device determines the shape of the affine model of the current block and derives control point motion vectors (S1300). In terms of rate distortion optimization, the video encoding device can determine the shape of the affine model.

[0157] The video encoding device generates motion vectors of sub-blocks using the shape of the affine model and control point motion vectors (S1302). Here, the sub-blocks represent arbitrary blocks into which the current block is divided.

[0158] The video encoding device generates a reference block of the current block by deriving sub-reference blocks of sub-blocks using motion vectors (S1304).

[0159] 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, availability may include, in addition to the presence of decoded surrounding reference pixels (A_refp and B_refp), whether the surrounding reference pixels can be used for applying local illumination compensation to the current block.

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

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

[0162] The video encoding device calculates the positions of surrounding reference pixels of each sub-reference block for the upper sub-reference blocks and the left sub-reference blocks of the reference block (S1308).

[0163] The video encoding device sets the center vectors of the sub-reference blocks using motion vectors corresponding to the sub-reference blocks of the reference block. The video encoding device extrapolates the center vectors to infer the center vectors of the surrounding blocks of each sub-reference block. The video encoding device derives the positions of the pixels to the right or bottom of the surrounding blocks having the inferred center vectors as the positions of the surrounding reference pixels of each sub-reference block.

[0164] The video encoding device checks the availability of surrounding reference pixels of each sub-reference block at the calculated locations, thereby checking the availability of surrounding reference pixels of the reference block (S1310).

[0165] For example, if some of the surrounding reference pixels (B_refp) of the reference block are available (Yes in S1310), as in the example of FIG. 14, the video encoding device may use the available B_refp1 and B_refp2 among the left B_refp and the upper B_refp. Alternatively, the video encoding device may use the left B_refp without using the entire upper B_refp.

[0166] If all or part of the surrounding reference pixels (B_refp) of the reference block are available (Yes in S1310), the video encoding device performs the following steps.

[0167] The image encoding device derives parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the reference block (S1312).

[0168] As an example, an image encoding 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 reference 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 reference block. At this time, the surrounding reference pixels of the reference block corresponding to the positions of the surrounding reference pixels of the current block are used for deriving the parameters. As another example, after filtering is applied to the surrounding reference pixels (A_refp) of the current block and the surrounding reference pixels (B_refp) of the reference block, the filtered pixels may be used for deriving the parameters.

[0169] The image encoding device generates a first prediction block of the current block by applying local lighting compensation to a reference block using parameters of a linear relationship (S1314).

[0170] The video encoding device derives the reference block as the second prediction block of the current block (S1316).

[0171] On the other hand, if the surrounding reference pixels A_refp of the current block are not available (No in S1306) or the surrounding reference pixels B_refp of the reference block are not available (No in S1310), the video encoding device derives the reference block as the second prediction block of the current block. For example, the video decoding device generates the second prediction block of the current block without performing operations related to local illumination compensation. Alternatively, the video decoding device omits the process of deriving parameters of the linear relationship. That is, the video decoding device generates the second prediction block of the current block by assigning α to 1 and β to 0 and omitting local illumination compensation.

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

[0173] 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 prediction block is optimal, the video encoding device sets the flag to true. Conversely, if the second prediction block is optimal, the video encoding device sets the flag to false.

[0174] The video encoding device encodes a flag (S1320).

[0175] 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.

[0176] 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 prediction block or the second 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.

[0177] FIG. 15 is an exemplary diagram showing a method for an image decoding device to restore a current block according to one embodiment of the present disclosure.

[0178] The image decoding device obtains the form of an affine model of the current block and derives control point motion vectors (S1500).

[0179] The video decoding device generates motion vectors of sub-blocks using the shape of the affine model and control point motion vectors (S1502). Here, the sub-blocks represent arbitrary blocks into which the current block is divided.

[0180] The video decoding device generates a reference block of the current block by deriving sub-reference blocks of sub-blocks using motion vectors (S1504).

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

[0182] 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.

[0183] The video decoding device checks the flag (S1508).

[0184] If the flag indicating whether to apply local lighting compensation is true (Yes in S1508), 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 and B_refp), whether the surrounding reference pixels can be used for applying local lighting compensation to the current block.

[0185] The video decoding device checks the availability of surrounding reference pixels of the current block at the top and left of the current block (S1510).

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

[0187] The video decoding device calculates the locations of surrounding reference pixels of each sub-reference block for the upper sub-reference blocks and the left sub-reference blocks of the reference block (S1512).

[0188] The video decoding device sets the center vectors of the sub-reference blocks using the motion vectors corresponding to the sub-reference blocks of the reference block. The video decoding device extrapolates the center vectors to infer the center vectors of the surrounding blocks of each sub-reference block. The video decoding device derives the positions of the pixels to the right or bottom of the surrounding blocks having the inferred center vector as the positions of the surrounding reference pixels of each sub-reference block.

[0189] The video decoding device checks the availability of surrounding reference pixels of each sub-reference block at the calculated locations, thereby checking the availability of surrounding reference pixels of the reference block (S1514).

[0190] For example, if some of the surrounding reference pixels (B_refp) of the reference block are available (Yes in S1514), as in the example of FIG. 14, the video decoding device may use the available B_refp1 and B_refp2 among the left B_refp and the upper B_refp. Alternatively, the video decoding device may use the left B_refp without using the entire upper B_refp.

[0191] If all or part of the surrounding reference pixels (B_refp) of the reference block are available (Yes in S1514), the image decoding device performs the following steps.

[0192] The image decoding device derives parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the reference block (S1516).

[0193] 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 reference block, and then calculates parameters (α, β) of the linear relationship using the selected 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 reference block. At this time, the surrounding reference pixels of the reference block corresponding to the positions of the surrounding reference pixels of the current block are used for deriving the parameters. As another example, after filtering is applied to the surrounding reference pixels (A_refp) of the current block and the surrounding reference pixels (B_refp) of the reference block, the filtered pixels may be used for deriving the parameters.

[0194] The image decoding device generates a prediction block of the current block by applying local lighting compensation to the reference block using parameters of a linear relationship (S1518).

[0195] On the other hand, if the flag indicating whether to apply local lighting compensation is false (No in S1508), if the surrounding reference pixels A_refp of the current block are not available (No in S1510), or if the surrounding reference pixels B_refp of the reference block are not available (No in S1514), the image decoding device derives the reference block as the prediction block of the current block (S1520).

[0196] As another example, even if some of the surrounding reference pixels (B_refp) of the reference block are available, the image decoding device derives the reference block as a prediction block of the current block.

[0197] For example, the image decoding device generates a prediction block of the current block without performing operations related to local illumination compensation. Alternatively, the image decoding device omits the process of deriving parameters of the linear relationship. In other words, the image decoding device generates a prediction block of the current block by assigning α to 1 and β to 0, thereby omitting local illumination compensation.

[0198] 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 prediction block and the residual block to generate a restored block of the current block.

[0199] 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.

[0200] 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.

[0201] 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).

[0202] 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.

[0203] (Explanation of symbols)

[0204] 124: Inter Prediction Department

[0205] 155: Entropy encoding unit

[0206] 510: Entropy decryption unit

[0207] 544: Inter Prediction Department

[0208]

[0209] CROSS-REFERENCE TO RELATED APPLICATION

[0210] This patent application claims priority to Korean patent application No. 10-2023-0063322, filed in Korea on May 16, 2023, and Korean patent application No. 10-2024-0037141, filed in Korea on March 18, 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 obtaining the form of an affine model of the current block and deriving control point motion vectors; A step of generating motion vectors of sub-blocks using the shape of the above affine model and control point motion vectors, wherein the sub-blocks are blocks into which the current block is divided; A step of generating a reference block of the current block by deriving sub-reference blocks of the sub-blocks using the above motion vectors; 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, A step of calculating the positions of surrounding reference pixels of each sub-reference block for the upper sub-reference blocks and the left sub-reference blocks of the above reference block; and A step of checking the availability of surrounding reference pixels of each sub-reference block at the calculated locations, thereby checking the availability of surrounding reference pixels of the reference block. Including more, If all or part of the surrounding reference pixels of the above reference block are available, A step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the reference block; and A step of generating a prediction block of the current block by applying local lighting compensation to the reference block using the parameters of the linear relationship above. A method, characterized in that it further comprises:

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 above reference block as a prediction block 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 the reference block are not available, A step of deriving the above reference block as a prediction block of the current block. A method, characterized in that it further comprises:

5. In paragraph 1, The step of calculating the locations of the surrounding reference pixels of each of the above sub-reference blocks is: A method characterized in that the positions of the surrounding reference pixels are limited to integer positions while omitting filtering based on the motion vectors.

6. In paragraph 1, The surrounding reference pixels of the current block and the surrounding reference pixels of the reference block are, A method characterized by including a plurality of pixel lines.

7. In paragraph 1, The step of calculating the locations of the surrounding reference pixels of each of the above sub-reference blocks is: A step of setting the center vectors of the sub-reference blocks as motion vectors corresponding to the sub-reference blocks of the above reference block; A step of inferring the center vector of the surrounding blocks of each sub-reference block by extrapolating the center vectors; and A step of deriving the positions of the right or lower pixels of the surrounding blocks having the above-deduced center vector as the positions of the surrounding reference pixels of each sub-reference block. A method, characterized by including:

8. 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 surrounding reference pixels of the current block and surrounding reference pixels of the reference block.

9. In paragraph 1, The step of deriving the parameters of the above linear relationship is: A method characterized in that all or part of the surrounding reference pixels of the current block and all or part of the surrounding reference pixels of the reference block are used, wherein the surrounding reference pixels of the reference block corresponding to the positions of the surrounding reference pixels of the current block are used.

10. In paragraph 1, Further comprising a step of applying in-loop filtering to the boundary between the 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 is determined at the boundary by using parameters of linear relationships between the predicted block and adjacent blocks.

11. A method for encoding a current block performed by a video encoding device, A step of determining the form of the affine model of the current block and deriving control point motion vectors; A step of generating motion vectors of sub-blocks using the above affine model and control point motion vectors, wherein the sub-blocks are blocks into which the current block is divided; A step of generating a reference block of the current block by deriving sub-reference blocks of the sub-blocks using the above motion vectors; 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, A step of calculating the positions of surrounding reference pixels of each sub-reference block for the upper sub-reference blocks and the left sub-reference blocks of the above reference block; and A step of checking the availability of surrounding reference pixels of each sub-reference block at the calculated locations, thereby checking the availability of surrounding reference pixels of the reference block. Including more, If all or part of the surrounding reference pixels of the above reference block are available, A step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the reference block; and A step of generating a first prediction block of the current block by applying local lighting compensation to the reference block using the parameters of the linear relationship above. A method, characterized in that it further comprises:

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

13. In paragraph 11, 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 prediction block is omitted.

14. A computer-readable recording medium storing a bitstream generated by an image encoding method, wherein the image encoding method comprises: A step of determining the form of the affine model of the current block and deriving control point motion vectors; A step of generating motion vectors of sub-blocks using the above affine model and control point motion vectors, wherein the sub-blocks are blocks into which the current block is divided; A step of generating a reference block of the current block by deriving sub-reference blocks of the sub-blocks using the above motion vectors; 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, A step of calculating the positions of surrounding reference pixels of each sub-reference block for the upper sub-reference blocks and the left sub-reference blocks of the above reference block; and A step of checking the availability of surrounding reference pixels of each sub-reference block at the calculated locations, thereby checking the availability of surrounding reference pixels of the reference block. Including more, If all or part of the surrounding reference pixels of the above reference block are available, A step of deriving parameters of a linear relationship between surrounding reference pixels of the current block and surrounding reference pixels of the reference block; and A step of generating a prediction block of the current block by applying local lighting compensation to the reference block using the parameters of the linear relationship above. A recording medium, characterized by including:

Citation Information

Patent Citations

  • Test module for storage device

    KR1020230042849A

  • Motion compensation for video encoding and decoding

    US20210243465A1

  • Inter Prediction Method and Related Apparatus

    US20220007046A1

  • Methods and apparatus for prediction refinement with optical flow

    US20220116655A1