Image encoding / decoding method and device, and recording medium storing bitstream

Abstract

Provided are an image encoding / decoding method and device, a recording medium storing a bitstream, and a transmission method. The image decoding method may comprise the steps of: determining a prediction mode of a current block as an intra block copy merge mode; determining a block vector merge candidate list of the current block; deriving a block vector of the current block on the basis of the block vector merge candidate list; correcting the block vector by using differential block vector information; and generating a prediction block of the current block on the basis of the corrected block vector.

Description

Video encoding / decoding method, device, and recording medium storing bitstream

[0001] The present invention relates to a video encoding / decoding method, a device, and a recording medium storing a bitstream. Specifically, the present invention relates to a video encoding / decoding method, a device, and a recording medium storing a bitstream based on improved intra-block copy merge mode prediction.

[0002] Recently, the demand for high-resolution, high-quality images, such as UHD (Ultra High Definition) images, is increasing across various application fields. As image data becomes higher in resolution and quality, the relative amount of data increases compared to conventional image data. Therefore, transmitting image data using existing media such as wired or wireless broadband lines or storing it using existing storage media leads to increased transmission and storage costs. To address these issues arising from the increasing resolution and quality of image data, high-efficiency image encoding / decoding technologies for higher-resolution and higher-quality images are required.

[0003] Intra-block copy prediction offers high prediction accuracy for screen content with repetitive similar shapes. In particular, applying intra-block copy prediction can improve encoding efficiency in cases where only intra prediction is applicable due to the lack of reference pictures. Therefore, various tools for intra-block copy prediction are being discussed to improve encoding efficiency in cases where only intra prediction is applicable.

[0004] The purpose of the present invention is to provide a video encoding / decoding method and device with improved encoding / decoding efficiency.

[0005] In addition, the present invention aims to provide a recording medium storing a bitstream generated by an image decoding method or device according to the present invention.

[0006] In addition, the present invention aims to provide a method for correcting a block vector derived in an intra block copy merge mode to solve the above problems.

[0007] An image decoding method according to one embodiment of the present invention may include a step of determining a prediction mode of a current block as an intra block copy merge mode, a step of determining a block vector merge candidate list of the current block, a step of deriving a block vector of the current block based on the block vector merge candidate list, a step of correcting the block vector using differential block vector information, and a step of generating a prediction block of the current block based on the corrected block vector.

[0008] In the above image decoding method, the block vector merge candidate list can be determined using block vector information of blocks surrounding the current block.

[0009] In the above image decoding method, the block vector merge candidates in the determined block vector merge candidate list can be rearranged.

[0010] In the above image decoding method, the block vector merge candidates can be reordered based on the similarity between the template of the reference block indicated by the block vector merge candidates and the template of the current block.

[0011] In the above image decoding method, a block vector merge candidate corresponding to a template of a reference block having a high similarity to the template of the current block can be rearranged to have a high priority in the block vector merge candidate list.

[0012] In the above image decoding method, the similarity can be determined by either the SAD (sum of absolute differences) method or the SSE (sum of square error) method.

[0013] In the above image decoding method, the derived block vector can be derived from one of a predetermined number of block vector merge candidates corresponding to a high priority in the block vector merge candidate list.

[0014] In the above image decoding method, the differential block vector information may include direction information and distance information.

[0015] In the above image decoding method, the direction information may include vertical direction information and vertical direction information.

[0016] In the above image decoding method, the distance information may include vertical distance information and horizontal distance information.

[0017] In the above image decoding method, the method further includes a step of determining whether to correct the derived block vector, and a step of obtaining the differential block vector information when it is determined that the derived block vector is corrected, wherein the derived block vector can be corrected based on the differential block vector information according to the determination that the derived block vector is corrected.

[0018] A video encoding method according to one embodiment of the present invention may include a step of determining a prediction mode of a current block as an intra block copy merge mode, a step of determining a block vector merge candidate list of the current block, a step of deriving a block vector of the current block based on the block vector merge candidate list, a step of correcting the block vector using differential block vector information, and a step of generating a prediction block of the current block based on the corrected block vector.

[0019] A non-transitory computer-readable recording medium according to one embodiment of the present invention can store a bitstream generated by the image encoding method.

[0020] A bitstream transmission method according to one embodiment of the present invention can transmit a bitstream generated by the image encoding method.

[0021] The features briefly summarized above regarding the present disclosure are merely exemplary aspects of the detailed description of the present disclosure that follows and do not limit the scope of the present disclosure.

[0022] According to the present invention, a video encoding / decoding method and device with improved encoding / decoding efficiency can be provided.

[0023] Additionally, according to the present invention, a method for correcting a block vector derived in an intra block copy merge mode can be provided.

[0024] In addition, according to the present invention, prediction accuracy can be improved by generating a prediction block based on a corrected block vector.

[0025] The effects that can be obtained from the present disclosure are not limited to the effects mentioned above, and other effects that are not mentioned will be clearly understood by a person having ordinary skill in the art to which the present disclosure pertains from the description below.

[0026] Figure 1 is a block diagram showing the configuration according to one embodiment of an encoding device to which the present invention is applied.

[0027] Figure 2 is a block diagram showing the configuration according to one embodiment of a decryption device to which the present invention is applied.

[0028] FIG. 3 is a diagram schematically showing a video coding system to which the present invention can be applied.

[0029] FIG. 4 is a drawing for explaining an intra block copy method according to one embodiment of the present invention.

[0030] FIG. 5 is a diagram for explaining a method for rearranging block vector merge candidates in a block vector merge candidate list according to an embodiment of the present invention.

[0031] FIG. 6 is a diagram for explaining four-way information included in differential block vector information according to one embodiment of the present invention.

[0032] FIG. 7 is a diagram for explaining eight-directional information included in differential block vector information according to one embodiment of the present invention.

[0033] FIG. 8 is a diagram for explaining 16 direction information included in differential block vector information according to one embodiment of the present invention.

[0034] FIG. 9 is a flowchart illustrating a block vector correction method according to an embodiment of the present invention.

[0035] FIG. 10 is a drawing exemplifying a content streaming system to which an embodiment according to the present invention can be applied.

[0036] An image decoding method according to one embodiment of the present invention may include a step of determining a prediction mode of a current block as an intra block copy merge mode, a step of determining a block vector merge candidate list of the current block, a step of deriving a block vector of the current block based on the block vector merge candidate list, a step of correcting the block vector using differential block vector information, and a step of generating a prediction block of the current block based on the corrected block vector.

[0037] The present invention is susceptible to various modifications and embodiments. Therefore, specific embodiments are illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to specific embodiments, but rather to encompass all modifications, equivalents, and substitutes falling within the spirit and scope of the present invention. In the drawings, similar reference numerals designate the same or similar functions throughout. The shape and size of elements in the drawings may be provided by way of example only for clarity. The detailed description of the exemplary embodiments described below refers to the accompanying drawings, which illustrate specific embodiments. These embodiments are described in sufficient detail to enable those skilled in the art to practice the embodiments. It should be understood that the various embodiments, while different, are not necessarily mutually exclusive. For example, specific shapes, structures, and characteristics described herein may be implemented in other embodiments without departing from the spirit and scope of the present invention. Furthermore, it should be understood that the location or arrangement of individual components within each disclosed embodiment may be modified without departing from the spirit and scope of the embodiment. Accordingly, the detailed description set forth below is not intended to be taken in a limiting sense, and the scope of the exemplary embodiments, if properly described, is defined only by the appended claims, along with the full scope equivalents to which such claims are entitled.

[0038] In the present invention, terms such as first, second, etc. may be used to describe various components, but the components should not be limited by these terms. These terms are used solely to distinguish one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component. The term "and / or" includes a combination of multiple related described items or any of multiple related described items.

[0039] The components shown in the embodiments of the present invention are independently depicted to represent different characteristic functions, and do not mean that each component is composed of separate hardware or a single software component. That is, each component is listed and included as a separate component for convenience of explanation, and at least two components among each component may be combined to form a single component, or a single component may be divided into multiple components to perform a function, and such integrated and separate embodiments of each component are also included in the scope of the present invention as long as they do not deviate from the essence of the present invention.

[0040] The terminology used herein is merely used to describe specific embodiments and is not intended to limit the present invention. The singular expression includes the plural expression unless the context clearly indicates otherwise. In addition, some components of the present invention are not essential components that perform essential functions in the present invention and may be optional components merely for performance enhancement. The present invention may be implemented by including only components essential to realizing the essence of the present invention, excluding components used only for performance enhancement, and a structure including only essential components, excluding optional components used only for performance enhancement, is also within the scope of the present invention.

[0041] In embodiments, the term "at least one" may mean one of a number greater than or equal to 1, such as 1, 2, 3, and 4. In embodiments, the term "a plurality of" may mean one of a number greater than or equal to 2, such as 2, 3, and 4.

[0042] Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In describing the embodiments of this specification, if it is determined that a detailed description of a related known configuration or function may obscure the gist of this specification, the detailed description will be omitted. The same reference numerals will be used for identical components in the drawings, and duplicate descriptions of identical components will be omitted.

[0043] Glossary of Terms

[0044] Hereinafter, “video” may mean a single picture constituting a video, or may refer to the video itself. For example, “encoding and / or decoding of a video” may mean “encoding and / or decoding of a video,” or may mean “encoding and / or decoding of one of the videos constituting the video.”

[0045] Hereinafter, the terms "video" and "movie" may be used interchangeably and have the same meaning. Furthermore, the target image may be an encoding target image, which is the target of encoding, and / or a decoding target image, which is the target of decoding. Furthermore, the target image may be an input image input to an encoding device, or an input image input to a decoding device. Here, the target image may have the same meaning as the current image.

[0046] Hereinafter, the terms encoder and image encoding device may be used interchangeably and have the same meaning.

[0047] Hereinafter, the terms decoder and image decoding device may be used interchangeably and have the same meaning.

[0048] Hereinafter, “image”, “picture”, “frame” and “screen” may be used with the same meaning and may be used interchangeably.

[0049] Hereinafter, the term "target block" may refer to an encoding target block, which is the target of encoding, and / or a decoding target block, which is the target of decoding. Furthermore, the target block may refer to a current block, which is the target of current encoding and / or decoding. For example, the terms "target block" and "current block" may be used interchangeably and have the same meaning.

[0050] Hereinafter, "block" and "unit" may be used with the same meaning and may be used interchangeably. In addition, "unit" may mean including a luminance component block and a corresponding chroma component block to distinguish it from a block. For example, a coding tree unit (CTU) may be composed of one luma component (Y) coding tree block (CTB) and two chroma component (Cb, Cr) coding tree blocks associated with it.

[0051] Hereinafter, “sample,” “pixel,” and “pixel” may be used interchangeably and have the same meaning. Here, a sample may represent a basic unit that constitutes a block.

[0052] Hereinafter, “inter” and “between screens” may be used interchangeably and have the same meaning.

[0053] Hereinafter, “intra” and “within screen” may be used interchangeably and have the same meaning.

[0054]

[0055] Figure 1 is a block diagram showing the configuration according to one embodiment of an encoding device to which the present invention is applied.

[0056] The encoding device (100) may be an encoder, a video encoding device, or an image encoding device. A video may include one or more images. The encoding device (100) may sequentially encode one or more images.

[0057] Referring to FIG. 1, the encoding device (100) may include an image segmentation unit (110), an intra prediction unit (120), a motion prediction unit (121), a motion compensation unit (122), a switch (115), a subtractor (113), a transformation unit (130), a quantization unit (140), an entropy encoding unit (150), an inverse quantization unit (160), an inverse transformation unit (170), an adder (117), a filter unit (180), and a reference picture buffer (190).

[0058] Additionally, the encoding device (100) can generate a bitstream including encoded information through encoding an input image and output the generated bitstream. The generated bitstream can be stored in a computer-readable recording medium or can be streamed via a wired / wireless transmission medium.

[0059] The video segmentation unit (110) can segment the input video into various forms to increase the efficiency of video encoding / decoding. That is, the input video is composed of multiple pictures, and one picture can be hierarchically segmented and processed for compression efficiency, parallel processing, etc. For example, one picture can be segmented into one or more tiles or slices, which can then be segmented into multiple Coding Tree Units (CTUs). Alternatively, one picture can first be segmented into multiple sub-pictures defined as groups of rectangular slices, and each sub-picture can then be segmented into the tiles / slices. Here, the sub-pictures can be utilized to support the function of partially independently encoding / decoding and transmitting the picture. Since multiple sub-pictures can each be individually restored, there is an advantage of easy editing in applications that configure multi-channel input into a single picture. In addition, tiles can be segmented horizontally to generate bricks. Here, a brick can be utilized as the basic unit of intra-picture parallel processing. In addition, one CTU can be recursively split into a quadtree (QT), and the terminal node of the split can be defined as a coding unit (CU). The CU can be split into a prediction unit (PU) and a transformation unit (TU), and prediction and splitting can be performed. Meanwhile, the CU can be utilized as a prediction unit and / or a transformation unit itself. Here, for flexible splitting, each CTU can be recursively split into a multi-type tree (MTT) as well as a quadtree (QT). Splitting of a CTU into a multi-type tree can start from the terminal node of a QT, and the MTT can be composed of a binary tree (BT) and a triple tree (TT).For example, the MTT structure can be divided into vertical binary split mode (SPLIT_BT_VER), horizontal binary split mode (SPLIT_BT_HOR), vertical ternary split mode (SPLIT_TT_VER), and horizontal ternary split mode (SPLIT_TT_HOR). In addition, the minimum block size (MinQTSize) of the quad tree of the luminance block during splitting can be set to 16x16, the maximum block size (MaxBtSize) of the binary tree can be set to 128x128, and the maximum block size (MaxTtSize) of the triple tree can be set to 64x64. In addition, the minimum block size (MinBtSize) of the binary tree and the minimum block size (MinTtSize) of the triple tree can be set to 4x4, and the maximum depth (MaxMttDepth) of the multi-type tree can be set to 4. Additionally, to improve the encoding efficiency of the I slice, a dual tree can be applied that uses different CTU partition structures for luminance and chrominance components. On the other hand, in the P and B slices, the luminance and chrominance CTBs (Coding Tree Blocks) within the CTU can be partitioned into a single tree that shares the coding tree structure.

[0060] The encoding device (100) may perform encoding on the input image in intra mode and / or inter mode. Alternatively, the encoding device (100) may perform encoding on the input image in a third mode (e.g., IBC mode, Palette mode, etc.) other than the intra mode and inter mode. However, if the third mode has functional characteristics similar to the intra mode or inter mode, it may be classified as intra mode or inter mode for convenience of explanation. In the present invention, the third mode will be classified and described separately only when a specific description is required.

[0061] When the intra mode is used as the prediction mode, the switch (115) can be switched to intra, and when the inter mode is used as the prediction mode, the switch (115) can be switched to inter. Here, the intra mode can mean an intra-screen prediction mode, and the inter mode can mean an inter-screen prediction mode. The encoding device (100) can generate a prediction block for an input block of an input image. In addition, after the prediction block is generated, the encoding device (100) can encode a residual block using a residual of the input block and the prediction block. The input image can be referred to as a current image that is currently a target of encoding. The input block can be referred to as a current block that is currently a target of encoding or an encoding target block.

[0062] When the prediction mode is intra mode, the intra prediction unit (120) can use samples of blocks already encoded / decoded around the current block as reference samples. The intra prediction unit (120) can perform spatial prediction on the current block using the reference samples, and can generate prediction samples for the input block through spatial prediction. Here, intra prediction can mean prediction within the screen.

[0063] As an intra prediction method, non-directional prediction modes such as DC mode and Planar mode, as well as directional prediction modes (e.g., 65 directions) can be applied. Here, the intra prediction method can be expressed as an intra prediction mode or an intra-screen prediction mode.

[0064] When the prediction mode is inter mode, the motion prediction unit (121) can search for an area that best matches the input block from the reference image during the motion prediction process and derive a motion vector using the searched area. At this time, the area can be used as a search area. The reference image can be stored in the reference picture buffer (190). Here, when encoding / decoding for the reference image is processed, it can be stored in the reference picture buffer (190).

[0065] The motion compensation unit (122) can generate a prediction block for the current block by performing motion compensation using a motion vector. Here, inter prediction may mean inter-screen prediction or motion compensation.

[0066] The above motion prediction unit (121) and motion compensation unit (122) can generate a prediction block by applying an interpolation filter to a portion of an area within a reference image when the value of the motion vector does not have an integer value. In order to perform inter-screen prediction or motion compensation, it is possible to determine whether the motion prediction and motion compensation method of the prediction unit included in the corresponding encoding unit is one of Skip Mode, Merge Mode, Advanced Motion Vector Prediction (AMVP) mode, and Intra Block Copy (IBC) mode based on the encoding unit, and perform inter-screen prediction or motion compensation according to each mode.

[0067] In addition, based on the above inter-screen prediction method, the AFFINE mode of sub-PU based prediction, the SbTMVP (Subblock-based Temporal Motion Vector Prediction) mode, and the MMVD (Merge with MVD) mode and the GPM (Geometric Partitioning Mode) mode of PU based prediction can be applied. In addition, in order to improve the performance of each mode, the HMVP (History based MVP), the PAMVP (Pairwise Average MVP), the CIIP (Combined Intra / Inter Prediction), the AMVR (Adaptive Motion Vector Resolution), the BDOF (Bi-Directional Optical-Flow), the BCW (Bi-predictive with CU Weights), the LIC (Local Illumination Compensation), the TM (Template Matching), and the OBMC (Overlapped Block Motion Compensation) can be applied.

[0068] Among these, AFFINE mode is a technology that is used in both AMVP and MERGE modes and also has high encoding efficiency. In the existing video coding standard, since MC (Motion Compensation) is performed by considering only the parallel translation of the block, there was a disadvantage in that it could not properly compensate for motions that occur in reality, such as zoom in / out and rotation. To supplement this, a 4-parameter affine motion model using two control point motion vectors (CPMV) and a 6-parameter affine motion model using three control point motion vectors can be applied to inter prediction. Here, CPMV is a vector representing the affine motion model of one of the upper left, upper right, and lower left of the current block.

[0069] The subtractor (113) can generate a residual block using the difference between the input block and the predicted block. The residual block may also be referred to as a residual signal. The residual signal may refer to the difference between the original signal and the predicted signal. Alternatively, the residual signal may be a signal generated by transforming, quantizing, or transforming and quantizing the difference between the original signal and the predicted signal. The residual block may be a residual signal in block units.

[0070] The transform unit (130) can perform a transform on the residual block to generate a transform coefficient and output the generated transform coefficient. Here, the transform coefficient may be a coefficient value generated by performing a transform on the residual block. When the transform skip mode is applied, the transform unit (130) may also skip the transform on the residual block.

[0071] Quantized levels can be generated by applying quantization to transform coefficients or residual signals. In the following embodiments, quantized levels may also be referred to as transform coefficients.

[0072] For example, a 4x4 luminance residual block generated through within-screen prediction can be transformed using a basis vector based on DST (Discrete Sine Transform), and the remaining residual blocks can be transformed using a basis vector based on DCT (Discrete Cosine Transform). In addition, through RQT (Residual Quad Tree) technology, the transform block is divided into a quad tree shape for one block, and after performing transformation and quantization on each transform block divided through RQT, a coded block flag (cbf) can be transmitted to increase encoding efficiency when all coefficients become 0.

[0073] Another alternative is to apply Multiple Transform Selection (MTS) technology, which selectively performs transformation using multiple transformation bases. That is, instead of dividing CUs into TUs via RQT, a Sub-block Transform (SBT) technology can perform a function similar to TU division. Specifically, SBT is applied only to inter-screen prediction blocks, and unlike RQT, it can divide the current block into ½ or ¼ blocks vertically or horizontally, and then perform transformation on only one of the blocks. For example, in a vertically divided block, the transformation can be performed on the leftmost or rightmost block, and in a horizontally divided block, the transformation can be performed on the topmost or bottommost block.

[0074] Additionally, LFNST (Low Frequency Non-Separable Transform), a secondary transform technique that further transforms the residual signal converted to the frequency domain through DCT or DST, can be applied. LFNST additionally performs a transform on the low-frequency region of 4x4 or 8x8 in the upper left, which allows the residual coefficients to be concentrated in the upper left.

[0075] The quantization unit (140) can generate a quantized level by quantizing a transform coefficient or residual signal according to a quantization parameter (QP), and can output the generated quantized level. At this time, the quantization unit (140) can quantize the transform coefficient using a quantization matrix.

[0076] For example, a quantizer with QP values ​​of 0 to 51 can be used. Alternatively, if the image size is larger and high encoding efficiency is required, a QP of 0 to 63 can be used. In addition, a Dependent Quantization (DQ) method that uses two quantizers instead of a single quantizer can be applied. DQ performs quantization using two quantizers (e.g., Q0 and Q1), but even without signaling information about the use of a specific quantizer, the quantizer to be used for the next transform coefficient can be selected based on the current state through a state transition model.

[0077] The entropy encoding unit (150) can generate a bitstream by performing entropy encoding according to a probability distribution on values ​​produced by the quantization unit (140) or coding parameter values ​​produced during the encoding process, and can output the bitstream. The entropy encoding unit (150) can perform entropy encoding on information about image samples and information for decoding the image. For example, the information for decoding the image can include syntax elements, etc.

[0078] When entropy encoding is applied, a small number of bits are allocated to symbols with a high occurrence probability, and a large number of bits are allocated to symbols with a low occurrence probability, thereby representing the symbols, whereby the size of the bit string for the symbols to be encoded can be reduced. The entropy encoding unit (150) can use an encoding method such as exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), or Context-Adaptive Binary Arithmetic Coding (CABAC) for entropy encoding. For example, the entropy encoding unit (150) can perform entropy encoding using a Variable Length Coding / Code (VLC) table. In addition, the entropy encoding unit (150) may perform arithmetic encoding using the binarization method, probability model, and context model derived from the binarization method of the target symbol and the probability model of the target symbol / bin.

[0079] In this regard, when applying CABAC, the table probability update method can be changed to a simple formula-based table update method to reduce the size of the probability table stored in the decryption device. Furthermore, two different probability models can be used to obtain more accurate symbol probability values.

[0080] The entropy encoding unit (150) can change a two-dimensional block form coefficient into a one-dimensional vector form through a transform coefficient scanning method to encode a transform coefficient level (quantized level).

[0081] Coding parameters may include not only information (flags, indexes, etc.) encoded in an encoding device (100) and signaled to a decoding device (200), such as syntax elements, but also information derived during an encoding process or a decoding process, and may mean information necessary when encoding or decoding an image.

[0082] Here, signaling a flag or index may mean that the encoder entropy encodes the flag or index and includes it in the bitstream, and that the decoder entropy decodes the flag or index from the bitstream.

[0083] The encoded current image can be used as a reference image for other images to be processed later. Accordingly, the encoding device (100) can reconstruct or decode the encoded current image again and store the reconstructed or decoded image as a reference image in the reference picture buffer (190).

[0084] The quantized level can be dequantized in the dequantization unit (160) and inversely transformed in the inverse transformation unit (170). The dequantized and / or inversely transformed coefficients can be combined with a prediction block through an adder (117), and a reconstructed block can be generated by combining the dequantized and / or inversely transformed coefficients and the prediction block. Here, the dequantized and / or inversely transformed coefficients refer to coefficients on which at least one of dequantization and inverse transformation has been performed, and may refer to a reconstructed residual block. The dequantization unit (160) and the inverse transformation unit (170) can be performed in the reverse process of the quantization unit (140) and the transformation unit (130).

[0085] The restoration block may pass through a filter unit (180). The filter unit (180) may apply a deblocking filter, a sample adaptive offset (SAO), an adaptive loop filter (ALF), a bilateral filter (BIF), a Luma Mapping with Chroma Scaling (LMCS), etc. as a filtering technique, in whole or in part, to the restoration sample, restoration block, or restoration image. The filter unit (180) may also be referred to as an in-loop filter. In this case, the in-loop filter is also used as a name excluding LMCS.

[0086] A deblocking filter can remove block distortion that occurs at the boundaries between blocks. Whether to apply a deblocking filter to the current block can be determined based on the samples contained in several columns or rows within the block. When applying a deblocking filter to a block, different filters can be applied depending on the required deblocking filtering strength.

[0087] Sample adaptive offset can be used to compensate for encoding errors by adding an appropriate offset value to sample values. Sample adaptive offset can compensate for the offset from the original image on a sample-by-sample basis for deblocked images. This can be done by dividing the samples contained in the image into a fixed number of regions, determining the regions to be offset, and applying the offset to those regions. Alternatively, the offset can be applied by considering the edge information of each sample.

[0088] Bilateral filter (BIF) can also compensate for the offset from the original image on a sample-by-sample basis for the deblocked image.

[0089] An adaptive loop filter can perform filtering based on a comparison between a reconstructed image and the original image. By dividing the samples contained in the image into predetermined groups and determining the filter to be applied to each group, filtering can be performed differentially for each group. Information regarding whether to apply an adaptive loop filter can be signaled for each coding unit (CU), and the shape and filter coefficients of the adaptive loop filter applied to each block can vary.

[0090] In LMCS (Luma Mapping with Chroma Scaling), luma mapping (LM) refers to remapping luminance values ​​through a piece-wise linear model, and chroma scaling (CS) refers to a technique that scales the residual values ​​of chrominance components according to the average luminance value of the prediction signal. In particular, LMCS can be utilized as an HDR correction technique that reflects the characteristics of HDR (High Dynamic Range) images.

[0091] The restored block or restored image that has passed through the filter unit (180) may be stored in the reference picture buffer (190). The restored block that has passed through the filter unit (180) may be a part of the reference image. In other words, the reference image may be a restored image composed of restored blocks that have passed through the filter unit (180). The stored reference image may be used for inter-screen prediction or motion compensation thereafter.

[0092] Figure 2 is a block diagram showing the configuration according to one embodiment of a decryption device to which the present invention is applied.

[0093] The decoding device (200) may be a decoder, a video decoding device, or an image decoding device.

[0094] Referring to FIG. 2, the decoding device (200) may include an entropy decoding unit (210), an inverse quantization unit (220), an inverse transformation unit (230), an intra prediction unit (240), a motion compensation unit (250), an adder (201), a switch (203), a filter unit (260), and a reference picture buffer (270).

[0095] The decoding device (200) can receive a bitstream output from the encoding device (100). The decoding device (200) can receive a bitstream stored in a computer-readable recording medium, or a bitstream streamed through a wired / wireless transmission medium. The decoding device (200) can perform decoding on the bitstream in intra mode or inter mode. In addition, the decoding device (200) can generate a restored image or a decoded image through decoding, and can output the restored image or the decoded image.

[0096] If the prediction mode used for decryption is intra mode, the switch (203) can be switched to intra. If the prediction mode used for decryption is inter mode, the switch (203) can be switched to inter.

[0097] The decoding device (200) can decode the input bitstream to obtain a reconstructed residual block and generate a prediction block. Once the reconstructed residual block and the prediction block are obtained, the decoding device (200) can generate a reconstructed block to be decoded by adding the reconstructed residual block and the prediction block. The block to be decoded may be referred to as a current block.

[0098] The entropy decoding unit (210) can generate symbols by performing entropy decoding according to a probability distribution for the bitstream. The generated symbols may include symbols in the form of quantized levels. Here, the entropy decoding method may be the reverse process of the entropy encoding method described above.

[0099] The entropy decoding unit (210) can change a one-dimensional vector-shaped coefficient into a two-dimensional block-shaped coefficient through a transform coefficient scanning method to decode a transform coefficient level (quantized level).

[0100] The quantized level can be inversely quantized in the inverse quantization unit (220) and inversely transformed in the inverse transformation unit (230). The quantized level can be generated as a restored residual block as a result of performing inverse quantization and / or inverse transformation. At this time, the inverse quantization unit (220) can apply a quantization matrix to the quantized level. The inverse quantization unit (220) and inverse transformation unit (230) applied to the decoding device can apply the same technology as the inverse quantization unit (160) and inverse transformation unit (170) applied to the encoding device described above.

[0101] When intra mode is used, the intra prediction unit (240) can generate a predicted block by performing spatial prediction on the current block using sample values ​​of already decoded blocks surrounding the block to be decoded. The intra prediction unit (240) applied to the decoding device can apply the same technology as the intra prediction unit (120) applied to the encoding device described above.

[0102] When the inter mode is used, the motion compensation unit (250) can generate a prediction block by performing motion compensation using a motion vector and a reference image stored in the reference picture buffer (270) on the current block. The motion compensation unit (250) can generate a prediction block by applying an interpolation filter to a portion of the reference image when the value of the motion vector does not have an integer value. In order to perform motion compensation, it is possible to determine whether the motion compensation method of the prediction unit included in the corresponding encoding unit is skip mode, merge mode, AMVP mode, or current picture reference mode based on the encoding unit, and motion compensation can be performed according to each mode. The motion compensation unit (250) applied to the decoding device can apply the same technology as the motion compensation unit (122) applied to the encoding device described above.

[0103] The adder (201) can add the restored residual block and the predicted block to generate a restored block. The filter unit (260) can apply at least one of an Inverse-LMCS, a deblocking filter, a sample adaptive offset, and an adaptive loop filter to the restored block or restored image. The filter unit (260) applied to the decoding device can apply the same filtering technology as that applied to the filter unit (180) applied to the encoding device described above.

[0104] The filter unit (260) can output a restored image. The restored block or restored image can be stored in the reference picture buffer (270) and used for inter prediction. The restored block that has passed through the filter unit (260) can be a part of the reference image. In other words, the reference image can be a restored image composed of restored blocks that have passed through the filter unit (260). The stored reference image can be used for inter-screen prediction or motion compensation thereafter.

[0105] FIG. 3 is a diagram schematically showing a video coding system to which the present invention can be applied.

[0106] A video coding system according to one embodiment may include an encoding device (10) and a decoding device (20). The encoding device (10) may transmit encoded video and / or image information or data to the decoding device (20) in the form of a file or streaming through a digital storage medium or a network.

[0107] An encoding device (10) according to one embodiment may include a video source generation unit (11), an encoding unit (12), and a transmission unit (13). A decoding device (20) according to one embodiment may include a reception unit (21), a decoding unit (22), and a rendering unit (23). The encoding unit (12) may be referred to as a video / image encoding unit, and the decoding unit (22) may be referred to as a video / image decoding unit. The transmission unit (13) may be included in the encoding unit (12). The reception unit (21) may be included in the decoding unit (22). The rendering unit (23) may include a display unit, and the display unit may be configured as a separate device or an external component.

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

[0109] The encoding unit (12) can encode the input video / image. The encoding unit (12) can perform a series of procedures such as prediction, transformation, and quantization for compression and encoding efficiency. The encoding unit (12) can output encoded data (encoded video / image information) in the form of a bitstream. The detailed configuration of the encoding unit (12) can also be configured in the same manner as the encoding device (100) of FIG. 1 described above.

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

[0111] The decoding unit (22) can decode video / image by performing a series of procedures such as inverse quantization, inverse transformation, and prediction corresponding to the operation of the encoding unit (12). The detailed configuration of the decoding unit (22) can also be configured in the same manner as the decoding device (200) of FIG. 2 described above.

[0112] The rendering unit (23) can render the decrypted video / image. The rendered video / image can be displayed through the display unit.

[0113]

[0114] In the present invention, a block vector derived in an intra block copy prediction merge mode can be corrected.

[0115] The intra-block copy prediction method refers to a method of searching for an optimal prediction block in a reconstructed area of ​​the current picture using a block vector and copying it to generate a prediction block for the current block. To improve the accuracy of intra-block copy prediction, the encoder and / or decoder may correct the block vector.

[0116] Before explaining a method for correcting a block vector of a current block, an intra block copy prediction method according to an embodiment of the present invention will be explained with reference to FIG. 4.

[0117]

[0118] FIG. 4 is a diagram for explaining an intra block copy prediction method according to one embodiment of the present invention.

[0119] Referring to FIG. 4, a matching block (440) can be derived within a predefined search range (R1, R2, R3, R4) of a reconstructed area (430) of a current picture (400) based on a block vector (420) of a current block (410). Then, a prediction block of the current block (410) can be generated based on the matching block (440).

[0120] The predefined search ranges R1, R2, R3, and R4 in Fig. 4 can be defined as the current CTU (Coding Tree Unit) including the current block, the upper left CTU, the upper CTU, and the left CTU, respectively.

[0121] Additionally, reference templates may be searched based on a predefined search order within a predefined search range. For example, reference templates may be searched in a zigzag order of R1, R4, R3, R2.

[0122] Meanwhile, information about the search range can be determined by the encoder and transmitted to the decoder. Furthermore, the search range can be set to a preset value in the encoder / decoder.

[0123] Meanwhile, although it was explained that a matching block is derived within a predefined search range in FIG. 4, a matching block can be derived based on a block vector in a restored area within the current picture.

[0124] Meanwhile, the block vector (420) in FIG. 4 is a block vector before correction, but a matching block can be derived based on a block vector that corrects the block vector of the current block, and a prediction block of the current block can be generated based on the derived matching block.

[0125] Meanwhile, in intra-block copy, the reference block may mean a matching block.

[0126]

[0127] Intra block copy merge mode may mean a mode in which the block vector of the current block is derived from the block vector information of the surrounding blocks of the current block.

[0128] When the intra block copy merge mode is applied, a block vector merge candidate list can be determined using block vector information of neighboring blocks of the current block predicted by the intra block copy merge mode or intra template matching prediction mode included in the restored area. At this time, the block vector merge candidate list can be a list in which block vector information of reference blocks of the current block is stored.

[0129] Meanwhile, in intra block copy merge mode, a reference block can mean a matching block.

[0130]

[0131] The block vector merge candidates in the block vector merge candidate list can be reordered. Specifically, the block vector merge candidates in the block vector merge candidate list can be reordered from highest priority to lowest priority to determine a block vector merge candidate list, and the block vector of the current block can be derived based on the determined block vector merge candidate list. In this case, a high priority may mean matching a lower numbered index in the block vector merge candidate list.

[0132]

[0133] FIG. 5 is a diagram illustrating a method for reordering block vector merge candidates in a block vector merge candidate list according to one embodiment of the present invention. Specifically, FIG. 5 is a diagram illustrating an adaptive reordering of merge candidates with template matching (ARMC-TM).

[0134] The template matching-based adaptive reordering method means a method in which block vector merge candidates in a block vector merge candidate list are reordered based on the similarity between the template of the reference block indicated by each block vector merge candidate and the template of the current block.

[0135] For example, block vector merge candidates can be rearranged so that a block vector merge candidate corresponding to a template of a reference block that has a high similarity to the template of the current block has a high priority in the block vector merge candidate list.

[0136] Referring to FIG. 5, in the intra block copy merge mode, a matching block M1 (550) can be derived from a block vector V1 (530) in a predefined search range (R1, R2, R3, R4) of a reconstructed area (510) of a current picture (500), and a matching block M2 (560) can be derived from a block vector V2 (540). Meanwhile, the block vector merge candidate list can include information about block vectors V1 and V2.

[0137] In addition, the neighboring ┌ region (i.e., the left, top, and upper left regions) of the current block (520) can be defined as the template of the current block (current template, 570), the neighboring ┌ region of M1 can be defined as the template of the reference block M1 (template of M1, 580), and the neighboring ┌ region of the matching block M2 can be defined as the template of the reference block M2 (template of M2, 590).

[0138] At this time, the similarity between the template (570) of the current block and the template (580) of M1 and the similarity between the template (570) of the current block and the template (590) of M2 are determined, and the block vector merge candidate list can be rearranged based on the similarity.

[0139] For example, if the similarity between the template (570) of the current block and the template (580) of M1 is high, the block vector merge candidates may be rearranged so that the block vector merge candidate corresponding to the template (580) of M1 has a high priority in the block vector merge candidate list. Here, having a high priority may mean that the block vector merge candidate has a low index number in the block vector merge candidate list.

[0140] Meanwhile, the above similarity can be determined by either the SAD method or the SSE method.

[0141] The predefined search ranges R1, R2, R3, and R4 in Fig. 5 can be defined as the current CTU (Coding Tree Unit) including the current block, the upper left CTU, the upper CTU, and the left CTU, respectively.

[0142] Additionally, the predefined search range may be searched for reference templates based on a predefined search order. For example, the reference templates may be searched in a zigzag order of R1, R4, R3, R2.

[0143] Meanwhile, information regarding the search range and the size and shape of the template can be determined by the encoder and transmitted to the decoder. Furthermore, the search range and the size and shape of the template can be set to preset values ​​in the encoder / decoder.

[0144] For example, the size of the current template can be determined as (w x L2) + (L1 xh) + (L1 x L2) as shown in Fig. 5. Here, w and h represent the width and height of the current block, and the values ​​of L1 and L2 can be determined as any positive integer.

[0145] Meanwhile, in Fig. 5, it is explained that a matching block is derived from a predefined search range, but a matching block can be derived based on a block vector from a restored area within the current picture.

[0146] Also, in Fig. 5, it is described that two block vector merge candidates are reordered, but this is only one example, and L block vector merge candidates for L block vectors can be reordered. Here, L is any positive integer.

[0147] In addition, in Fig. 5, it is explained that if a block vector merge candidate has a high priority in the block vector merge candidate list, it is matched to an index with a low number, but this is only one example, and it can be matched to a certain index according to the priority.

[0148] In addition, in Fig. 5, it is described that the block vector merge candidate corresponding to the template of the reference block having a high similarity to the template of the current block is reordered to have a high priority in the block vector merge candidate list, but this is only one example and can be reordered to have an arbitrary priority based on the similarity.

[0149]

[0150] Meanwhile, the block vector of the current block can be derived based on the block vector merge candidate list. Specifically, if one block vector merge candidate among the block vector merge candidates included in the block vector merge candidate list is determined, the block vector of the current block can be derived from the determined block vector merge candidate.

[0151] Additionally, an optimal block vector merge candidate can be determined from the block vector merge candidate list, and the block vector of the current block can be derived from the optimal block vector merge candidate. In this case, the optimal block vector merge candidate may mean a block vector merge candidate with the smallest cost value among the block vector merge candidates included in the block vector merge candidate list.

[0152] In addition, when the block vector merge candidates in the block vector merge candidate list are rearranged to determine the block vector merge candidate list, the block vector of the current block can be derived based on the determined block vector merge candidate list. Specifically, when one block vector merge candidate is determined from the rearranged block vector merge candidates, the block vector of the current block can be derived from the determined block vector merge candidate.

[0153] In addition, the block vector of the current block can be derived from one of the n block vector merge candidates corresponding to a high priority in the block vector merge candidate list. Specifically, one block vector merge candidate among the n block vector merge candidates having a high priority in the block vector candidate list can be determined, and the block vector of the current block can be derived from the determined block vector merge candidate. In this case, n is an arbitrary positive integer that is equal to or less than the total number of block vector merge candidates included in the block vector merge candidate list.

[0154] Meanwhile, priority can be determined by cost value. Specifically, a block vector merge candidate in the block vector merge candidate list may have a higher priority as its cost value decreases.

[0155] Meanwhile, a high priority could mean that it matches a lower numbered index in the block vector merge candidate list.

[0156] Meanwhile, the cost value can be calculated using a predefined cost function. Furthermore, the cost value calculation method can be either the SAD method or the SSE method.

[0157]

[0158] In the present invention, a block vector of a current block derived in an intra-block copy prediction merge mode can be corrected, and a predicted block of the current block can be generated based on the corrected block vector. Specifically, the derived block vector of the current block can be corrected using differential block vector information, a matching block can be derived based on the corrected block vector, and a predicted block of the current block can be generated based on the derived matching block.

[0159] For example, the block vector of the corrected current block can be calculated as in mathematical expression 1.

[0160]

[0161]

[0162] In mathematical expression 1, the initial block vector may mean the block vector of the current block derived in the intra block copy prediction merge mode, and the final block vector means the corrected block vector.

[0163] Meanwhile, the differential block vector can be derived using differential block vector information.

[0164]

[0165] According to one embodiment of the present invention, when it is determined whether to correct a derived block vector, the corresponding block vector can be corrected based on differential block vector information. Specifically, it is determined whether to correct the derived block vector, and when it is determined that the derived block vector has been corrected, differential block vector information is acquired, and when it is determined that the derived block vector has been corrected, the derived block vector can be corrected based on the differential block vector information.

[0166] For example, if it is decided not to correct the derived block vector, a prediction block of the current block can be generated based on the derived block vector without obtaining differential block vector information.

[0167]

[0168] The differential block vector information may include direction information and distance information. In this case, the direction information may refer to information regarding the direction of the differential block vector, and the distance information may refer to information regarding the size of the differential block vector.

[0169] Meanwhile, the direction information may include horizontal direction information and vertical direction information.

[0170]

[0171] Figures 6 to 8 are diagrams for explaining direction information included in differential block vector information according to one embodiment of the present invention. Referring to Figures 6 to 8, a circle shape indicates an initial position of a differential block vector, and a square shape indicates a direction of a differential block vector.

[0172] Fig. 6 is a diagram for explaining four-directional information included in differential block vector information according to one embodiment of the present invention. Specifically, Fig. 6 shows that the direction of the differential block vector corresponds to one of four directions (right horizontal direction, left horizontal direction, upward vertical direction, and downward vertical direction).

[0173]

[0174]

[0175] Referring to Table 1, direction information indicating the direction of the differential block vector among the four directions can be transmitted / parsed by matching it to an index. Here, the direction information can include horizontal direction information and vertical direction information.

[0176] For example, direction information including horizontal direction (+1) information and vertical direction (0) information can be matched to index 0. Also, direction information including horizontal direction (0) information and vertical direction (+1) information can be matched to index 2. At this time, when direction information is transmitted / parsed with index 0, the direction of the differential block vector can be the right horizontal direction (600), and when direction information is transmitted / parsed with index 2, the direction of the differential block vector can be the upward vertical direction (610).

[0177] Meanwhile, Table 1 shows an example in which the direction information of a differential block vector can be transmitted / parsed by matching it to an arbitrary index. Here, the arbitrary index can be a preset index.

[0178]

[0179] Fig. 7 is a diagram for explaining eight direction information included in differential block vector information according to one embodiment of the present invention. Specifically, Fig. 7 shows that the direction of the differential block vector is one of eight directions (right horizontal direction, left horizontal direction, upper vertical direction, lower vertical direction, upper right diagonal direction, upper left diagonal direction, lower right diagonal direction, and lower left diagonal direction).

[0180] FIG. 8 is a diagram for explaining 16 direction information included in differential block vector information according to one embodiment of the present invention. Specifically, FIG. 8 shows that the direction of the differential block vector is one of 16 directions, which is an additional 8 directions added to the 8 directions described above.

[0181] The 8-directional information and 16-directional information described in FIGS. 7 and 8 can also be transmitted / parsed by matching the direction information of the differential block vector to an arbitrary index in the same manner as in Table 1 described above.

[0182] Meanwhile, although Figures 6 to 8 represent 4-direction information, 8-direction information, and 16-direction information, respectively, this is only an example, and the direction of the differential block vector can be any one of N directions. Here, N is any positive integer.

[0183]

[0184] Distance information included in the differential block vector information can be transmitted / parsed by matching it to any index in the range of 1 / 4 pixel to 32 pixels.

[0185]

[0186]

[0187] Referring to Table 2, distances from 1 / 4 pixel to 32 pixels can be matched to 8 indices, and distance information can be transmitted / parsed using the index matching the size of the differential block vector. For example, if the size of the differential block vector corresponds to a distance of 1 pixel, distance information can be transmitted / parsed using the corresponding index 2, and if the size of the differential block vector corresponds to a distance of 8 pixels, distance information can be transmitted / parsed using the corresponding index 5.

[0188] Meanwhile, Table 2 shows an example in which pixel distances ranging from 1 / 4 pixel to 32 pixels can be matched to K indices, and distance information of the differential block vector can be transmitted / parsed using an index matching the pixel distance corresponding to the size of the differential block vector. Here, K is an arbitrary positive integer.

[0189] According to one embodiment, the distance information may include vertical distance information and horizontal distance information. The vertical distance information represents the absolute value of the vertical component of the differential block vector. The horizontal distance information represents the absolute value of the horizontal component of the differential block vector.

[0190]

[0191] Meanwhile, the differential block vector can be derived using differential block vector information. Specifically, the direction of the differential block vector can be determined by transmitted / parsed direction information, and the size can be determined by transmitted / parsed distance information.

[0192] For example, if the direction of the differential block vector is the right horizontal direction and the size corresponds to a distance of 1 pixel, the differential block vector direction information including the index for the right horizontal direction as direction information and the index for the 1 pixel distance as distance information is transmitted / parsed, and the block vector of the current block can be corrected using the differential block vector having the corresponding size and direction.

[0193]

[0194] Fig. 9 is a flowchart illustrating a block vector correction method according to one embodiment of the present invention. The block vector correction method of Fig. 9 can be performed by an image decoding device.

[0195] The video decoding device can determine the prediction mode of the current block as an intra block copy merge mode (S900).

[0196] And, the video decoding device can determine a block vector merge candidate list of the current block (S910).

[0197] Meanwhile, the block vector merge candidate list can be determined using block vector information of blocks surrounding the current block.

[0198] Additionally, the block vector merge candidates in the above-determined block vector merge candidate list can be rearranged.

[0199] Additionally, the block vector merge candidates can be reordered based on the similarity between the template of the reference block indicated by the block vector merge candidates and the template of the current block.

[0200] Additionally, a block vector merge candidate corresponding to a template of a reference block having a high similarity to the template of the current block may be reordered to have a high priority in the block vector merge candidate list.

[0201] Additionally, the similarity can be determined by either the SAD method or the SSE method.

[0202] And, the image decoding device can derive the block vector of the current block based on the block vector merge candidate list (S920).

[0203] Meanwhile, the above-described induced block vector can be derived from one of a predetermined number of block vector merge candidates corresponding to a high priority in the above-described block vector merge candidate list.

[0204] And, the image decoding device can correct the block vector using differential block vector information (S930).

[0205] Meanwhile, the differential block vector information may include direction information and distance information.

[0206] Additionally, the direction information may include horizontal direction information and vertical direction information.

[0207] Additionally, the distance information may include vertical distance information and horizontal distance information.

[0208] And, the image decoding device can generate a prediction block of the current block based on the corrected block vector (S940).

[0209] Additionally, the image decoding device can determine whether to correct the derived block vector, and if it is determined that the derived block vector is corrected, it can obtain the differential block vector information. Furthermore, the derived block vector can be corrected based on the differential block vector information according to the determination that the derived block vector is corrected.

[0210] Meanwhile, the steps described in FIG. 9 can be performed in the same manner in an image encoding method. Furthermore, a bitstream can be generated by an image encoding method including the steps described in FIG. 9. The bitstream can be stored on a non-transitory computer-readable recording medium and can also be transmitted (or streamed).

[0211]

[0212] FIG. 10 is a drawing exemplifying a content streaming system to which an embodiment according to the present invention can be applied.

[0213] As illustrated in FIG. 10, a content streaming system to which an embodiment of the present invention is applied may largely include an encoding server, a streaming server, a web server, a media storage, a user device, and a multimedia input device.

[0214] The encoding server compresses content input from multimedia input devices such as smartphones, cameras, and CCTVs into digital data, generates a bitstream, and transmits it to the streaming server. Alternatively, if multimedia input devices such as smartphones, cameras, and CCTVs directly generate bitstreams, the encoding server may be omitted.

[0215] The above bitstream can be generated by an image encoding method and / or an image encoding device to which an embodiment of the present invention is applied, and the streaming server can temporarily store the bitstream during the process of transmitting or receiving the bitstream.

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

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

[0218] Examples of the user devices may include mobile phones, smart phones, laptop computers, digital broadcasting terminals, personal digital assistants (PDAs), portable multimedia players (PMPs), navigation devices, slate PCs, tablet PCs, ultrabooks, wearable devices (e.g., smartwatches, smart glasses, HMDs), digital TVs, desktop computers, digital signage, etc.

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

[0220]

[0221] The above embodiments can be performed in the same or corresponding manner in an encoding device and a decoding device. In addition, an image can be encoded / decoded using at least one or a combination of at least one of the above embodiments.

[0222] The order in which the above embodiments are applied may be different in the encoding device and the decoding device. Alternatively, the order in which the above embodiments are applied may be the same in the encoding device and the decoding device.

[0223] The above embodiments can be performed for each of the luminance and chrominance signals. Alternatively, the above embodiments can be performed identically for the luminance and chrominance signals.

[0224] In the above embodiments, the methods are described based on a flowchart as a series of steps or units. However, the present invention is not limited to the order of the steps, and some steps may occur in a different order or simultaneously with other steps described above. Furthermore, those skilled in the art will understand that the steps depicted in the flowchart are not exclusive, and that other steps may be included, or one or more steps in the flowchart may be deleted without affecting the scope of the present invention.

[0225] The above embodiments may be implemented in the form of program commands that can be executed by various computer components and recorded on a computer-readable recording medium. The computer-readable recording medium may include program commands, data files, data structures, etc., either singly or in combination. The program commands recorded on the computer-readable recording medium may be those specifically designed and constructed for the present invention, or may be known and usable by those skilled in the art of computer software.

[0226] The bitstream generated by the encoding method according to the above embodiment can be stored in a non-transitory computer-readable recording medium. In addition, the bitstream stored in the non-transitory computer-readable recording medium can be decoded by the decoding method according to the above embodiment.

[0227] Here, examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical recording media such as CD-ROMs and DVDs, magneto-optical media such as floptical disks, and hardware devices specifically configured to store and execute program instructions such as ROMs, RAMs, and flash memories. Examples of program instructions include not only machine language codes such as those generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter, etc. The hardware devices may be configured to operate as one or more software modules to perform processing according to the present invention, and vice versa.

[0228] Although the present invention has been described above with specific details such as specific components and limited examples and drawings, these are provided only to help a more general understanding of the present invention, and the present invention is not limited to the above examples, and those with ordinary knowledge in the technical field to which the present invention pertains can make various modifications and variations from this description.

[0229] Therefore, the idea of ​​the present invention should not be limited to the embodiments described above, and all things that are modified equally or equivalently to the following claims as well as the claims are considered to fall within the scope of the idea of ​​the present invention.

[0230]

[0231] The present invention can be used in a device for encoding / decoding an image and a recording medium storing a bitstream.

Claims

1. In the video decryption method A step of determining the prediction mode of the current block as intra block copy merge mode; A step of determining a block vector merge candidate list of the current block; A step of deriving a block vector of the current block based on the block vector merge candidate list; A step of correcting the block vector using differential block vector information; and An image decoding method, characterized by comprising a step of generating a prediction block of the current block based on the corrected block vector.

2. In paragraph 1, An image decoding method, characterized in that the block vector merge candidate list is determined using block vector information of blocks surrounding the current block.

3. In paragraph 1, An image decoding method, characterized in that the block vector merge candidates in the above-determined block vector merge candidate list are rearranged.

4. In paragraph 3, An image decoding method, characterized in that the block vector merge candidates are reordered based on the similarity between the template of the reference block indicated by the block vector merge candidates and the template of the current block.

5. In paragraph 4, An image decoding method, characterized in that a block vector merge candidate corresponding to a template of a reference block having a high similarity to the template of the current block is rearranged to have a high priority in the block vector merge candidate list.

6. In paragraph 4, An image decoding method, characterized in that the above similarity is determined by one of the SAD (sum of absolute differences) method and the SSE (sum of square error) method.

7. In paragraph 1, An image decoding method, characterized in that the above-described induced block vector is derived from one of a predetermined number of block vector merge candidates corresponding to a high priority in the block vector merge candidate list.

8. In paragraph 1, An image decoding method, characterized in that the above differential block vector information includes direction information and distance information.

9. In paragraph 8, An image decoding method, characterized in that the above direction information includes vertical direction information and horizontal direction information.

10. In paragraph 8, An image decoding method, characterized in that the distance information includes vertical distance information and horizontal distance information.

11. In paragraph 1, a step of determining whether to correct the above-described induced block vector; and If it is determined that the above-described induced block vector is corrected, the method further includes a step of obtaining the differential block vector information, An image decoding method, characterized in that the derived block vector is corrected based on the differential block vector information according to a determination that the derived block vector is corrected.

12. In the video encoding method, A step of determining the prediction mode of the current block as intra block copy merge mode; A step of determining a block vector merge candidate list of the current block; A step of deriving a block vector of the current block based on the block vector merge candidate list; A step of correcting the block vector using differential block vector information; and An image encoding method, characterized by comprising a step of generating a prediction block of the current block based on the corrected block vector.

13. A non-transitory computer-readable recording medium storing a bitstream generated by a video encoding method, The above image encoding method is, A step of determining the prediction mode of the current block as intra block copy merge mode; A step of determining a block vector merge candidate list of the current block; A step of deriving a block vector of the current block based on the block vector merge candidate list; A step of correcting the block vector using differential block vector information; and A non-transitory computer-readable recording medium, characterized in that it comprises a step of generating a prediction block of the current block based on the corrected block vector.

14. In a method of transmitting a bitstream generated by a video encoding method, The above transmission method comprises a step of transmitting the bitstream, The above encoding method is, A step of determining the prediction mode of the current block as intra block copy merge mode; A step of determining a block vector merge candidate list of the current block; A step of deriving a block vector of the current block based on the block vector merge candidate list; A step of correcting the block vector using differential block vector information; and A transmission method, characterized by comprising a step of generating a prediction block of the current block based on the corrected block vector.

Images