WO2018226015A1 - 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 - Google Patents

영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 Download PDF

Info

Publication number
WO2018226015A1
WO2018226015A1 PCT/KR2018/006401 KR2018006401W WO2018226015A1 WO 2018226015 A1 WO2018226015 A1 WO 2018226015A1 KR 2018006401 W KR2018006401 W KR 2018006401W WO 2018226015 A1 WO2018226015 A1 WO 2018226015A1
Authority
WO
WIPO (PCT)
Prior art keywords
motion
block
information
motion vector
prediction
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/KR2018/006401
Other languages
English (en)
French (fr)
Korean (ko)
Inventor
임성창
강정원
고현석
전동산
이진호
이하현
김휘용
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Electronics and Telecommunications Research Institute ETRI
Original Assignee
Electronics and Telecommunications Research Institute ETRI
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Electronics and Telecommunications Research Institute ETRI filed Critical Electronics and Telecommunications Research Institute ETRI
Priority to US16/620,545 priority Critical patent/US11616976B2/en
Priority to EP24153593.9A priority patent/EP4351139A3/en
Priority to CN201880038074.0A priority patent/CN110771169A/zh
Priority to EP18814404.2A priority patent/EP3637772A4/en
Priority to JP2019568020A priority patent/JP2020522960A/ja
Publication of WO2018226015A1 publication Critical patent/WO2018226015A1/ko
Anticipated expiration legal-status Critical
Priority to JP2022184252A priority patent/JP7731581B2/ja
Priority to US18/103,570 priority patent/US12075087B2/en
Priority to US18/734,611 priority patent/US20240323431A1/en
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/523—Motion estimation or motion compensation with sub-pixel accuracy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/124—Quantisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]

Definitions

  • the present invention relates to a video encoding / decoding method, apparatus, and a recording medium storing a bitstream. Specifically, the present invention relates to an image encoding / decoding method and apparatus for performing motion compensation by correcting motion information.
  • HD high definition
  • UHD ultra high definition
  • An inter-screen prediction technique for predicting pixel values included in the current picture from a picture before or after the current picture using an image compression technology
  • an intra-picture prediction technology for predicting pixel values included in the current picture using pixel information in the current picture
  • transformation and quantization techniques for compressing the energy of the residual signal
  • entropy coding technique for assigning short codes to high-frequency values and long codes for low-frequency values.
  • Image data can be effectively compressed and transmitted or stored.
  • motion compensation is performed based on motion information of spatially / temporally adjacent blocks in an encoding / decoding target block, thereby improving encoding efficiency.
  • the present invention can provide a method and apparatus for performing motion compensation by correcting motion information.
  • a method of decoding an image may include: deriving a motion correction candidate from at least one of motion information of a spatial neighboring block, motion information of a temporal neighboring block, predefined motion information, and motion information most present in a reference image. ; Performing motion information correction on the derived motion correction candidate; And generating a prediction block of the current block by using the motion correction candidate on which the motion information correction is performed.
  • the deriving of the motion correction candidate may include the motion information of the spatial neighboring block, the motion information of the temporal neighboring block, the predefined motion information, and the most existing motion in the reference image according to a predetermined order.
  • a motion correction candidate may be derived from at least one of the information.
  • the predetermined order may include motion information of a spatial neighboring block, motion information of a temporal neighboring block, and predefined motion information.
  • performing the motion information correction may perform motion information correction by applying a two-way template matching to a motion vector included in the derived motion correction candidate.
  • the bilateral template matching may include: generating a bilateral template using a motion vector included in the derived motion correction candidate as an initial motion vector; And correcting the initial motion vector by comparing the samples in both templates and the reconstructed samples in the reference image indicated by the initial motion vector.
  • the initial motion vector may be a bidirectional predictive motion vector that is not a zero vector among the derived motion correction candidates.
  • the initial motion vector when there is no bi-directional predictive motion vector among the derived motion correction candidates, the initial motion vector may be set to zero vector.
  • the temporal neighboring block may be included in a reference image selected based on a reference image index of the spatial neighboring block.
  • the two template matching may be performed in an integer pixel unit and a subpixel unit.
  • correcting the initial motion vector may include: searching for a motion vector indicating an area within the reference image representing the two templates and the minimum distortion; and converting the searched motion vector to the initial motion. And setting the correction value of the vector.
  • searching for the motion vector may be performed in a limited search area within the reference image.
  • the limited search region may be set to a predetermined range in integer pixel units.
  • searching for the motion vector may search for the motion vector in subpixel units within a predetermined range in the integer pixel unit.
  • correcting the initial motion vector may be performed recursively.
  • performing motion information correction on the derived motion correction candidate may be performed when the current block does not correspond to a unidirectional predictive merge candidate, a local illumination compensation mode, and an affine motion compensation mode. have.
  • the method further includes: decoding motion correction mode usage information and determining a motion correction mode based on the decoded motion correction mode usage information, and deriving the motion correction candidate comprises: It may be performed in the correction mode.
  • the decoding of the motion correction mode usage information may determine whether to decode the motion correction mode usage information based on a skip flag or a merge flag.
  • deriving the motion correction candidate may first derive motion information from the spatial neighboring blocks having a bidirectional predictive motion vector, and then derive a unidirectional predictive motion vector.
  • the branch may derive the motion information from the spatial neighboring block.
  • a method of encoding an image may include: deriving a motion correction candidate from at least one of motion information of a spatial neighboring block, motion information of a temporal neighboring block, predefined motion information, and motion information most present in a reference image. ; The method may include performing motion information correction on the derived motion correction candidate and generating a prediction block of the current block by using the motion correction candidate on which the motion information correction is performed.
  • a non-transitory storage medium including a bitstream includes a motion from at least one of motion information of a spatial neighboring block, motion information of a temporal neighboring block, predefined motion information, and motion information most present in a reference image.
  • Deriving a correction candidate; And performing a motion information correction on the derived motion correction candidate and generating a prediction block of a current block by using the motion correction candidate on which the motion information correction has been performed. can do.
  • an image encoding / decoding method and apparatus with improved compression efficiency can be provided.
  • the computational complexity of the encoder and the decoder of an image can be reduced.
  • FIG. 1 is a block diagram illustrating a configuration of an encoding apparatus according to an embodiment of the present invention.
  • FIG. 2 is a block diagram illustrating a configuration of a decoding apparatus according to an embodiment of the present invention.
  • FIG. 3 is a diagram schematically illustrating a division structure of an image when encoding and decoding an image.
  • FIG. 4 is a diagram for describing an embodiment of an inter prediction process.
  • FIG. 5 is a flowchart illustrating an image encoding method according to an embodiment of the present invention.
  • FIG. 6 is a flowchart illustrating an image decoding method according to an embodiment of the present invention.
  • FIG. 7 is a flowchart illustrating a video encoding method according to another embodiment of the present invention.
  • FIG. 8 is a flowchart illustrating an image decoding method according to another embodiment of the present invention.
  • FIG. 9 is a diagram for describing an example of deriving a spatial motion vector candidate of a current block.
  • FIG. 10 is a diagram for describing an example of deriving a temporal motion vector candidate of a current block.
  • FIG. 11 illustrates an example in which a spatial merge candidate is added to a merge candidate list.
  • FIG. 12 illustrates an example in which a temporal merge candidate is added to a merge candidate list.
  • FIG. 13 is a diagram for explaining bilateral template matching.
  • 14 and 15 are diagrams for illustrating an area for searching for a motion vector corrected in bilateral template matching.
  • 16 is a flowchart illustrating a video decoding method according to an embodiment of the present invention.
  • first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.
  • 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.
  • any component of the invention When any component of the invention is said to be “connected” or “connected” to another component, it may be directly connected to or connected to that other component, but other components may be present in between. It should be understood that it may. On the other hand, when a component is referred to as being “directly connected” or “directly connected” to another component, it should be understood that there is no other component in between.
  • each component shown in the embodiments of the present invention are shown independently to represent different characteristic functions, and do not mean that each component is made of separate hardware or one software component unit.
  • each component is included in each component for convenience of description, and at least two of the components may be combined into one component, or one component may be divided into a plurality of components to perform a function.
  • Integrated and separate embodiments of the components are also included within the scope of the present invention without departing from the spirit of the invention.
  • Some components of the present invention are not essential components for performing essential functions in the present invention but may be optional components for improving performance.
  • the present invention can be implemented including only the components essential for implementing the essentials of the present invention except for the components used for improving performance, and the structure including only the essential components except for the optional components used for improving performance. Also included in the scope of the present invention.
  • an image may mean one picture constituting a video and may represent a video itself.
  • "encoding and / or decoding of an image” may mean “encoding and / or decoding of a video” and may mean “encoding and / or decoding of one of the images constituting the video.” It may be.
  • video and “video” may be used interchangeably and may be used interchangeably.
  • the target image may be an encoding target image that is a target of encoding and / or a decoding target image that is a target of decoding.
  • the target image may be an input image input to the encoding apparatus or may be an input image input to the decoding apparatus.
  • the target image may have the same meaning as the current image.
  • image image
  • picture picture
  • the target block may be an encoding target block that is a target of encoding and / or a decoding target block that is a target of decoding.
  • the target block may be a current block that is a target of current encoding and / or decoding.
  • target block and current block may be used interchangeably and may be used interchangeably.
  • block and “unit” may be used interchangeably and may be used interchangeably. Or “block” may indicate a particular unit.
  • region and “segment” may be used interchangeably.
  • the specific signal may be a signal representing a specific block.
  • the original signal may be a signal representing a target block.
  • the prediction signal may be a signal representing a prediction block.
  • the residual signal may be a signal representing a residual block.
  • each of the specified information, data, flag, index and element, attribute, etc. may have a value.
  • the value "0" of information, data, flags, indexes, elements, attributes, etc. may represent a logical false or first predefined value. In other words, the value "0", false, logical false and the first predefined value can be used interchangeably.
  • the value "1" of information, data, flags, indexes, elements, attributes, etc. may represent a logical true or second predefined value. In other words, the value "1", true, logical true and the second predefined value can be used interchangeably.
  • i When a variable such as i or j is used to indicate a row, column or index, the value of i may be an integer greater than or equal to zero and may be an integer greater than or equal to one. In other words, in embodiments, rows, columns, indexes, etc. may be counted from zero, and counted from one.
  • Encoder refers to a device that performs encoding. That is, it may mean an encoding device.
  • Decoder Means an apparatus that performs decoding. That is, it may mean a decoding device.
  • An MxN array of samples An MxN array of samples.
  • M and N may refer to positive integer values, and the block may refer to a two-dimensional sample array.
  • a block may mean a unit.
  • the current block may mean an encoding target block to be encoded at the time of encoding, and a decoding target block to be decoded at the time of decoding.
  • the current block may be at least one of a coding block, a prediction block, a residual block, and a transform block.
  • Sample The basic unit of a block. It can be expressed as a value from 0 to 2 Bd -1 according to the bit depth (B d ).
  • B d bit depth
  • a sample may be used in the same meaning as a pixel or a pixel. That is, samples, pixels, and pixels may have the same meaning.
  • Unit may mean a unit of image encoding and decoding.
  • the unit may be a region obtained by dividing one image.
  • a unit may mean a divided unit when a single image is divided into subdivided units to be encoded or decoded. That is, one image may be divided into a plurality of units.
  • a predetermined process may be performed for each unit.
  • One unit may be further divided into subunits having a smaller size than the unit.
  • the unit may be a block, a macroblock, a coding tree unit, a coding tree block, a coding unit, a coding block, a prediction.
  • the unit may mean a unit, a prediction block, a residual unit, a residual block, a transform unit, a transform block, or the like.
  • the unit may refer to a luma component block, a chroma component block corresponding thereto, and a syntax element for each block in order to refer to the block separately.
  • the unit may have various sizes and shapes, and in particular, the shape of the unit may include a geometric figure that may be represented in two dimensions such as a rectangle, a trapezoid, a triangle, a pentagon, as well as a square.
  • the unit information may include at least one of a type of a unit indicating a coding unit, a prediction unit, a residual unit, a transform unit, and the like, a size of a unit, a depth of a unit, an encoding and decoding order of the unit, and the like.
  • Coding tree unit consists of two color difference component (Cb, Cr) coding tree blocks associated with one luminance component (Y) coding tree block. It may also mean including the blocks and syntax elements for each block.
  • Each coding tree unit uses one or more partitioning methods, such as a quad tree, a binary tree, and a ternary tree, to form subunits such as a coding unit, a prediction unit, and a transformation unit. Can be divided. It may be used as a term for referring to a sample block that becomes a processing unit in a decoding / encoding process of an image, such as splitting an input image.
  • the quad tree may mean a quarternary tree.
  • Coding Tree Block A term used to refer to any one of a Y coded tree block, a Cb coded tree block, and a Cr coded tree block.
  • Neighbor block It may mean a block adjacent to the current block.
  • the block adjacent to the current block may mean a block in which the boundary of the current block is in contact or a block located within a predetermined distance from the current block.
  • the neighboring block may mean a block adjacent to a vertex of the current block.
  • the block adjacent to the vertex of the current block may be a block vertically adjacent to a neighboring block horizontally adjacent to the current block or a block horizontally adjacent to a neighboring block vertically adjacent to the current block.
  • the neighboring block may mean a restored neighboring block.
  • Reconstructed Neighbor Block A neighboring block that is already encoded or decoded in a spatial / temporal manner around the current block.
  • the restored neighboring block may mean a restored neighboring unit.
  • the reconstructed spatial neighboring block may be a block in the current picture and a block already reconstructed through encoding and / or decoding.
  • the reconstructed temporal neighboring block may be a reconstructed block or its neighboring block at a position corresponding to the current block of the current picture in the reference picture.
  • the root node in the tree structure may correspond to the first unit that is not divided.
  • the highest node may be called the root node.
  • the highest node may have a minimum depth value.
  • the highest node may have a depth of level 0.
  • a node having a depth of level 1 may represent a unit created as the first unit is divided once.
  • a node with a depth of level 2 may represent a unit created as the first unit is split twice.
  • a node with a depth of level n may represent a unit generated as the first unit is divided n times.
  • the leaf node may be the lowest node or may be a node that cannot be further divided.
  • the depth of the leaf node may be at the maximum level. For example, the predefined value of the maximum level may be three.
  • the root node has the shallowest depth and the leaf node has the deepest depth.
  • the level at which the unit exists may mean the unit depth.
  • Bitstream may mean a string of bits including encoded image information.
  • Parameter Set Corresponds to header information among structures in the bitstream. At least one of a video parameter set, a sequence parameter set, a picture parameter set, and an adaptation parameter set may be included in the parameter set. In addition, the parameter set may include slice header and tile header information.
  • Parsing This may mean determining a value of a syntax element by entropy decoding the bitstream or may mean entropy decoding itself.
  • This may mean at least one of a syntax element, a coding parameter, a value of a transform coefficient, and the like, of a coding / decoding target unit.
  • the symbol may mean an object of entropy encoding or a result of entropy decoding.
  • Prediction mode Information indicating a mode encoded / decoded by intra prediction or a mode encoded / decoded by inter prediction.
  • a prediction unit may mean a basic unit for performing prediction, such as inter prediction, intra prediction, inter compensation, intra compensation, motion compensation, and the like.
  • One prediction unit may be divided into a plurality of partitions or a plurality of lower prediction units having a smaller size.
  • the plurality of partitions may also be a basic unit in performing prediction or compensation.
  • the partition generated by the partitioning of the prediction unit may also be the prediction unit.
  • Prediction Unit Partition This may mean a form in which a prediction unit is divided.
  • Reference Picture List may mean a list including one or more reference pictures used for inter prediction or motion compensation.
  • the types of reference picture lists may be LC (List Combined), L0 (List 0), L1 (List 1), L2 (List 2), L3 (List 3), and the like. Lists can be used.
  • Inter Prediction Indicator This may mean an inter prediction direction (unidirectional prediction, bidirectional / bidirectional prediction / bidirectional prediction, etc.) of the current block. Alternatively, this may mean the number of reference pictures used when generating the prediction block of the current block. Alternatively, this may mean the number of prediction blocks used when performing inter prediction or motion compensation on the current block.
  • Prediction list utilization flag Indicates whether a prediction block is generated using at least one reference picture in a specific reference picture list.
  • the prediction list utilization flag may be derived using the prediction list utilization flag, and conversely, the prediction list utilization flag may be derived using the inter prediction prediction indicator. For example, when the prediction list utilization flag indicates 0 as the first value, it may indicate that the prediction block is not generated by using the reference image in the reference picture list, and when the 1 indicates the second value, the reference It may represent that the prediction block can be generated using the image list.
  • Reference Picture Index This may mean an index indicating a specific reference picture in the reference picture list.
  • Reference Picture refers to an image referenced by a specific block for inter prediction or motion compensation.
  • the reference image may be an image including a reference block referenced by the current block for inter prediction or motion compensation.
  • reference picture and reference picture may be used in the same sense and may be used interchangeably.
  • Motion Vector This may be a 2D vector used for inter prediction or motion compensation.
  • the motion vector may mean an offset between an encoding / decoding target block and a reference block.
  • (mvX, mvY) may represent a motion vector.
  • mvX may represent a horizontal component and mvY may represent a vertical component.
  • the search range may be a two-dimensional area in which a search for a motion vector is performed during inter prediction.
  • the size of the search region may be M ⁇ N.
  • M and N may each be a positive integer.
  • Motion Vector Candidate When a motion vector is predicted, it may mean a block that is a prediction candidate or a motion vector of the block. In addition, the motion vector candidate may be included in the motion vector candidate list.
  • a motion vector candidate list may mean a list constructed using one or more motion vector candidates.
  • a motion vector candidate index may refer to an indicator indicating a motion vector candidate in a motion vector candidate list. It may be an index of a motion vector predictor.
  • Motion Information at least at least one of a motion vector, a reference picture index, an inter prediction prediction indicator, as well as a prediction list utilization flag, a reference picture list information, a reference picture, a motion vector candidate, a motion vector candidate index, a merge candidate, a merge index, and the like. It may mean information including one.
  • a merge candidate list may mean a list constructed using one or more merge candidates.
  • the merge candidate may mean a spatial merge candidate, a temporal merge candidate, a combined merge candidate, a combined both prediction merge candidate, a zero merge candidate, and the like.
  • the merge candidate may include motion information such as an inter prediction prediction indicator, a reference image index for each list, a motion vector, a prediction list utilization flag, and an inter prediction prediction indicator.
  • the index may indicate an indicator indicating a merge candidate in the merge candidate list.
  • the merge index may indicate a block in which a merge candidate is derived among blocks reconstructed adjacent to the current block in a spatial / temporal manner.
  • the merge index may indicate at least one of motion information included in the merge candidate.
  • a transform unit may mean a basic unit for performing residual signal encoding / decoding such as transform, inverse transform, quantization, inverse quantization, and transform coefficient encoding / decoding.
  • One transform unit may be divided into a plurality of lower transform units having a smaller size.
  • the transform / inverse transform may include at least one of a primary transform / inverse transform and a secondary transform / inverse transform.
  • Scaling This may mean a process of multiplying a factor by a quantized level.
  • the transform coefficients can be generated as a result of scaling on the quantized level. Scaling can also be called dequantization.
  • Quantization Parameter A value used when generating a quantized level using a transform coefficient in quantization. Or, it may mean a value used when generating a transform coefficient by scaling a quantized level in inverse quantization.
  • the quantization parameter may be a value mapped to a quantization step size.
  • a quantization parameter may mean a difference value between the predicted quantization parameter and the quantization parameter of the encoding / decoding target unit.
  • Scan refers to a method of ordering coefficients in a unit, block, or matrix. For example, sorting a two-dimensional array into a one-dimensional array is called a scan. Alternatively, arranging the one-dimensional array in the form of a two-dimensional array may also be called a scan or an inverse scan.
  • a transform coefficient may mean a coefficient value generated after the transform is performed in the encoder. Or, it may mean a coefficient value generated after performing at least one of entropy decoding and dequantization in the decoder.
  • the quantized level or the quantized transform coefficient level obtained by applying the quantization to the transform coefficient or the residual signal may also be included in the meaning of the transform coefficient.
  • Quantized Level A value generated by performing quantization on a transform coefficient or a residual signal in an encoder. Or, it may mean a value that is the object of inverse quantization before performing inverse quantization in the decoder. Similarly, the quantized transform coefficient level resulting from the transform and quantization may also be included in the meaning of the quantized level.
  • Non-zero Transform Coefficient may mean a transform coefficient whose value is not zero or a transform coefficient level or quantized level whose size is not zero.
  • Quantization Matrix A matrix used in a quantization or inverse quantization process to improve the subjective or objective image quality of an image.
  • the quantization matrix may also be called a scaling list.
  • Quantization Matrix Coefficient It may mean each element in the quantization matrix. Quantization matrix coefficients may also be referred to as matrix coefficients.
  • a predetermined matrix may mean a predetermined quantization matrix defined in the encoder and the decoder.
  • Non-default Matrix A non-default matrix, which is not defined in the encoder and the decoder, may be a quantization matrix signaled by a user.
  • FIG. 1 is a block diagram illustrating a configuration of an encoding apparatus according to an embodiment of the present invention.
  • the encoding apparatus 100 may be an encoder, a video encoding apparatus, or an image encoding apparatus.
  • the video may include one or more images.
  • the encoding apparatus 100 may sequentially encode one or more images.
  • the encoding apparatus 100 may include a motion predictor 111, a motion compensator 112, an intra predictor 120, a switch 115, a subtractor 125, a transformer 130, and quantization.
  • the unit 140 may include an entropy encoder 150, an inverse quantizer 160, an inverse transform unit 170, an adder 175, a filter unit 180, and a reference picture buffer 190.
  • the encoding apparatus 100 may encode the input image in an intra mode and / or an inter mode.
  • the encoding apparatus 100 may generate a bitstream including the encoded information through encoding of the input image, and may 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.
  • the switch 115 may be switched to intra, and when the inter mode is used as the prediction mode, the switch 115 may be switched to inter.
  • the intra mode may mean an intra prediction mode
  • the inter mode may mean an inter prediction mode.
  • the encoding apparatus 100 may generate a prediction block for the input block of the input image.
  • the encoding apparatus 100 may encode the residual block by using a difference between the input block and the prediction block.
  • the input image may be referred to as a current image that is a target of current encoding.
  • the input block may be referred to as a current block or an encoding target block that is a target of the current encoding.
  • the intra prediction unit 120 may use a sample of a block that is already encoded / decoded around the current block as a reference sample.
  • the intra predictor 120 may perform spatial prediction on the current block by using the reference sample, and generate prediction samples on the input block through spatial prediction.
  • Intra prediction may refer to intra prediction.
  • the motion predictor 111 may search an area that best matches the input block from the reference image in the motion prediction process, and derive a motion vector using the searched area. .
  • a search area may be used as the area.
  • the reference picture may be stored in the reference picture buffer 190.
  • the reference picture buffer 190 may be stored in the reference picture buffer 190.
  • the motion compensator 112 may generate a prediction block for the current block by performing motion compensation using the motion vector.
  • inter prediction may mean inter prediction or motion compensation.
  • the motion predictor 111 and the motion compensator 112 may generate a prediction block by applying an interpolation filter to a part of a reference image when the motion vector does not have an integer value.
  • a motion prediction and a motion compensation method of a prediction unit included in a coding unit based on a coding unit may include a skip mode, a merge mode, and an improved motion vector prediction. It may determine whether the advanced motion vector prediction (AMVP) mode or the current picture reference mode is used, and may perform inter prediction or motion compensation according to each mode.
  • AMVP advanced motion vector prediction
  • the subtractor 125 may generate a residual block using the difference between the input block and the prediction block.
  • the residual block may be referred to as the residual signal.
  • the residual signal may mean a difference between the original signal and the prediction signal.
  • the residual signal may be a signal generated by transforming, quantizing, or transforming and quantizing a difference between the original signal and the prediction signal.
  • the residual block may be a residual signal in block units.
  • the transform unit 130 may generate transform coefficients by performing transform on the residual block and output the generated transform coefficients.
  • the transform coefficient may be a coefficient value generated by performing transform on the residual block.
  • the transform unit 130 may omit the transform on the residual block.
  • Quantized levels can be generated by applying quantization to transform coefficients or residual signals.
  • the quantized level may also be referred to as a transform coefficient.
  • the quantization unit 140 may generate a quantized level by quantizing the transform coefficient or the residual signal according to the quantization parameter, and may output the generated quantized level. In this case, the quantization unit 140 may quantize the transform coefficients using the quantization matrix.
  • the entropy encoder 150 may generate a bitstream by performing entropy encoding according to probability distribution on values calculated by the quantizer 140 or coding parameter values calculated in the encoding process. And output a bitstream.
  • the entropy encoder 150 may perform entropy encoding on information about a sample of an image and information for decoding an image.
  • the information for decoding the image may include a syntax element.
  • the entropy encoder 150 may use an encoding method such as exponential Golomb, context-adaptive variable length coding (CAVLC), or context-adaptive binary arithmetic coding (CABAC) for entropy encoding.
  • CAVLC context-adaptive variable length coding
  • CABAC context-adaptive binary arithmetic coding
  • the entropy encoder 150 may perform entropy coding using a variable length coding (VLC) table.
  • VLC variable length coding
  • the entropy coding unit 150 derives the binarization method of the target symbol and the probability model of the target symbol / bin, and then derives the derived binarization method, the probability model, and the context model. Arithmetic coding may also be performed using.
  • the entropy encoder 150 may 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).
  • the coding parameter may include information derived from an encoding process or a decoding process as well as information (flag, index, etc.) encoded by an encoder and signaled to a decoder, such as a syntax element, and may be encoded or decoded. May mean necessary information.
  • signaling a flag or index may mean that the encoder entropy encodes the flag or index and includes the flag or index in the bitstream, and the decoder may encode the flag or index from the bitstream. It may mean entropy decoding.
  • the encoded current image may be used as a reference image for another image to be processed later. Accordingly, the encoding apparatus 100 may reconstruct or decode the encoded current image and store the reconstructed or decoded image as a reference image in the reference picture buffer 190.
  • the quantized level may be dequantized in inverse quantization unit 160.
  • the inverse transform unit 170 may perform an inverse transform.
  • the inverse quantized and / or inverse transformed coefficients may be summed with the prediction block via the adder 175.
  • a reconstructed block may be generated by adding the inverse quantized and / or inverse transformed coefficients with the prediction block.
  • the inverse quantized and / or inverse transformed coefficient may mean a coefficient in which at least one or more of inverse quantization and inverse transformation have been performed, and may mean a reconstructed residual block.
  • the recovery block may pass through the filter unit 180.
  • the filter unit 180 may add at least one of a deblocking filter, a sample adaptive offset (SAO), an adaptive loop filter (ALF), and the like to a reconstructed sample, a reconstructed block, or a reconstructed image. Applicable
  • the filter unit 180 may be referred to as an in-loop filter.
  • the deblocking filter may remove block distortion generated at boundaries between blocks.
  • it may be determined whether to apply the deblocking filter to the current block based on samples included in several columns or rows included in the block.
  • different filters may be applied according to the required deblocking filtering strength.
  • a sample offset may be used to add an appropriate offset to the sample value to compensate for encoding errors.
  • the sample adaptive offset may correct the offset with respect to the original image in units of samples with respect to the deblocked image. After dividing the samples included in the image into a predetermined number of areas, an area to be offset may be determined and an offset may be applied to the corresponding area, or an offset may be applied in consideration of edge information of each sample.
  • the adaptive loop filter may perform filtering based on a comparison value between the reconstructed image and the original image. After dividing a sample included in an image into a predetermined group, a filter to be applied to the corresponding group may be determined and filtering may be performed for each group. Information related to whether to apply the adaptive loop filter may be signaled for each coding unit (CU), and the shape and filter coefficient of the adaptive loop filter to be applied according to each block may vary.
  • CU coding unit
  • the reconstructed block or the reconstructed image that has passed through the filter unit 180 may be stored in the reference picture buffer 190.
  • the reconstructed block that has passed through the filter unit 180 may be part of the reference image.
  • the reference image may be a reconstructed image composed of reconstructed blocks that have passed through the filter unit 180.
  • the stored reference image may then be used for inter prediction or motion compensation.
  • FIG. 2 is a block diagram illustrating a configuration of a decoding apparatus according to an embodiment of the present invention.
  • the decoding apparatus 200 may be a decoder, a video decoding apparatus, or an image decoding apparatus.
  • the decoding apparatus 200 may include an entropy decoder 210, an inverse quantizer 220, an inverse transform unit 230, an intra predictor 240, a motion compensator 250, and an adder 255.
  • the filter unit 260 may include a reference picture buffer 270.
  • the decoding apparatus 200 may receive a bitstream output from the encoding apparatus 100.
  • the decoding apparatus 200 may receive a bitstream stored in a computer readable recording medium or may receive a bitstream streamed through a wired / wireless transmission medium.
  • the decoding apparatus 200 may decode the bitstream in an intra mode or an inter mode.
  • the decoding apparatus 200 may generate a reconstructed image or a decoded image through decoding, and output the reconstructed image or the decoded image.
  • the switch When the prediction mode used for decoding is an intra mode, the switch may be switched to intra. When the prediction mode used for decoding is an inter mode, the switch may be switched to inter.
  • the decoding apparatus 200 may obtain a reconstructed residual block by decoding the input bitstream, and generate a prediction block. When the reconstructed residual block and the prediction block are obtained, the decoding apparatus 200 may generate a reconstruction block to be decoded by adding the reconstructed residual block and the prediction block.
  • the decoding target block may be referred to as a current block.
  • the entropy decoder 210 may generate symbols by performing entropy decoding according to a probability distribution of the bitstream.
  • the generated symbols may include symbols in the form of quantized levels.
  • the entropy decoding method may be an inverse process of the above-described entropy encoding method.
  • the entropy decoder 210 may change the one-dimensional vector form coefficient into a two-dimensional block form through a transform coefficient scanning method in order to decode the transform coefficient level (quantized level).
  • the quantized level may be inverse quantized by the inverse quantizer 220 and inversely transformed by the inverse transformer 230.
  • the quantized level may be generated as a reconstructed residual block as a result of inverse quantization and / or inverse transformation.
  • the inverse quantization unit 220 may apply a quantization matrix to the quantized level.
  • the intra predictor 240 may generate the prediction block by performing spatial prediction on the current block using a sample value of an already decoded block around the decoding target block.
  • the motion compensator 250 may generate a prediction block by performing motion compensation on the current block using the reference image stored in the motion vector and the reference picture buffer 270.
  • the motion compensator 250 may generate a prediction block by applying an interpolation filter to a portion of the reference image.
  • it may be determined whether a motion compensation method of a prediction unit included in the coding unit is a skip mode, a merge mode, an AMVP mode, or a current picture reference mode based on the coding unit, and each mode According to the present invention, motion compensation may be performed.
  • the adder 255 may generate a reconstructed block by adding the reconstructed residual block and the predictive block.
  • the filter unit 260 may apply at least one of a deblocking filter, a sample adaptive offset, and an adaptive loop filter to the reconstructed block or the reconstructed image.
  • the filter unit 260 may output the reconstructed image.
  • the reconstructed block or reconstructed picture may be stored in the reference picture buffer 270 to be used for inter prediction.
  • the reconstructed block that has passed through the filter unit 260 may be part of the reference image.
  • the reference image may be a reconstructed image composed of reconstructed blocks that have passed through the filter unit 260.
  • the stored reference image may then be used for inter prediction or motion compensation.
  • 3 is a diagram schematically illustrating a division structure of an image when encoding and decoding an image. 3 schematically shows an embodiment in which one unit is divided into a plurality of sub-units.
  • a coding unit may be used in encoding and decoding.
  • a coding unit may be used as a basic unit of image encoding / decoding.
  • the coding unit may be used as a unit that separates the intra prediction mode and the inter prediction mode during image encoding / decoding.
  • the coding unit may be a basic unit used for a process of prediction, transform, quantization, inverse transform, inverse quantization, or encoding / decoding of transform coefficients.
  • the image 300 is sequentially divided into units of a largest coding unit (LCU), and a split structure is determined by units of an LCU.
  • the LCU may be used as the same meaning as a coding tree unit (CTU).
  • the division of the unit may mean division of a block corresponding to the unit.
  • the block division information may include information about a depth of a unit.
  • the depth information may indicate the number and / or degree of division of the unit.
  • One unit may be divided into a plurality of sub-units hierarchically with depth information based on a tree structure. In other words, the unit and the lower unit generated by the division of the unit may correspond to the node and the child node of the node, respectively.
  • Each divided subunit may have depth information.
  • the depth information may be information indicating the size of a CU and may be stored for each CU. Since the unit depth indicates the number and / or degree of division of the unit, the division information of the lower unit may include information about the size of the lower unit.
  • the partition structure may mean a distribution of a coding unit (CU) in the CTU 310. This distribution may be determined according to whether to divide one CU into a plurality of CUs (two or more positive integers including 2, 4, 8, 16, etc.).
  • the horizontal and vertical sizes of the CUs created by splitting are either half of the horizontal and vertical sizes of the CU before splitting, or smaller than the horizontal and vertical sizes of the CU before splitting, depending on the number of splits. Can have.
  • a CU may be recursively divided into a plurality of CUs. By recursive partitioning, the size of at least one of the horizontal size and vertical size of the divided CU can be reduced compared to at least one of the horizontal size and vertical size of the CU before splitting.
  • Partitioning of a CU can be done recursively up to a predefined depth or a predefined size.
  • the depth of the CTU may be 0, and the depth of the smallest coding unit (SCU) may be a predefined maximum depth.
  • the CTU may be a coding unit having a maximum coding unit size as described above, and the SCU may be a coding unit having a minimum coding unit size.
  • the division starts from the CTU 310, and the depth of the CU increases by one each time the division reduces the horizontal size and / or vertical size of the CU.
  • a CU that is not divided may have a size of 2N ⁇ 2N.
  • a CU of 2N ⁇ 2N size may be divided into four CUs having an N ⁇ N size. The size of N can be reduced by half for every 1 increase in depth.
  • information on whether the CU is split may be expressed through split information of the CU.
  • the split information may be 1 bit of information. All CUs except the SCU may include partition information. For example, if the value of the partition information is the first value, the CU may not be split, and if the value of the partition information is the second value, the CU may be split.
  • a zero-depth CTU may be a 64x64 block. 0 may be the minimum depth.
  • An SCU of depth 3 may be an 8x8 block. 3 may be the maximum depth.
  • CUs of 32x32 blocks and 16x16 blocks may be represented by depth 1 and depth 2, respectively.
  • the horizontal and vertical sizes of the divided four coding units may each have a size of half compared to the horizontal and vertical sizes of the coding unit before being split. have.
  • the four divided coding units may each have a size of 16x16.
  • quad-tree partitions quad-tree partitions
  • the horizontal or vertical size of the divided two coding units may have a half size compared to the horizontal or vertical size of the coding unit before splitting.
  • the two split coding units may have a size of 16x32.
  • the two divided coding units may each have a size of 8x16.
  • the coding unit when one coding unit is divided into three coding units, the coding unit may be divided into three coding units by dividing the horizontal or vertical size of the coding unit in a ratio of 1: 2: 1 before being split.
  • the divided three coding units when a 16x32 size coding unit is horizontally divided into three coding units, the divided three coding units may have sizes of 16x8, 16x16, and 16x8, respectively, from an upper side.
  • the divided three coding units when a 32x32 size coding unit is vertically divided into three coding units, the divided three coding units may have sizes of 8x32, 16x32, and 8x32 from the left, respectively.
  • the coding unit When one coding unit is divided into three coding units, it may be said that the coding unit is divided into ternary-tree partitions.
  • the CTU 320 of FIG. 3 is an example of a CTU to which all of quadtree division, binary tree division, and three division tree division are applied.
  • quadtree splitting may be preferentially applied to CTUs.
  • a coding unit that can no longer be quadtree split may correspond to a leaf node of the quadtree.
  • the coding unit corresponding to the leaf node of the quadtree may be a root node of a binary tree and / or a three split tree. That is, the coding unit corresponding to the leaf node of the quadtree may be binary tree split, 3-split tree split, or no longer split.
  • quadrature splitting is not performed on the coding unit generated by binary tree splitting or tri-partitioning of the coding unit corresponding to the leaf node of the quadtree, thereby signaling block division and / or splitting information. It can be done effectively.
  • the division of the coding unit corresponding to each node of the quadtree may be signaled using quad division information.
  • Quad division information having a first value (eg, '1') may indicate that the corresponding coding unit is quadtree divided.
  • Quad division information having a second value (eg, '0') may indicate that the corresponding coding unit is not quadtree divided.
  • the quad division information may be a flag having a predetermined length (eg, 1 bit).
  • Priority may not exist between binary tree partitioning and 3-partition tree partitioning. That is, the coding unit corresponding to the leaf node of the quadtree may be binary tree split or 3 split tree split. In addition, the coding unit generated by binary tree splitting or tri-partition splitting may be further divided into binary tree split or tri-partition splitting or no longer split.
  • Partitioning when there is no priority between binary tree partitioning and 3-partition tree partitioning may be referred to as a multi-type tree partition. That is, the coding unit corresponding to the leaf node of the quadtree may be the root node of a multi-type tree.
  • the splitting of the coding unit corresponding to each node of the composite tree may be signaled using at least one of splitting information of splitting tree, splitting direction information, and splitting tree information. Partition information, split direction information, and split tree information may be signaled sequentially for splitting coding units corresponding to each node of the complex tree.
  • the splitting information of the composite tree having the first value may indicate that the corresponding coding unit is split into the composite tree.
  • the splitting information of the composite tree having the second value (eg, '0') may indicate that the corresponding coding unit is not split in the composite tree.
  • the coding unit may further include split direction information.
  • the split direction information may indicate the split direction of the complex tree split.
  • the split direction information having the first value (eg, '1') may indicate that the corresponding coding unit is split in the vertical direction.
  • the split direction information having a second value (eg, '0') may indicate that the corresponding coding unit is split in the horizontal direction.
  • the coding unit may further include split tree information.
  • the split tree information may indicate a tree used for compound tree split.
  • the split tree information having a first value (eg, '1') may indicate that the corresponding coding unit is binary tree split.
  • Split tree information having a second value (eg, '0') may indicate that the corresponding coding unit is divided into three split trees.
  • the split information, split tree information, and split direction information may each be flags having a predetermined length (eg, 1 bit).
  • At least one of quad split information, split tree information, split direction information, and split tree information may be entropy encoded / decoded.
  • information of the neighboring coding unit adjacent to the current coding unit may be used.
  • the split form (split state, split tree and / or split direction) of the left coding unit and / or the upper coding unit is likely to be similar to the split form of the current coding unit. Therefore, context information for entropy encoding / decoding of the information of the current coding unit can be derived based on the information of the neighboring coding unit.
  • the information of the neighboring coding unit may include at least one of quad splitting information of the corresponding coding unit, splitting information of the composite tree, splitting direction information, and splitting tree information.
  • binary tree splitting may be performed preferentially.
  • binary tree splitting is applied first, and the coding unit corresponding to the leaf node of the binary tree may be set as the root node of the 3-split tree.
  • quadtree splitting and binary tree splitting may not be performed on a coding unit corresponding to a node of a three split tree.
  • a coding unit that is no longer split by quadtree splitting, binary tree splitting, and / or 3 splittree splitting may be a unit of encoding, prediction, and / or transform. That is, the coding unit may no longer be split for prediction and / or transformation. Therefore, a partitioning structure, partitioning information, etc. for splitting a coding unit into prediction units and / or transform units may not exist in the bitstream.
  • the corresponding coding unit may be recursively split until the size is equal to or smaller than the size of the maximum transform block.
  • the coding unit may be divided into four 32x32 blocks for transformation.
  • the coding unit may be divided into two 32x32 blocks for transformation. In this case, whether to split the coding unit for transformation is not signaled separately, but may be determined by comparing the width or length of the coding unit with the width or length of the maximum transform block.
  • the coding unit when the width of the coding unit is larger than the width of the largest transform block, the coding unit may be divided into two vertically. In addition, when the height of the coding unit is larger than the length of the largest transform block, the coding unit may be divided into two horizontally.
  • Information about the maximum and / or minimum size of the coding unit may be signaled or determined at a higher level of the coding unit.
  • the higher level may be, for example, a sequence level, a picture level, a slice level, and the like.
  • the minimum size of the coding unit may be determined as 4 ⁇ 4.
  • the maximum size of the transform block may be determined to be 64x64.
  • the minimum size of the transform block may be determined as 4 ⁇ 4.
  • Information about the minimum size (quadtree minimum size) of the coding unit corresponding to the leaf node of the quadtree and / or the maximum depth (maximum depth of the composite tree) from the root node to the leaf node of the composite tree is encoded. It may be signaled or determined at a higher level of the unit. The higher level may be, for example, a sequence level, a picture level, a slice level, and the like.
  • the information about the quadtree minimum size and / or the information about the maximum depth of the composite tree may be signaled or determined for each of the slice in the picture and the slice between the pictures.
  • Difference information about the size of the CTU and the maximum size of the transform block may be signaled or determined at a higher level of the coding unit.
  • the higher level may be, for example, a sequence level, a picture level, a slice level, and the like.
  • Information about the maximum size (binary tree maximum size) of the coding unit corresponding to each node of the binary tree may be determined based on the size of the coding tree unit and the difference information.
  • the maximum size (maximum size of the three-split tree) of the coding unit corresponding to each node of the three-split tree may have a different value depending on the slice type. For example, in the case of an intra slice, the maximum size of the three-split tree may be 32x32.
  • the maximum size of the three-split tree may be 128x128.
  • the minimum size of the coding unit corresponding to each node of the binary tree (binary tree minimum size) and / or the minimum size of the coding unit corresponding to each node of the three split tree (three split tree minimum size) is the minimum size of the coding block. Can be set to size.
  • the binary tree maximum size and / or the split tree maximum size may be signaled or determined at the slice level.
  • the binary tree minimum size and / or the split tree minimum size may be signaled or determined at the slice level.
  • quad split information, split tree information, split tree information, and / or split direction information may or may not be present in the bitstream.
  • the coding unit does not include quad split information, and the quad split information may be inferred as a second value.
  • the coding unit is Binary tree splitting and / or three splitting tree splitting may not be possible. Accordingly, splitting information of the composite tree is not signaled and can be inferred as a second value.
  • the size (horizontal and vertical) of the coding unit corresponding to the node of the complex tree is the same as the binary tree minimum size (horizontal and vertical), or the size (horizontal and vertical) of the coding unit is the minimum size (horizontal) of the split tree.
  • the coding unit may not be binary tree split and / or 3 split tree split. Accordingly, splitting information of the composite tree is not signaled and can be inferred as a second value. This is because, when the coding unit divides the binary tree and / or divides the tri-tree, a coding unit smaller than the minimum size of the binary tree and / or the minimum size of the tri-partition tree is generated.
  • the coding unit may not be binary tree split and / or 3 split tree split. Accordingly, splitting information of the composite tree is not signaled and can be inferred as a second value.
  • the composite type may be used only when at least one of vertical binary tree splitting, horizontal binary splitting, vertical triangular splitting, and horizontal triangular splitting is possible for a coding unit corresponding to a node of the composite tree.
  • Information on whether to split the tree may be signaled. Otherwise, the coding unit may not be binary-tree split and / or tri-partition split. Accordingly, splitting information of the composite tree is not signaled and can be inferred as a second value.
  • Division direction information may be signaled. Otherwise, the split direction information may not be signaled and may be inferred as a value indicating a split direction.
  • the encoding unit corresponding to the node of the complex tree may be both vertical binary tree splitting and vertical triangular splitting, or both horizontal binary splitting and horizontal splitting may be performed.
  • the split tree information may be signaled. Otherwise, the split tree information is not signaled and can be inferred as a value indicating a splittable tree.
  • FIG. 4 is a diagram for describing an embodiment of an inter prediction process.
  • the quadrangle shown in FIG. 4 may represent an image. Also, in FIG. 4, an arrow may indicate a prediction direction. Each picture may be classified into an I picture (Intra Picture), a P picture (Predictive Picture), a B picture (Bi-predictive Picture), and the like.
  • I pictures may be encoded / decoded through intra prediction without inter prediction.
  • the P picture may be encoded / decoded through inter prediction using only reference pictures existing in one direction (eg, forward or reverse direction).
  • the B picture may be encoded / decoded through inter prediction using reference images existing in both directions (eg, forward and reverse).
  • the B picture may be encoded / decoded through inter prediction using reference images existing in bidirectional directions or inter prediction using reference images existing in one of forward and reverse directions.
  • the bidirectional can be forward and reverse.
  • the encoder may perform inter prediction or motion compensation
  • the decoder may perform motion compensation corresponding thereto.
  • Inter prediction or motion compensation may be performed using a reference image and motion information.
  • the motion information on the current block may be derived during inter prediction by each of the encoding apparatus 100 and the decoding apparatus 200.
  • the motion information may be derived using motion information of the restored neighboring block, motion information of a collocated block (col block), and / or a block adjacent to the call block.
  • the call block may be a block corresponding to a spatial position of the current block in a collocated picture (col picture).
  • the call picture may be one picture among at least one reference picture included in the reference picture list.
  • the method of deriving the motion information may vary depending on the prediction mode of the current block.
  • a prediction mode applied for inter prediction may include an AMVP mode, a merge mode, a skip mode, a current picture reference mode, and the like.
  • the merge mode may be referred to as a motion merge mode.
  • a motion vector candidate list may be generated.
  • a motion vector candidate may be derived using the generated motion vector candidate list.
  • the motion information of the current block may be determined based on the derived motion vector candidate.
  • the motion vector of the collocated block or the motion vector of the block adjacent to the collocated block may be referred to as a temporal motion vector candidate, and the restored motion vector of the neighboring block is a spatial motion vector candidate. It may be referred to as).
  • the encoding apparatus 100 may calculate a motion vector difference (MVD) between the motion vector and the motion vector candidate of the current block, and may entropy-encode the MVD.
  • the encoding apparatus 100 may generate a bitstream by entropy encoding a motion vector candidate index.
  • the motion vector candidate index may indicate an optimal motion vector candidate selected from the motion vector candidates included in the motion vector candidate list.
  • the decoding apparatus 200 may entropy decode the motion vector candidate index from the bitstream, and select the motion vector candidate of the decoding target block from the motion vector candidates included in the motion vector candidate list using the entropy decoded motion vector candidate index. .
  • the decoding apparatus 200 may derive the motion vector of the decoding object block through the sum of the entropy decoded MVD and the motion vector candidate.
  • the bitstream may include a reference picture index and the like indicating the reference picture.
  • the reference image index may be entropy encoded and signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream.
  • the decoding apparatus 200 may generate a prediction block for the decoding target block based on the derived motion vector and the reference image index information.
  • the merge mode may mean merging of motions for a plurality of blocks.
  • the merge mode may refer to a mode of deriving motion information of the current block from motion information of neighboring blocks.
  • a merge candidate list may be generated using motion information of the restored neighboring block and / or motion information of the call block.
  • the motion information may include at least one of 1) a motion vector, 2) a reference picture index, and 3) an inter prediction prediction indicator.
  • the prediction indicator may be unidirectional (L0 prediction, L1 prediction) or bidirectional.
  • the merge candidate list may represent a list in which motion information is stored.
  • the motion information stored in the merge candidate list includes motion information (spatial merge candidate) of neighboring blocks adjacent to the current block and motion information (temporary merge candidate (collocated)) of the block corresponding to the current block in the reference picture. temporal merge candidate)), new motion information generated by a combination of motion information already present in the merge candidate list, and zero merge candidate.
  • the encoding apparatus 100 may generate a bitstream by entropy encoding at least one of a merge flag and a merge index, and may signal the decoding apparatus 200.
  • the merge flag may be information indicating whether to perform a merge mode for each block
  • the merge index may be information on which one of neighboring blocks adjacent to the current block is merged.
  • the neighboring blocks of the current block may include at least one of a left neighboring block, a top neighboring block, and a temporal neighboring block of the current block.
  • the skip mode may be a mode in which motion information of a neighboring block is applied to the current block as it is.
  • the encoding apparatus 100 may entropy-code information about which block motion information to use as the motion information of the current block and signal the decoding apparatus 200 through the bitstream. In this case, the encoding apparatus 100 may not signal a syntax element regarding at least one of motion vector difference information, an encoding block flag, and a transform coefficient level (quantized level) to the decoding apparatus 200.
  • the current picture reference mode may mean a prediction mode using a pre-restored region in the current picture to which the current block belongs. In this case, a vector may be defined to specify the pre-restored region.
  • Whether the current block is encoded in the current picture reference mode may be encoded using a reference picture index of the current block.
  • a flag or index indicating whether the current block is a block encoded in the current picture reference mode may be signaled or may be inferred through the reference picture index of the current block.
  • the current picture When the current block is encoded in the current picture reference mode, the current picture may be added at a fixed position or an arbitrary position in the reference picture list for the current block.
  • the fixed position may be, for example, a position at which the reference picture index is 0 or the last position.
  • a separate reference picture index indicating the arbitrary location may be signaled.
  • FIG. 5 is a flowchart illustrating an image encoding method according to an embodiment of the present invention
  • FIG. 6 is a flowchart illustrating an image decoding method according to an embodiment of the present invention.
  • the encoding apparatus may derive a motion vector candidate (S501), and generate a motion vector candidate list based on the derived motion vector candidate (S502).
  • a motion vector may be determined using the generated motion vector candidate list (S503), and motion compensation may be performed using the motion vector (S504).
  • the encoding apparatus may entropy-encode the information on the motion compensation (S505).
  • the decoding apparatus may entropy decode information about motion compensation received from the encoding apparatus (S601) and derive a motion vector candidate (S602).
  • the decoding apparatus may generate a motion vector candidate list based on the derived motion vector candidate (S603), and determine the motion vector using the generated motion vector candidate list (S604). Thereafter, the decoding apparatus may perform motion compensation by using the motion vector (S605).
  • FIG. 7 is a flowchart illustrating a video encoding method according to another embodiment of the present invention
  • FIG. 8 is a flowchart illustrating a video decoding method according to another embodiment of the present invention.
  • the encoding apparatus may derive a merge candidate (S701) and generate a merge candidate list based on the derived merge candidate.
  • motion information may be determined using the generated merge candidate list (S702), and motion compensation of the current block may be performed using the determined motion information (S703).
  • the encoding apparatus may entropy-encode the information on the motion compensation (S704).
  • the decoding apparatus may entropy decode information about motion compensation received from the encoding apparatus (S801), derive a merge candidate (S802), and generate a merge candidate list based on the derived merge candidate. have.
  • the motion information of the current block may be determined using the generated merge candidate list (S803).
  • the decoding apparatus may perform motion compensation using the motion information (S804).
  • FIGS. 7 and 8 may be examples of applying the merge mode described with reference to FIG. 4.
  • the motion vector candidate for the current block may include at least one of a spatial motion vector candidate or a temporal motion vector candidate.
  • the spatial motion vector of the current block can be derived from the reconstructed block around the current block.
  • a motion vector of a reconstructed block around the current block may be determined as a spatial motion vector candidate for the current block.
  • FIG. 9 is a diagram for describing an example of deriving a spatial motion vector candidate of a current block.
  • the spatial motion vector candidate of the current block may be derived from neighboring blocks adjacent to the current block (X).
  • the neighboring block adjacent to the current block includes a block B1 adjacent to the top of the current block, a block A1 adjacent to the left of the current block, a block B0 adjacent to the upper right corner of the current block, and an upper left corner of the current block. At least one of the block B2 adjacent to the corner and the block A0 adjacent to the lower left corner of the current block may be included.
  • a neighboring block adjacent to the current block may have a square shape or a non-square shape.
  • the motion vector of the neighboring block may be determined as a spatial motion vector candidate of the current block. Whether the motion vector of the neighboring block exists or whether the motion vector of the neighboring block is available as a spatial motion vector candidate of the current block is based on whether the neighboring block exists or whether the neighboring block is encoded through inter prediction. It can be determined as. In this case, whether the motion vector of the neighboring block exists or whether the motion vector of the neighboring block is available as the spatial motion vector candidate of the current block may be determined according to a predetermined priority. For example, in the example shown in FIG. 9, the availability of the motion vector may be determined in the order of blocks in positions A0, A1, B0, B1, and B2.
  • scaling of the motion vector of the neighboring block may be determined as a candidate for the spatial motion vector of the current block.
  • the scaling may be performed based on at least one of the distance between the current image and the reference image referenced by the current block and the distance between the current image and the reference image referenced by the neighboring block.
  • the spatial motion vector candidate of the current block is derived by scaling the motion vector of the neighboring block according to the ratio of the distance between the current image and the reference image referenced by the current block and the distance between the current image and the reference image referenced by the neighboring block. Can be.
  • the motion vector of the neighboring block is scaled as a spatial motion vector candidate of the current block. Even in this case, scaling may be performed based on at least one of the distance between the current image and the reference image referenced by the current block and the distance between the current image and the reference image referenced by the neighboring block.
  • a motion vector of a neighboring block may be scaled based on a reference picture indicated by a reference picture index having a predefined value and determined as a spatial motion vector candidate.
  • the predefined value may be a positive integer including 0.
  • the distance between the reference picture of the current block and the reference picture of the current block indicated by the reference picture index having a predefined value and the distance between the current picture and the reference picture of the neighboring block having a predefined value may be determined.
  • a spatial motion vector candidate of the current block may be derived based on at least one or more of encoding parameters of the current block.
  • the temporal motion vector candidate of the current block may be derived from a reconstructed block included in a co-located picture of the current picture.
  • the corresponding location image is an image in which encoding / decoding is completed before the current image, and may be an image having a temporal order different from that of the current image.
  • FIG. 10 is a diagram for describing an example of deriving a temporal motion vector candidate of a current block.
  • a temporal motion vector candidate of the current block may be derived from a block including an inner position of the block corresponding to.
  • the temporal motion vector candidate may mean a motion vector of the corresponding location block.
  • the temporal motion vector candidate of the current block X may include a block H or a center point of the block C adjacent to the lower left corner of the block C corresponding to the same spatial position as the current block. Can be derived from.
  • a block H or a block C3 used to derive a temporal motion vector candidate of the current block may be referred to as a 'collocated block'.
  • At least one of a temporal motion vector candidate, a corresponding position image, a corresponding position block, a prediction list utilization flag, and a reference image index may be derived based on at least one or more of coding parameters.
  • the temporal motion vector candidate of the current block corresponds to the corresponding position. It can be obtained by scaling the motion vector of the block.
  • the scaling may be performed based on at least one of the distance between the current image and the reference image referenced by the current block and the distance between the corresponding position image and the reference image referenced by the corresponding position block.
  • the temporal motion vector of the current block is scaled by scaling a motion vector of the corresponding position block according to a ratio of the distance between the current image and the reference image referenced by the current block and the distance between the corresponding position image and the reference image referenced by the corresponding position block.
  • Candidates can be derived.
  • Generating the motion vector candidate list may include adding or removing the motion vector candidate to the motion vector candidate list and adding the combined motion vector candidate to the motion vector candidate list.
  • the encoding apparatus and the decoding apparatus may add the derived motion vector candidate to the motion vector candidate list in the order of derivation of the motion vector candidate.
  • the motion vector candidate list mvpListLX is assumed to mean a motion vector candidate list corresponding to the reference picture lists L0, L1, L2, and L3.
  • a motion vector candidate list corresponding to L0 in the reference picture list may be referred to as mvpListL0.
  • a motion vector having a predetermined value other than the spatial motion vector candidate and the temporal motion vector candidate may be added to the motion vector candidate list. For example, when the number of motion vector candidates included in the motion vector list is smaller than the maximum number of motion vector candidates, a motion vector having a value of 0 may be added to the motion vector candidate list.
  • the combined motion vectors are added to the motion vector candidate list using at least one or more of the motion vector candidates included in the motion vector candidate list. can do.
  • a combined motion vector candidate is generated using at least one or more of a spatial motion vector candidate, a temporal motion vector candidate, and a zero motion vector candidate included in the motion vector candidate list, and the generated combined motion vector candidate is moved. It can be included in the vector candidate list.
  • the combined motion vector candidate may be generated based on at least one or more of the encoding parameters, or the combined motion vector candidate may be added to the motion vector candidate list based on at least one or more of the encoding parameters.
  • the motion vector candidate indicated by the motion vector candidate index among the motion vector candidates included in the motion vector candidate list may be determined as a predicted motion vector for the current block.
  • the encoding apparatus may calculate a difference between the motion vector and the predicted motion vector, and calculate a motion vector difference value.
  • the decoding apparatus may calculate a motion vector by adding the predicted motion vector and the motion vector difference.
  • motion information refinement may be applied to any one of a motion vector candidate included in the motion vector candidate list, a predicted motion vector, or a motion vector calculated by adding the motion vector difference with the predicted motion vector. A detailed description of the motion information correction will be described later.
  • the merge candidate for the current block may include at least one of a spatial merge candidate, a temporal merge candidate, or an additional merge candidate.
  • deriving a spatial merge candidate may mean deriving a spatial merge candidate and adding it to the merge candidate list.
  • the spatial merge candidate of the current block may be derived from neighboring blocks adjacent to the current block (X).
  • the neighboring block adjacent to the current block is the block B1 adjacent to the top of the current block, the block A1 adjacent to the left of the current block, the block B0 adjacent to the upper right corner of the current block, and the upper left corner of the current block.
  • At least one of an adjacent block B2 and a block A0 adjacent to a lower left corner of the current block may be included.
  • a neighboring block adjacent to the current block it may be determined whether a neighboring block adjacent to the current block can be used for deriving a spatial merge candidate of the current block.
  • whether a neighboring block adjacent to the current block can be used for deriving a spatial merge candidate of the current block may be determined according to a predetermined priority. For example, in the example illustrated in FIG. 9, spatial merge candidate derivation availability may be determined in the order of blocks of positions A1, B1, B0, A0, and B2. The spatial merge candidates determined based on the availability determination order may be sequentially added to the merge candidate list of the current block.
  • FIG. 11 illustrates an example in which a spatial merge candidate is added to a merge candidate list.
  • spatial merge candidates derived from the merge candidate list may be sequentially added.
  • the spatial merge candidate may be derived based on at least one of encoding parameters.
  • the motion information of the spatial merge candidate may have three or more motion information such as L2 and L3 as well as the motion information of L0 and L1.
  • the reference picture list may include at least one of L0, L1, L2, and L3.
  • the temporal merge candidate of the current block may be derived from a reconstructed block included in a co-located picture of the current picture.
  • the corresponding location image is an image in which encoding / decoding is completed before the current image, and may be an image having a temporal order different from that of the current image.
  • Deriving a temporal merge candidate may mean deriving a temporal merge candidate and adding it to the merge candidate list.
  • a temporal merge candidate of the current block may be derived from a block including an inner position of the block corresponding to.
  • the temporal merge candidate may mean motion information of the corresponding location block.
  • the temporal merge candidate of the current block X is from a block H adjacent to the lower left corner of the block C or a block C3 including a center point of the block C corresponding to a position spatially identical to the current block. Can be induced.
  • a block H or a block C3 used to derive a temporal merge candidate of the current block may be referred to as a 'collocated block'.
  • a temporal merge candidate of the current block can be derived from the block H including the outer position of the block C
  • the block H may be set as the corresponding position block of the current block.
  • the temporal merge candidate of the current block may be derived based on the motion information of the block H.
  • block C3 including an internal position of block C may be set as a corresponding position block of the current block.
  • the temporal merge candidate of the current block may be derived based on the motion information of the block C3.
  • the temporal merge candidate for the current block is not derived or the block It may be derived from blocks at positions other than H and block C3.
  • the temporal merge candidate of the current block may be derived from a plurality of blocks in the corresponding position image.
  • a plurality of temporal merge candidates for the current block may be derived from block H and block C3.
  • FIG. 12 illustrates an example in which a temporal merge candidate is added to a merge candidate list.
  • the temporal merge candidate derived to the merge candidate list may be added.
  • the motion vector of the temporal merge candidate of the current block is It can be obtained by scaling the motion vector of the corresponding position block.
  • the scaling may be performed based on at least one of the distance between the current image and the reference image referenced by the current block and the distance between the corresponding position image and the reference image referenced by the corresponding position block.
  • the motion vector of can be derived.
  • At least one of a temporal merge candidate, a corresponding location image, a corresponding location block, a prediction list utilization flag, and a reference picture index may be derived based on at least one of encoding parameters of a current block, a neighboring block, or a corresponding location block.
  • the merge candidate list may be generated by adding the merge candidate list to the merge candidate list in the derived merge candidate order.
  • the additional merge candidate means at least one of a modified spatial merge candidate, a modified temporal merge candidate, a combined merge candidate, and a merge candidate having a predetermined motion information value. can do.
  • deriving an additional merge candidate may mean deriving an additional merge candidate and adding it to the merge candidate list.
  • the changed spatial merge candidate may refer to a merge candidate in which at least one of motion information of the derived spatial merge candidate is changed.
  • the changed temporal merge candidate may mean a merge candidate which changed at least one of motion information of the derived temporal merge candidate.
  • the combined merge candidate may include at least one of spatial information on a merge candidate list, a temporal merge candidate, a changed spatial merge candidate, a changed temporal merge candidate, a combined merge candidate, and motion information of merge candidates having predetermined motion information values. It may mean a merge candidate derived by combining motion information.
  • the combined merge candidate is not present in the merge candidate list but can be derived from a block that is capable of deriving at least one or more of a spatial merge candidate and a temporal merge candidate, and a modified merge generated based on the spatial merge candidate and the derived temporal merge candidate. It may mean a merge candidate derived by combining at least one motion information among a spatial merge candidate, a change temporal merge candidate, a combined merge candidate, and a merge candidate having a predetermined motion information value.
  • the combined merge candidate may be derived using motion information entropy decoded from the bitstream in the decoder.
  • the motion information used for the merge candidate derivation combined in the encoder may be entropy encoded in the bitstream.
  • the combined merge candidate may mean a combined two-prediction merge candidate.
  • the combined two-prediction merge candidate is a merge candidate using bi-prediction and may mean a merge candidate having L0 motion information and L1 motion information.
  • the merge candidate having a predetermined motion information value may mean a zero merge candidate having a motion vector of (0, 0). Meanwhile, the merge candidate having a predetermined motion information value may be preset to use the same value in the encoding apparatus and the decoding apparatus.
  • the size of the merge candidate list may be determined based on encoding parameters of the current block, neighboring blocks, or corresponding position blocks, and the size may be changed based on the encoding parameters.
  • the encoder may determine a merge candidate used for motion compensation among merge candidates in the merge candidate list through motion estimation, and may encode a merge candidate index (merge_idx) indicating the determined merge candidate in the bitstream.
  • merge_idx merge candidate index
  • the encoder may determine the motion information of the current block by selecting a merge candidate from the merge candidate list based on the merge candidate index described above to generate the prediction block.
  • the prediction block of the current block may be generated by performing motion compensation based on the determined motion information.
  • the decoder may decode the merge candidate index in the bitstream to determine the merge candidate in the merge candidate list indicated by the merge candidate index.
  • the determined merge candidate may be determined as motion information of the current block.
  • the determined motion information is used for motion compensation of the current block. In this case, the motion compensation may be the same as the meaning of inter prediction.
  • the motion information correction may be applied to any one of the motion information determined in the merge candidate list based on the merge candidate or the merge candidate index included in the merge candidate list. A detailed description of the motion information correction will be described later.
  • the encoding apparatus and the decoding apparatus may calculate the motion vector using the predicted motion vector and the motion vector difference value. Once the motion vector is calculated, inter prediction or motion compensation may be performed using the calculated motion vector (S504 and S605).
  • the encoding apparatus and the decoding apparatus may perform inter prediction or motion compensation by using the determined motion information (S703 and S804).
  • the current block may have motion information of the determined merge candidate.
  • the current block may have at least one to N motion vectors according to the prediction direction. Using the motion vector, at least one to N prediction blocks may be generated to derive the last prediction block of the current block.
  • the prediction block generated using the motion vector may be determined as the final prediction block of the current block.
  • a plurality of prediction blocks are generated using the plurality of motion vectors (or motion information), and based on the weighted sum of the plurality of prediction blocks, The final prediction block of the block can be determined.
  • Reference pictures including each of a plurality of prediction blocks indicated by a plurality of motion vectors (or motion information) may be included in different reference picture lists or may be included in the same reference picture list.
  • a plurality of prediction blocks are generated based on at least one of a spatial motion vector candidate, a temporal motion vector candidate, a motion vector having a predetermined value, or a combined motion vector candidate, and based on a weighted sum of the plurality of prediction blocks.
  • the final prediction block of the current block may be determined.
  • a plurality of prediction blocks may be generated based on motion vector candidates indicated by a preset motion vector candidate index, and the final prediction block of the current block may be determined based on a weighted sum of the plurality of prediction blocks.
  • a plurality of prediction blocks may be generated based on motion vector candidates existing in a preset motion vector candidate index range, and a final prediction block of the current block may be determined based on a weighted sum of the plurality of prediction blocks.
  • the weight applied to each prediction block may have a value equal to 1 / N (where N is the number of generated prediction blocks). For example, when two prediction blocks are generated, the weight applied to each prediction block is 1/2, and when three prediction blocks are generated, the weight applied to each prediction block is 1/3 and four predictions When the block is generated, the weight applied to each prediction block may be 1/4. Alternatively, different weights may be assigned to each prediction block to determine a final prediction block of the current block.
  • the weight does not have to have a fixed value for each prediction block, and may have a variable value for each prediction block.
  • weights applied to each prediction block may be the same or different from each other.
  • the weights applied to the two prediction blocks are not only (1/2, 1/2), but also (1/3, 2/3), (1/4, 3 / 4), (2/5, 3/5), (3/8, 5/8), etc. may be a variable value for each block.
  • the weight may be a value of a positive real number or a value of a negative real number.
  • a negative real value may be included, such as (-1/2, 3/2), (-1/3, 4/3), (-1/4, 5/4), and the like.
  • one or more weight information for the current block may be signaled through the bitstream.
  • the weight information may be signaled for each prediction block or for each reference picture. It is also possible for a plurality of prediction blocks to share one weight information.
  • the encoding apparatus and the decoding apparatus may determine whether to use the predicted motion vector (or motion information) based on the prediction block list utilization flag. For example, when the prediction block list utilization flag indicates 1 as the first value for each reference picture list, the encoding apparatus and the decoding apparatus may use the predicted motion vector of the current block to perform inter prediction or motion compensation. When indicating a second value of 0, the encoding apparatus and the decoding apparatus may indicate that the inter prediction or the motion compensation is not performed using the predicted motion vector of the current block. Meanwhile, the first value of the prediction block list utilization flag may be set to 0 and the second value may be set to 1.
  • Equations 3 to 5 are examples of generating the final prediction block of the current block when the inter prediction prediction indicators of the current block are PRED_BI, PRED_TRI, and PRED_QUAD, respectively, and the prediction direction for each reference picture list is one-way. Indicates.
  • P_BI, P_TRI, and P_QUAD may represent final prediction blocks of the current block
  • WF_LX may indicate a weight value of the prediction block generated using LX
  • OFFSET_LX may indicate an offset value for the prediction block generated using LX
  • P_LX means a prediction block generated using a motion vector (or motion information) for LX of the current block.
  • RF means a rounding factor and may be set to 0, positive or negative.
  • the LX reference picture list includes a long-term reference picture, a reference picture without deblocking filter, a reference picture without sample adaptive offset, and an adaptive loop filter.
  • the reference image without loop filter reference image with deblocking filter and adaptive offset only, reference image with deblocking filter and adaptive loop filter only, reference with sample adaptive offset and adaptive loop filter only
  • the image, the deblocking filter, the sample adaptive offset, and the adaptive loop filter may all include at least one of reference images.
  • the LX reference picture list may be at least one of an L2 reference picture list and an L3 reference picture list.
  • the final prediction block for the current block may be obtained based on the weighted sum of the prediction blocks.
  • the weights applied to the prediction blocks derived from the same reference picture list may have the same value or may have different values.
  • At least one of the weights WF_LX and the offset OFFSET_LX for the plurality of prediction blocks may be an encoding parameter that is entropy encoded / decoded.
  • weights and offsets may be derived from encoded / decoded neighboring blocks around the current block.
  • the neighboring block around the current block may include at least one of a block used to derive the spatial motion vector candidate of the current block or a block used to derive the temporal motion vector candidate of the current block.
  • the weight and offset may be determined based on a display order (POC) of the current picture and each reference picture.
  • POC display order
  • the weight or offset may be set to a smaller value, and as the distance between the current picture and the reference picture becomes closer, the weight or offset may be set to a larger value.
  • the weight or offset value may have an inverse relationship with the display order difference between the current image and the reference image.
  • the weight or offset value may be proportional to the display order difference between the current picture and the reference picture.
  • At least one or more of the weight or offset may be entropy encoded / decoded.
  • the weighted sum of the prediction blocks may be calculated based on at least one of the encoding parameters.
  • the weighted sum of the plurality of prediction blocks may be applied only in some regions within the prediction block.
  • the partial region may be a region corresponding to a boundary in the prediction block.
  • the weighted sum may be performed in units of sub-blocks of the prediction block.
  • Inter-prediction or motion compensation may be performed using the same prediction block or the same final prediction block in the lower blocks of the smaller block size in the block of the block size indicated by the region information.
  • interblock prediction or motion compensation may be performed using the same prediction block or the same final prediction block in lower blocks having a deeper block depth within a block of a block depth indicated by region information.
  • the weighted sum may be calculated using at least one or more motion vector candidates present in the motion vector candidate list and used as the final prediction block of the current block.
  • prediction blocks may be generated only with spatial motion vector candidates, a weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated with spatial motion vector candidates and temporal motion vector candidates, a weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated only with combined motion vector candidates, a weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated only with motion vector candidates having specific motion vector candidate indices, the weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated only with motion vector candidates existing within a specific motion vector candidate index range, the weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum may be calculated using at least one merge candidate present in the merge candidate list and used as the final prediction block of the current block.
  • prediction blocks may be generated only with spatial merge candidates, a weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated from spatial merge candidates and temporal merge candidates, a weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated only with combined merge candidates, a weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated only with merge candidates having specific merge candidate indices, the weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • prediction blocks may be generated only with merge candidates existing within a specific merge candidate index range, the weighted sum of the prediction blocks may be used, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the encoder and the decoder may perform motion compensation by using motion vectors / information of the current block.
  • the final prediction block resulting from the motion compensation may be generated using at least one or more prediction blocks.
  • the current block may mean at least one of a current coding block and a current prediction block.
  • the final predicted block may be generated by performing an overlapped block motion compensation that is overlapped with a region corresponding to the boundary of the current block.
  • the area corresponding to the boundary in the current block may be an area in the current block adjacent to the boundary of the neighboring block of the current block.
  • the area corresponding to the boundary in the current block is one of the upper boundary area, the left boundary area, the lower boundary area, the right boundary area, the upper right corner area, the lower right corner area, the upper left corner area, and the lower left corner area of the current block. It may include at least one.
  • the region corresponding to the boundary in the current block may be a region corresponding to a part of the prediction block of the current block.
  • the overlapped block motion compensation is performed by calculating a weighted sum of a prediction block generated using motion information of a prediction block region corresponding to a boundary within a current block and a block encoded / decoded adjacent to the current block to perform motion compensation. Can mean.
  • the weighted summation may be performed in units of sub-blocks after dividing the current block into a plurality of sub-blocks. That is, motion compensation may be performed using motion information of a block encoded / decoded adjacent to the current block in lower block units.
  • the lower block may mean a sub block.
  • the weighted sum calculation may use a first prediction block generated in units of lower blocks using motion information of the current block and a second prediction block generated using motion information of neighboring lower blocks spatially adjacent to the current block.
  • using motion information may mean deriving motion information.
  • the first prediction block may mean a prediction block generated using motion information of a lower block to be encoded / decoded in the current block.
  • the second prediction block may also mean a prediction block generated using motion information of a neighboring lower block spatially adjacent to the encoding / decoding target lower block in the current block.
  • the final prediction block may be generated using a weighted sum of the first prediction block and the second prediction block. That is, the overlapped block motion compensation may generate the final prediction block by using motion information of another block in addition to the motion information of the current block.
  • AMVP Advanced Motion Vector Prediction
  • merge mode affine motion compensation mode
  • decoder motion vector derivation mode adaptive motion vector resolution mode
  • local illumination compensation mode bidirectional optical flow
  • AMVP Advanced Motion Vector Prediction
  • merge mode affine motion compensation mode
  • decoder motion vector derivation mode decoder motion vector derivation mode
  • adaptive motion vector resolution mode adaptive motion vector resolution mode
  • local illumination compensation mode bidirectional optical flow
  • bidirectional optical flow In the case of at least one of the modes, the current prediction block may be divided into lower blocks and then overlapped block motion compensation may be performed for each lower block.
  • block motion compensation superimposed on at least one of Advanced Temporal Motion Vector Predictor (ATMVP) candidate and Spatial-Temporal Motion Vector Predictor (STMVP) candidate can be performed.
  • ATMVP Advanced Temporal Motion Vector Predictor
  • STMVP Spatial-Temporal Motion Vector Predictor
  • the encoding apparatus may entropy encode information about motion compensation through a bitstream, and the decoding apparatus may entropy decode information about motion compensation included in the bitstream.
  • the entropy encoding / information on the decoded motion compensation that is, the inter prediction indicator (Inter Prediction Indicator) (inter_pred_idc), the reference image index (ref_idx_l0, ref_idx_l1, ref_idx_l2, ref_idx_l3), the motion vector candidate index (mvp_l0_idx, mvp_l1_idx, mvp_l2_idx , mvp_l3_idx, motion vector difference, skip mode availability information (cu_skip_flag), merge mode availability information (merge_flag), merge index information (merge_index), weight values (wf_l0, wf_l1, wf_l2, wf_l3), and It may include at least one
  • the inter prediction prediction indicator When the inter prediction prediction indicator is encoded / decoded by inter prediction of the current block, it may mean at least one of the inter prediction directions or the number of prediction directions of the current block.
  • the inter-prediction indicator may indicate unidirectional prediction or multi-directional prediction such as bidirectional prediction, three-way prediction, or four-direction prediction.
  • the inter prediction prediction indicator may mean the number of reference pictures that the current block uses when generating the prediction block. Alternatively, one reference picture may be used for a plurality of direction predictions. In this case, N (N> M) direction prediction may be performed using M reference images.
  • the inter prediction prediction indicator may mean the number of prediction blocks used when performing inter prediction or motion compensation on a current block.
  • the reference picture indicator may indicate unidirectional (PRED_LX), bi-prediction or bidirectional (PRED_BI), three-direction (PRED_TRI), four-direction (PRED_QUAD) or more according to the number of prediction directions of the current block.
  • the prediction list utilization flag indicates whether a prediction block is generated using the corresponding reference picture list.
  • the prediction list utilization flag indicates 1 as the first value, it indicates that the prediction block can be generated using the reference picture list, and when 0 indicates the second value, the corresponding reference picture list is used. It may indicate that no prediction block is generated.
  • the first value of the prediction list utilization flag may be set to 0 and the second value may be set to 1.
  • the prediction block of the current block may be generated using motion information corresponding to the reference picture list.
  • the reference picture index may specify a reference picture referenced by the current block in each reference picture list.
  • One or more reference picture indexes may be entropy encoded / decoded for each reference picture list.
  • the current block may perform motion compensation using one or more reference picture indexes.
  • the motion vector candidate index indicates a motion vector candidate for the current block in the motion vector candidate list generated for each reference picture list or reference picture index. At least one motion vector candidate index may be entropy encoded / decoded for each motion vector candidate list.
  • the current block may perform motion compensation using at least one motion vector candidate index.
  • the motion vector difference represents a difference value between the motion vector and the predicted motion vector.
  • One or more motion vector differences may be entropy encoded / decoded with respect to the motion vector candidate list generated for each reference picture list or reference picture index for the current block.
  • the current block may perform motion compensation using one or more motion vector differences.
  • the skip mode usage information (cu_skip_flag) may indicate the use of the skip mode when the first value is 1, and may not indicate the use of the skip mode when the second value is 0. Based on whether the skip mode is used, motion compensation of the current block may be performed using the skip mode.
  • the merge mode use information may indicate the use of the merge mode when the first value is 1, and may not indicate the use of the merge mode when the second value has 0. Based on whether the merge mode is used, motion compensation of the current block may be performed using the merge mode.
  • the merge index information merge_index may mean information indicating a merge candidate in a merge candidate list.
  • the merge index information may mean information on a merge index.
  • the merge index information may indicate a block in which a merge candidate is derived among blocks reconstructed adjacent to the current block in a spatial / temporal manner.
  • the merge index information may indicate at least one or more of the motion information that the merge candidate has.
  • the merge index information may indicate the first merge candidate in the merge candidate list when the first index has 0, and when the merge index information has the first value 1, the merge index information may indicate the second merge candidate in the merge candidate list. If the third value is 2, the third merge candidate in the merge candidate list may be indicated.
  • the merge candidate corresponding to the value may be indicated according to the order in the merge candidate list.
  • N may mean a positive integer including 0.
  • the motion compensation of the current block may be performed using the merge mode.
  • a final prediction block for the current block may be generated through a weighted sum of each prediction block.
  • the weighting factor used for the weighted sum operation may include a reference picture list, a reference picture, a motion vector candidate index, motion vector difference, a motion vector, skip mode information, and a merge mode.
  • Entropy encoding / decoding may be performed as much as at least one of usage information, merge index information, or at least one number.
  • the weighting factor of each prediction block may be entropy encoded / decoded based on the inter prediction prediction indicator.
  • the weighting factor may include at least one of a weight and an offset.
  • Information on motion compensation may be entropy encoded / decoded in units of blocks or may be entropy encoded / decoded at a higher level.
  • the information on motion compensation may be entropy encoded / decoded in units of blocks such as a CTU, a CU, or a PU, a video parameter set, a sequence parameter set, a picture parameter set.
  • Entropy encoding / decoding may be performed at a higher level such as an adaptation parameter set or a slice header.
  • the information about the motion compensation may be entropy encoded / decoded based on the information difference value on the motion compensation indicating the difference value between the information on the motion compensation and the information prediction value on the motion compensation.
  • At least one of the information on the motion compensation may be derived based on at least one or more of coding parameters.
  • At least one or more pieces of information on the motion compensation may be entropy decoded from the bitstream based on at least one or more of encoding parameters. At least one or more pieces of information on the motion compensation may be entropy encoded into a bitstream based on at least one or more of encoding parameters.
  • the motion compensation information includes motion vector, motion vector candidate, motion vector candidate index, motion vector difference value, motion vector prediction value, skip mode usage information (skip_flag), merge mode usage information (merge_flag), merge index information (merge_index) ), Motion vector resolution information, overlapped block motion compensation information, local illumination compensation information, affine motion compensation information, decoder motion vector
  • the apparatus may further include at least one of decoder-side motion vector derivation information and bi-directional optical flow information.
  • the decoder motion vector derivation may mean pattern matched motion vector derivation.
  • the motion vector resolution information may be information indicating whether a specific resolution is used for at least one of a motion vector and a motion vector difference value.
  • the resolution may mean precision.
  • the specific resolutions are 16-pixel units, 8-pel units, 4-pixel units, integer-pel units, 1 / 2-pixel units. (1 / 2-pel) units, 1 / 4-pel (1 / 4-pel) units, 1 / 8-pixel (1 / 8-pel) units, 1 / 16-pixel (1 / 16-pel) units , At least one of 1 / 32-pixel (1 / 32-pel) units and 1 / 64-pixel (1 / 64-pel) units.
  • the overlapped block motion compensation information may be information indicating whether a weighted sum of the prediction blocks of the current block is further calculated by additionally using a motion vector of a neighboring block spatially adjacent to the current block block when motion compensation of the current block is performed.
  • the local lighting compensation information may be information indicating whether at least one of a weight value and an offset value is applied when generating the prediction block of the current block.
  • at least one of the weight value and the offset value may be a value calculated based on the reference block.
  • the affine motion compensation information may be information indicating whether to use an affine motion model when compensating for a current block.
  • the affine motion model may be a model that divides one block into a plurality of lower blocks using a plurality of parameters and calculates a motion vector of the divided lower blocks using representative motion vectors.
  • the decoder motion vector derivation information may be information indicating whether a decoder derives and uses a motion vector necessary for motion compensation.
  • the information about the motion vector may not be entropy encoded / decoded based on the decoder motion vector derivation information.
  • information on the merge mode may be entropy encoded / decoded. That is, the decoder motion vector derivation information may indicate whether the decoder uses the merge mode.
  • the bidirectional optical flow information may be information indicating whether motion compensation is performed by correcting a motion vector on a pixel basis or a lower block basis. Based on the bidirectional optical flow information, the motion vector of the pixel unit or the lower block unit may not be entropy encoded / decoded. Here, the motion vector correction may be to change the motion vector value of a block unit in a pixel unit or a lower block unit.
  • the current block may perform motion compensation by using at least one of information on motion compensation, and entropy encode / decode at least one of information on motion compensation.
  • the truncated rice binarization method When entropy coding / decoding information related to motion compensation, the truncated rice binarization method, the K-th order Exp_Golomb binarization method, the limited K-th order exp-Golomb A binarization method such as a binarization method, a fixed-length binarization method, a unary binarization method, or a truncated unary binarization method may be used.
  • the context model may be determined using at least one of region information, information on the depth of the current block, and information on the size of the current block.
  • Entropy encoding / decoding information on motion compensation information about motion compensation of neighboring blocks, information about motion compensation previously encoded / decoded, information about depth of current block, and size of current block
  • Entropy encoding / decoding may be performed using at least one of the information as a prediction value for the information on the motion compensation of the current block.
  • the motion information correction may mean correcting at least one of the motion information. That is, the information targeted for motion information correction may be at least one of information included in motion information such as a motion vector, a reference picture index, a reference picture, an inter prediction prediction indicator, a prediction list utilization flag, a weighting factor, and an offset. have.
  • the motion information correction may mean that one or more values of information included in the motion information, such as a motion vector, a reference picture index, a reference picture, an inter prediction prediction indicator, a prediction list utilization flag, a weight, and an offset, are corrected. .
  • the information that is a target of motion information correction may be at least one of information included in an encoding parameter.
  • motion information correction may mean that one or more values of information included in an encoding parameter are corrected.
  • the corrected motion information may be calculated.
  • the motion information corrected by the motion information correction method may be used for motion compensation (S504 in FIG. 5, S605 in FIG. 6, S703 in FIG. 7, and S804 in FIG. 8) of the encoding / decoding target block.
  • the motion information correction may be performed before performing the motion compensation step. That is, the motion information correction method may be performed before the motion compensation process of the encoding / decoding target block to calculate the corrected motion information, and the motion compensation process may be performed with the corrected motion information.
  • motion information correction may be performed in a step of determining a motion vector (S503 of FIG. 5 and S604 of FIG. 6).
  • motion information refinement may be applied to any one of a motion vector candidate included in the motion vector candidate list, a predicted motion vector, or a motion vector calculated by adding the predicted motion vector and the motion vector difference. .
  • motion information correction may be performed at the step of determining motion information (702 in FIG. 7 and S803 in FIG. 8).
  • motion information correction may be applied to any one of motion information determined in the merge candidate list based on the merge candidate or the merge candidate index included in the merge candidate list.
  • motion information correction may be performed.
  • the motion information correction may be applied to any one of the motion information determined in the skip candidate list based on the skip candidate included in the skip mode candidate list or the skip index. can do.
  • the motion information correction may be performed in the motion information compensation step (S504 in FIG. 5, S605 in FIG. 6, S703 in FIG. 7, and S804 in FIG. 8). That is, the motion information correction method may be performed in the motion compensation process of the encoding / decoding target block to calculate the corrected motion information, and the motion compensation process may be performed with the corrected motion information.
  • the encoder / decoder generates a prediction block based on the motion information determined in the motion vector determination step or the motion information determination step (S503 of FIG. 5, S604 of FIG. 6, S702 of FIG. 7, and S803 of FIG. 8).
  • the corrected motion information may be calculated by performing motion information correction using the generated prediction block.
  • the encoder / decoder may generate the final prediction block using the corrected motion information.
  • the motion information can be corrected according to the same rules in the encoder and the decoder. Since the encoder and the decoder correct the motion information according to the same rule, the information on the use of the motion information correction may or may not be entropy encoded / decoded.
  • bilateral template matching which is an embodiment of motion information correction, will be described with reference to FIGS. 13 to 15.
  • Both template matching is an embodiment of a correction method for a motion vector among the motion information.
  • Two-way template matching may be used to correct at least one or more of the two motion vectors for bidirectional prediction.
  • both templates may mean a prediction block calculated by weighting prediction blocks generated using two motion vectors in bidirectional prediction.
  • the bidirectional may mean both predictions.
  • the corrected motion vector may have a different motion vector value from the motion vector before correction.
  • FIG. 13 is a diagram for explaining bilateral template matching.
  • two-way template matching may include 1) generating a two-way template using an initial motion vector, and 2) correcting a motion vector by comparing the samples in the two-template with the reconstructed samples in the reference image. Can be.
  • the encoder / decoder may generate both templates by using prediction blocks generated through a first motion vector corresponding to reference picture list 0 and a second motion vector corresponding to reference picture list 1.
  • the encoder / decoder may generate both templates using prediction blocks generated through a first motion vector corresponding to reference picture list 0 and a second motion vector corresponding to reference picture list 0.
  • the encoder / decoder may generate both templates by using prediction blocks generated through a first motion vector corresponding to reference picture list 1 and a second motion vector corresponding to reference picture list 1.
  • both templates may be generated by weighting the prediction blocks, and a weight used for the weighted sum may be 0.5: 0.5.
  • the motion vector used for generating both templates may be referred to as an initial motion vector.
  • the initial motion vector may mean a motion vector calculated by at least one motion information derivation method such as a merge mode, an AMVP mode, a skip mode, and the like.
  • the encoder / decoder may correct each motion vector corresponding to each reference picture list by comparing values between samples in both templates and reconstructed samples in the reference picture.
  • a motion vector indicating a position representing both templates and a minimum distortion in the reference image of the reference image list 0 may be determined as the corrected first motion vector.
  • the motion vector indicating a position representing both templates and the minimum distortion in the reference image of the reference image list 1 may be determined as the corrected second motion vector.
  • the first motion The vector can be corrected.
  • the second motion vector Can be corrected.
  • the encoder / decoder compares the values of the samples in both templates with the reconstructed samples in the reference image, and includes sum of absolute difference (SAT), sum of absolute transformed difference (SATD), sum of squared error (SSE), and MSE.
  • SAT sum of absolute difference
  • SATD sum of absolute transformed difference
  • SSE sum of squared error
  • MSE MSE.
  • the motion vector indicating the reconstructed sample position in the reference image representing the minimum distortion by a method of calculating the inter-sample distortion such as Mean of Squared Error and Mean Removed SAD (MR-SAD) as a corrected motion vector You can decide.
  • the distortion may be calculated for at least one component of the luminance component and the chrominance component.
  • the two templates are matched to each other to perform the initial first motion vector and the initial second motion vector. Can be corrected.
  • the two template matching may not be performed.
  • the second prediction direction Motion information correction may not be performed on the initial second motion vector corresponding to (eg, L1 prediction direction).
  • bilateral template matching may be performed recursively.
  • the two-way template is matched with the generated second two-way template to correct the first motion vector and the corrected second motion template.
  • the second motion vector may be recalibrated.
  • the method of determining the recalibrated motion vector through bilateral template matching may be repeatedly performed up to M times.
  • M may be a positive integer (for example, may be 2)
  • M may be a fixed value pre-committed to the encoder / decoder, or may be a variable value encoded and signaled by the encoder.
  • M may be determined based on the size of the encoding / decoding target block.
  • M may be set to 2.
  • M may be set to 2.
  • M may be set to 4.
  • M may be set to 8.
  • two-way template matching may be performed four times on the first reference image (eg, L0 reference image), and four-way bidirectional template matching may be performed on the second reference image (eg, L1 reference image).
  • both template matching may be performed recursively in integer pixel units.
  • the corrected motion vector generated as a result of bilateral template matching may be used for motion compensation of the encoding / decoding target block by replacing the initial motion vector. Both template matching may be performed by the same rule in the encoder and the decoder.
  • the corrected motion vector may be searched within a limited area of the reference picture.
  • FIGS. 14 and 15 are diagrams for showing regions (hereinafter referred to as search regions) for searching for a motion vector corrected in bilateral template matching.
  • the search area may be defined in the range of -M to + N pixels in the horizontal / vertical direction in integer pixel units.
  • M and N may be a positive integer.
  • the search area may be determined in a sub-pel unit in a horizontal / vertical direction in the range of ⁇ O to + P.
  • O and P may be fractional values.
  • the subpixel unit may mean 1 / 2-pixel, 1 / 4-pixel, 1 / 8-pixel, 1 / 16-pixel, 1 / 32-pixel, or the like.
  • the O and P may have a positive integer value to represent the sub-pixel.
  • neighboring subpixels spatially adjacent to an integer pixel indicated by a motion vector in units of integer pixels may be a motion vector search target.
  • a subpixel unit represents an example of 1 / 2-pixel unit.
  • a search area of a subpixel unit may be limited to reduce memory access bandwidth.
  • the search area of a subpixel unit may be limited to be included in the search area of an integer pixel unit.
  • 15 is a diagram illustrating an example of restricting a search area of a subpixel unit to be included in a search area of an integer pixel unit.
  • a subpixel indicated by a hatch indicates a subpixel not included in a search area of an integer pixel unit, and the subpixel unit may be limited not to search for a corrected motion vector. That is, by restricting the search for the corrected motion vector only in subpixel units not indicated by hatching, it is possible to reduce the memory access bandwidth by not allowing additional pixels from the memory for generating the subpixels indicated by hatching. do.
  • the search area in integer units may include at least one of a center point, an upper point, a lower point, a left point, and a right point.
  • At least one point may be further searched based on the distortion values of the upper point, lower point, left point, and right point.
  • the at least one point may be at least one of an upper left point, a lower left point, an upper right point, and a lower right point.
  • a sub-pixel search area may be set in at least one of a center point, an upper point, a lower point, a left point, a right point, an upper left point, a lower left point, an upper right point, and a lower right point.
  • a search area of a subpixel unit may be set at a center point, an upper point, a lower point, a left point, and a right point.
  • the shape of the search area is expressed in two dimensions such as a square shape, a rectangular shape, a diamond / diamond shape, and a cross shape based on the pixel indicated by the initial motion vector. It may be in the form of a possible figure.
  • the form of the search region may be a fixed form pre-committed to the encoder / decoder, or the form of the search region may be specified by information encoded and signaled by the encoder.
  • the range of the motion vector value may be limited to at least one of the initial motion vector and the corrected motion vector so that the search region does not cross the boundary of the image beyond a predetermined range.
  • the range constraint of the motion vector value may be implemented by clipping.
  • the range of the motion vector value may be determined as a predetermined range in the encoder and the decoder.
  • the predetermined range may mean a threshold for limiting the motion vector value, and the threshold may be implemented as at least one of a minimum value and a maximum value.
  • the range of motion vector values may be a variable range encoded and signaled by the encoder.
  • At least one of the search area in the integer pixel unit and the search area in the subpixel unit may be limited so as not to cross the boundary of the image beyond a predetermined range.
  • the motion information correction in units of integer pixels may be allowed.
  • the motion vector may be improved on the decoder without transmitting additional syntax elements.
  • the bidirectional template matching may be applied in the case of the bidirectional predictive merge mode or the decoder motion vector derivation mode.
  • the bidirectional template matching may be performed when the current block does not correspond to at least one of the unidirectional prediction merge candidate, the local illumination compensation mode, the affine motion compensation mode, and the sub-CU merge mode.
  • the motion compensation mode may mean a prediction mode for deriving motion information used in inter prediction.
  • the motion compensation mode may be a kind of merge mode based on motion information correction using the above-described two-way template matching.
  • an area having no motion or a small motion in an image may be efficiently encoded.
  • the motion correction mode is a motion information derivation method based on the motion information correction described above, and the embodiments of the motion information correction described above may be applied to the motion correction mode.
  • whether the motion compensation mode is available or not may be determined based on information signaled through the bitstream.
  • the information may be signaled for at least one unit of a video, a sequence, a picture, a slice, a tile, an encoding tree unit, an encoding unit, a prediction unit, a transform unit, and a block.
  • Whether the motion compensation mode is available or applied may mean whether the motion compensation mode is available or applied to the corresponding unit.
  • the motion correction mode 1) deriving the motion information and 2) generating the corrected motion information by applying the motion information correction to the derived motion information.
  • the motion information correction may include the above-described bilateral template matching.
  • the motion information corrected in the motion compensation mode may be used for motion compensation of an encoding / decoding target block.
  • the motion information that is the target of the motion compensation mode may include at least one of a motion vector, a reference picture, an inter-screen indicator, a reference picture index, a prediction list utilization flag, a weight, and an offset.
  • the motion information may be derived from at least one of motion information of neighboring neighboring blocks in space, motion information of neighboring neighboring blocks in time, predefined motion information, or most of the motion information present in the reference image.
  • the derived motion information may be stored in the motion compensation mode list as a motion correction candidate.
  • the motion information derived from the motion information of the spatially adjacent neighboring blocks may be a spatial motion correction candidate, and the motion information derived from the motion information of the temporally adjacent neighboring blocks may be the temporal motion correction candidate.
  • a motion vector may be derived from at least one of a motion vector of a spatially adjacent neighboring block, a motion vector of a temporally adjacent neighboring block, a predefined motion vector, or a motion vector most present in a reference image. .
  • a motion vector may be derived from a motion vector of at least one or more blocks among spatially adjacent neighboring blocks.
  • the spatially adjacent neighboring blocks may include the neighboring blocks of FIG. 9 described above.
  • a motion vector may be derived from a motion vector of a block satisfying at least one or more of the following conditions among spatially adjacent neighboring blocks.
  • a block with a coding block flag of 0 (eg, a block in which no residual signal exists)
  • a motion vector may be derived from at least one or more motion vectors among the spatial skip / merge candidates.
  • the spatially adjacent It can be derived by scaling the motion vector derived from the motion vector of the neighboring block.
  • a motion vector may be derived from a motion vector of at least one or more blocks among temporally adjacent neighboring blocks.
  • the temporally adjacent neighboring blocks may include a corresponding position block in the reference image and a corresponding position block in the corresponding position image.
  • the corresponding position block in the reference image may be at least one of the following blocks.
  • the corresponding location block in the corresponding location image may be at least one of the following blocks.
  • a motion vector may be derived from a motion vector of a block satisfying at least one of the following conditions among temporally adjacent neighboring blocks.
  • a block having a coding block flag of 0 among blocks inside / outside the corresponding position block eg, a block in which no residual signal exists
  • a block whose prediction indicator between screens among the blocks inside / outside the corresponding position block corresponds to any one of PRED_BI, PRED_TRI, or PRED_QUAD.
  • a motion vector may be derived from at least one or more motion vectors among temporal skip / merge candidates.
  • the motion vector derived from the motion vectors of the temporally adjacent neighboring blocks can be scaled and derived.
  • the reference image index indicating the corresponding position image and the reference image including temporally adjacent neighboring blocks may be derived from the reference image index of the spatially adjacent neighboring blocks.
  • a (0, 0) motion vector (zero vector) can be derived as a motion vector.
  • the motion vector most derived from the reference image can be derived.
  • the motion vectors may be arranged in the order of being most present in the reference image, and up to L motion vectors may be derived in the sorted order.
  • L may be a positive integer.
  • L may be a fixed value pre-committed to the encoder / decoder, or may be a variable value encoded and signaled by the encoder.
  • the motion vectors may be derived from the motion vectors in the above-described order (A-> B-> C-> D). In this case, it can be derived until a maximum of M motion vectors are derived.
  • the motion vectors may be derived in the above-described order, and when the derived motion vectors exist, the derivation of the motion vectors may be stopped, and up to M motion vectors may be used as the motion vectors in the motion compensation mode.
  • M may be a positive integer
  • M may be a fixed value pre-committed to the encoder / decoder, or may be a variable value encoded and signaled by the encoder.
  • the bidirectional predictive motion vector may be first derived and inserted into the motion correction mode list, and then the unidirectional predictive motion vector may be derived and inserted into the motion correction mode list.
  • the motion vector derivation order in the above-described motion compensation mode may be set as follows.
  • the motion vectors of spatially adjacent neighboring blocks, temporally neighboring neighboring motion vectors, and (0, 0) motion vectors may be derived in order.
  • a motion vector may be derived in order of a motion vector of a temporally adjacent neighboring block, a motion vector of a spatially adjacent neighboring block, and a (0, 0) motion vector.
  • the motion vectors of the spatially adjacent neighboring blocks may derive the motion vectors in the order of derivation of the spatial skip / merge candidate, and the motion vectors of the temporally adjacent neighboring blocks derive the motion vectors in the order of derivation of the temporal skip / merge candidate. can do.
  • the motion compensation mode it can be used only when the motion vector derived by the above-described method does not have a (0, 0) value.
  • the motion vector when bidirectional prediction is used in the motion compensation mode, when the derived first and second motion vectors do not have a value of (0, 0), the motion vector may be used as the motion vector of the motion compensation mode.
  • N direction prediction N is an integer of 2 or more
  • the motion vector may be used as the motion vector of the motion compensation mode.
  • N is an integer of 2 or more
  • the motion vector may be used as a motion vector in the motion compensation mode.
  • bidirectional prediction when one or both of the derived first and second motion vectors are not equal to each other, one or both of the derived first and second motion vectors are moved. It can also be used as a motion vector in correction mode.
  • the motion vector derived as the motion vector in the motion compensation mode may be used only when the inter-prediction indicator of the spatially adjacent neighboring block or the temporally adjacent neighboring block is at least one of two-way prediction, three-direction prediction, and four-direction prediction. Can be. That is, when the inter-prediction indicator of the spatially adjacent neighboring blocks or the temporally adjacent neighboring blocks is not unidirectional prediction, the derived motion vector may be used as the motion vector of the motion compensation mode.
  • the inter prediction prediction indicator of the spatially adjacent neighboring block or the temporally adjacent neighboring block is unidirectional prediction
  • the inter prediction prediction indicator is changed to bidirectional prediction, and the sign of the motion vector for the unidirectional prediction is reversed.
  • a motion vector for unidirectional prediction opposite to the prediction direction corresponding to the unidirectional prediction may be derived and used as a motion vector in the motion compensation mode.
  • the inter prediction prediction indicator of spatially adjacent neighboring blocks or temporally adjacent neighboring blocks indicates L0 unidirectional prediction
  • the motion vector is (-4, 6)
  • the inter prediction prediction indicator is changed to bidirectional prediction.
  • the motion vector for the L1 direction prediction can be derived as (4, -6), and two motion vectors can be used as the motion vector in the motion compensation mode.
  • the reference image for the L1 unidirectional prediction may be determined to be equal to or proportional to the distance between the reference image for the L0 unidirectional prediction and the current image.
  • N is an integer of 2 or more
  • a motion vector based on the derived motion vectors is generated to derive N motion vectors.
  • the motion vector may be generated by scaling the previously derived motion vector based on the POC of the current image and / or the reference image.
  • the first motion vector is scaled based on the reference image in the reference image list 1 to generate a second motion vector.
  • the first motion vector and the generated second motion vector may be used as a motion vector of the motion compensation mode.
  • the second motion vector is scaled based on a reference picture in reference picture list 0 to generate a first motion vector
  • the second motion vector and the generated first motion vector may be used as the motion vector of the motion compensation mode.
  • the reference image may be derived using at least one of the following methods.
  • a reference picture having a reference picture index of 0 among the reference pictures included in the reference picture list 0 and the reference picture list 1 may be derived as the reference picture in the motion compensation mode. If reference pictures having a reference picture index of 0 among the reference pictures included in the reference picture list 0 and the reference picture list 1 are the same as each other, the reference picture index in the reference picture list 0 among the reference pictures included in the reference picture list 1 A reference picture that is not the same as the zero reference picture may be derived to the reference picture in the motion compensation mode.
  • reference picture index in the reference picture list 1 among the reference pictures included in the reference picture list 0 A reference picture that is not the same as the zero reference picture may be derived to the reference picture in the motion compensation mode.
  • the reference picture index 0 may be used to derive the reference picture in the motion compensation mode.
  • the present invention is not limited thereto, and a reference image of a motion compensation mode may be derived by using a reference image index other than zero.
  • a method of deriving a reference image in the motion compensation mode using a non-zero reference image index is as follows.
  • the reference image index may be determined based on a median value of a reference image index having at least one of the spatially adjacent A1, B1, B0, A0, and B2 positions of the encoding / decoding target block. have. here. Instead of the median, various statistical values such as minimum, maximum, average, weighted average, mode, etc. may be used.
  • a reference picture indicated by the determined reference picture index may be derived as a reference picture in the motion compensation mode. In this case, a reference picture index may be determined for each reference picture list by using the method.
  • the reference image index may be determined using the reference image index held at the A1 position.
  • the reference picture may be determined using the reference picture index held at the B1 location.
  • the reference image may be determined using a reference image index having the B0 position.
  • the reference image may be determined using the reference image index held at the A0 position.
  • the reference picture may be determined by using the reference picture index of the B2 location.
  • the corrected reference image may be calculated by applying motion information correction to the reference image derived by the above-described method, and the corrected reference image may be used as the reference image in the motion correction mode.
  • N may be an integer greater than or equal to 2
  • the derivation of the reference pictures based on the sameness determination of the reference pictures may be performed.
  • N different reference images may be derived.
  • the difference value between the encoding / decoding target picture and the picture order count is the smallest and / or the smallest temporal.
  • a reference picture having a layer identifier value may be derived as a reference picture in the motion compensation mode.
  • a reference image of spatially adjacent neighboring blocks may be derived as a reference image in a motion compensation mode.
  • a reference image of a temporally adjacent neighboring block may be derived as a reference image in a motion compensation mode.
  • At least one reference image of the skip / merge candidates may be derived as the reference image in the motion compensation mode.
  • the reference image with minimum distortion may be derived as the reference image in the motion correction mode.
  • the inter prediction prediction indicator may be derived using at least one of the following methods.
  • the inter prediction prediction indicator may be fixedly used as one prediction among unidirectional prediction, bidirectional prediction, three direction prediction, four direction prediction, and N direction prediction.
  • the inter prediction prediction indicators of spatially adjacent neighboring blocks may be derived as the inter prediction prediction indicator in the motion compensation mode.
  • the inter prediction prediction indicators of temporally adjacent neighboring blocks may be derived as the inter prediction prediction indicator in the motion compensation mode.
  • At least one inter-screen prediction indicator among skip / merge candidates may be derived as an inter-screen prediction indicator in the motion compensation mode.
  • the inter prediction prediction indicator may be derived as the inter prediction prediction indicator in the motion compensation mode according to the available reference pictures among the reference pictures derived by the above-described method.
  • inter prediction prediction indicators may be derived by unidirectional prediction.
  • inter prediction may be derived by bidirectional prediction.
  • the corrected inter prediction prediction indicator may be calculated using the motion information correction method, and the corrected inter prediction prediction indicator may be used as the inter prediction prediction indicator in a motion correction mode.
  • the encoder / decoder may apply the motion information correction to the motion information derived by the above-described method, calculate the corrected motion information, and use the corrected motion information as the motion information in the motion correction mode.
  • motion compensation may be performed by generating a prediction block using at least one of a corrected motion vector, a corrected reference image, and a corrected inter prediction prediction indicator.
  • a motion information correction method is performed on at least one of information included in motion information such as a derived reference picture index, a prediction list utilization flag, a weighting factor, and an offset, thereby correcting the corrected reference picture index and the corrected prediction list.
  • Motion compensation may be performed by generating a prediction block using at least one of a utilization flag, a corrected weight, and a corrected offset.
  • the motion information correction method may include the matching of both templates.
  • the motion compensation may be performed by generating a final prediction block by calculating a weighted sum based on an image order count between the encoding / decoding target image and each reference image.
  • the derived motion vector when motion information correction is applied to the derived motion vector, the derived motion vector may be used to determine the initial motion search position. A corrected motion vector may be determined based on the initial motion search position.
  • the encoder / decoder may perform motion information correction on up to M derived motion information.
  • M may be a fixed value pre-committed to the encoder / decoder, or may be a variable value encoded and signaled by the encoder.
  • the first motion information, the second motion information,... At least one of the N-th motion information may be corrected.
  • N may be an integer of 4 or more.
  • motion information correction may be applied to all or part of the derived motion information, and may be used as the motion information in the motion correction mode.
  • motion compensation may be performed by generating a prediction block by using at least one of the derived motion vector, the derived reference image, and the derived inter prediction prediction indicator.
  • motion information correction e.g, template matching
  • motion information correction e.g. template matching
  • the motion information correction may be performed when the current block does not correspond to any one of the one-way prediction merge candidate, the local illumination compensation mode, the affine motion compensation mode, and the sub-CU merge mode.
  • the motion information correction includes a difference value (POC ref0 -POC curr ) and a second prediction direction (eg, a difference between the first reference video corresponding to the first prediction direction (eg, the L0 prediction direction) and the encoding / decoding target video sequence counter).
  • a difference value POC ref0 -POC curr
  • a second prediction direction eg, a difference between the first reference video corresponding to the first prediction direction (eg, the L0 prediction direction) and the encoding / decoding target video sequence counter.
  • motion information correction may be performed when the first prediction direction and the second prediction direction are different from each other.
  • the encoder / decoder may perform bilateral template matching on at least one or more of the motion information derived by the above-described method, and perform motion compensation by generating a prediction block using one motion information having a minimum distortion.
  • one piece of motion information may include at least one of L0 motion information and L1 motion information.
  • the encoder / decoder performs bilateral template matching on at least one candidate present in a skip candidate list or a merge candidate list, and generates a prediction block using one candidate having a minimum distortion to perform motion compensation. Can be.
  • the encoder / decoder performs bilateral template matching on at least one or more of the motion information derived by the above-described method, and weights M prediction blocks generated by using M motion information having the least distortion. The sum may be calculated and used as a prediction block of a block to be encoded / decoded.
  • M may be a positive integer, may be two or more.
  • the encoder / decoder performs bilateral template matching on at least one or more candidates present in the skip candidate list or the merge candidate list, and weights the M prediction blocks generated using the M candidates having the least distortion. May be calculated and used as a prediction block of the encoding / decoding target block.
  • M may be a positive integer, may be two or more.
  • the encoder / decoder entropy encodes / decodes a skip index or a merge index for a unidirectional prediction candidate in a skip candidate list or a merge candidate list, but uses at least bidirectional template matching for M or more bidirectional prediction candidates to have at least distortion.
  • Motion compensation may be performed by generating a prediction block using one candidate.
  • one flag or one index may be entropy encoded / decoded to indicate M or more bidirectional prediction candidates. That is, a skip index or a merge index may be allocated to each unidirectional prediction candidate, and one skip index or merge index may be allocated to M or more bidirectional prediction candidates. Since at least one candidate representing the minimum distortion may be determined for M or more bidirectional prediction candidates by using both template matching, a skip index or a merge index for each bidirectional prediction candidate may not be allocated.
  • the motion compensation mode may be used according to the motion compensation mode usage information.
  • the motion correction mode usage information may be entropy encoded / decoded into at least one of flag information and index (index) information.
  • the encoding / decoding of the motion correction mode usage information may be performed based on the value of the skip flag.
  • the encoding / decoding time point of the motion correction mode usage information may be determined based on the encoding / decoding time point of the skip flag.
  • the motion correction mode usage information may be entropy encoded / decoded when the skip flag is 1 (when the skip mode is used). In this case, the motion correction mode usage information may be entropy encoded / decoded after the skip flag.
  • the encoding / decoding of the skip flag may be performed based on the value of the motion correction mode usage information. For example, when the motion correction mode usage information is 1 (when the motion correction mode is used), the skip flag may be entropy encoded / decoded. In this case, the motion correction mode usage information may be entropy encoded / decoded before the skip flag.
  • encoding / decoding of the motion correction mode usage information may be performed based on the value of the merge flag.
  • the encoding / decoding time point of the motion correction mode usage information may be determined based on the encoding / decoding time point of the merge flag.
  • the motion correction mode usage information may be entropy encoded / decoded when the merge flag is 1 (when using the merge mode). In this case, the motion correction mode usage information may be entropy encoded / decoded after the merge flag.
  • the encoding / decoding of the merge flag may be performed based on the value of the motion correction mode usage information. For example, when the motion correction mode usage information is 1 (when the motion correction mode is used), the merge flag may be entropy encoded / decoded. In this case, the motion correction mode usage information may be entropy encoded / decoded before the merge flag.
  • the encoding / decoding of the motion compensation mode usage information may be performed based on a specific motion compensation mode.
  • the motion correction mode usage information may be entropy encoded / decoded when not using the affine motion compensation mode.
  • the encoding / decoding of the decoder motion vector derivation mode flag may be performed based on the value of the motion correction mode usage information. For example, when the motion correction mode use information is 0 (when the motion correction mode is not used), the decoder motion vector derivation mode flag may be entropy encoded / decoded.
  • the motion correction mode usage information may be encoded / decoded based on the motion correction mode usage information of one or more neighboring blocks of the encoding / decoding target block.
  • one or more neighboring blocks may include one or more spatially adjacent blocks and / or one or more blocks that are temporally adjacent.
  • the spatially adjacent one or more blocks may include blocks adjacent to the left and / or blocks adjacent to the top.
  • the motion correction mode usage information when the motion correction mode usage information is not signaled, the motion correction mode usage information may be derived based on the motion correction mode usage information of one or more neighboring blocks of the encoding / decoding target block.
  • the one or more peripheral blocks may include one or more blocks that are spatially adjacent and / or one or more blocks that are temporally adjacent.
  • the spatially adjacent one or more blocks may include blocks adjacent to the left and / or blocks adjacent to the top.
  • the motion correction mode usage information may be entropy encoded / decoded when at least one of the blocks spatially adjacent to the encoding / decoding target block uses the skip mode.
  • the motion correction mode usage information may be entropy encoded / decoded when at least one of the blocks spatially adjacent to the encoding / decoding target block uses the merge mode.
  • the motion correction mode usage information may be entropy encoded / decoded when at least one of the blocks spatially adjacent to the encoding / decoding target block is an inter-screen mode.
  • the motion correction mode usage information may be entropy encoded / decoded in a bypass mode.
  • the residual signal may not be entropy encoded / decoded.
  • the residual signal may be entropy encoded / decoded.
  • a part of the residual signal may be entropy encoded / decoded.
  • a part of the residual signal may be a DC quantization level (DC transform coefficient).
  • information other than the motion correction mode usage information may not be entropy encoded / decoded.
  • the other information may be at least one of the information about the motion compensation.
  • the motion correction candidate may refer to motion information including at least one of a motion vector derived through a motion compensation mode, a derived reference image, and an induced inter prediction prediction indicator.
  • the encoder / decoder may add a motion correction candidate to a skip candidate list or a merge candidate list as a skip candidate or a merge candidate in a skip mode or a merge mode, respectively.
  • An embodiment in which a motion correction candidate is added to a skip / merge candidate list is as follows.
  • the motion correction candidate may not be added to the skip / merge candidate list.
  • the skip / merge candidate may not be added to the skip / merge candidate list.
  • the motion correction candidate may be derived before the spatial skip / merge candidate and added to the skip / merge candidate list.
  • the motion correction candidate may be derived before the spatial skip / merge candidate derived at a specific position and added to the skip / merge candidate list.
  • the specific position may be at least one of A1, B1, B0, A0, and B2 positions of FIG. 10.
  • the motion correction candidate may be derived before at least one of a temporal skip / merge candidate, a combined merge candidate, and a merge candidate having a predetermined motion information value and added to the skip / merge candidate list.
  • the encoder / decoder may determine motion information including at least one of a motion vector corrected through the motion information correction in the motion correction mode, a corrected reference image, and a corrected inter prediction prediction indicator as a motion correction candidate.
  • the motion correction candidate may be added to the skip candidate list or the merge candidate list as the skip candidate or the merge candidate in the skip mode or the merge mode, respectively.
  • the motion compensation mode may be used instead of the skip mode. That is, the video may be encoded / decoded by replacing the skip mode with the motion compensation mode.
  • the motion compensation mode may be used instead of the merge mode. That is, the image may be encoded / decoded by replacing the merge mode with the motion compensation mode.
  • At least one of a block motion compensation mode, a local illumination compensation mode, and a bidirectional optical flow mode superimposed on the final predicted block generated using the motion compensation mode may be applied.
  • the motion information correction method may be applied to only one or part of the motion information without generating a list of motion information candidates.
  • MRM motion information refinement in the motion-refined mode
  • the motion information correction may be determined based on the image order count (POC) of the reference image of the motion vector.
  • POC image order count
  • the motion information correction method includes a motion vector indicating a reference image having an image sequence count smaller than the target image to be encoded / decoded based on the image sequence count and an image sequence count larger than the target image to be encoded / decoded based on the image sequence count. This operation may be performed when all of the motion vectors indicating the reference image having a P are present.
  • the motion information correction method may be performed when two motion vectors indicating reference images having an image order count smaller than the encoding / decoding target image are present based on the image order count.
  • the motion information correction method may be performed when two motion vectors indicating reference images having an image order count larger than the encoding / decoding target image based on the image order count exist.
  • the motion information correction may be performed on the encoding / decoding target block when at least one of the affine motion compensation mode, the decoder motion vector derivation mode, and the local illumination compensation mode is not used.
  • the motion information correction includes a difference value between an image sequence count of an encoding / decoding target image and an image sequence count of the first reference image or a difference value between an image sequence count of the encoding / decoding target image and an image sequence count of the second reference image.
  • N may be less than 0).
  • the first reference picture may mean a reference picture indicated by the first motion vector
  • the second reference picture may mean a reference picture indicated by the second motion vector.
  • the motion information correction may be determined based on the first motion vector and the second motion vector as targets of the motion information correction.
  • motion information correction may not be performed. That is, motion information correction may be performed only when the first motion information and the second motion information are different from each other, and / or the reference images indicated by the motion information are different.
  • motion information correction may not be performed when the first motion vector is the same as the second motion vector. That is, motion information correction may be performed only when the first motion vector and the second motion vector are different from each other.
  • the motion information correction method may be performed only when the reference picture indicated by the first motion vector and the reference picture indicated by the second motion vector are the same. Conversely, motion information correction may be performed only when the reference picture indicated by the first motion vector and the reference picture indicated by the second motion vector are different from each other.
  • motion information correction may be performed on a motion vector whose value is not (0, 0).
  • the inter prediction prediction indicator is bidirectional and both the first motion vector and the first motion vector do not have a value of (0, 0)
  • motion information correction may be performed.
  • the inter prediction prediction indicator is in the N direction (N is an integer of 2 or more)
  • motion information correction may be performed when all N motion vectors or a predetermined number or more do not have a value of (0, 0). .
  • the motion information correction may be performed only when the inter prediction prediction indicator has a certain number of directions. For example, motion information correction may be performed only when the inter prediction prediction indicator of the skip / merge candidate is bidirectional.
  • the motion information correction may be performed only when the reference picture index of the reference picture indicated by the first motion vector is zero and the reference picture index of the reference picture indicated by the second motion vector is zero. Alternatively, the motion information correction may be performed only when the reference picture index of the reference picture indicated by each motion vector is a specific value.
  • the motion information correction may be performed only on at least one of a spatial skip / merge candidate, a temporal skip / merge candidate, a combined skip / merge candidate, and a skip / merge candidate having a predetermined motion information value.
  • the motion information correction may be performed by dividing the encoding / decoding target block into subblocks and then by subblocks.
  • motion information correction may be performed in a divided sub-block unit to improve encoding efficiency.
  • the subblocks of the encoding / decoding target block may have different motion information or motion vectors, and all of them may have the same motion information or motion vectors.
  • motion information correction may be performed only when the subblocks of the encoding / decoding target block have different motion information or motion vectors.
  • motion information correction may not be performed on motion information or motion vector units in sub-block units to reduce computational complexity.
  • motion information correction may be performed only when the subblocks of the encoding / decoding target block all have the same motion information or motion vectors in order to reduce computational complexity.
  • the motion information correction method may be performed in at least one unit of a sample unit and a block unit.
  • N direction prediction such as 3 direction prediction and 4 direction prediction
  • motion information correction is performed by calculating a template using N motion vectors such as 3 motion vectors and 4 motion vectors, respectively. can do.
  • N may be a positive integer of 3 or more.
  • new motion information may be generated by scaling the derived motion information.
  • scaling is performed based on the corresponding first motion information or the first motion vector and the second motion information.
  • motion information correction may be performed by generating a second motion vector.
  • scaling is performed based on the second motion information or the second motion vector and thus the first motion information or The motion information correction may be performed by generating the first motion vector.
  • the corrected motion vector candidate is scaled by scaling the initial motion vector based on the image order count value of each reference image. Can be calculated.
  • the corrected motion vector candidate refers to a motion vector indicating a region for searching for the corrected motion vector, and compares the distortion values at positions indicated by the other corrected motion vector candidate and the initial motion vector to compare the two templates. Can be done.
  • the corrected motion vector may be calculated using motion information correction for at least one of one luminance component motion vector and two chrominance component motion vectors.
  • a reference image with minimum distortion may be induced into the corrected reference image.
  • the above-described condition under which motion information correction is performed may also be applied to motion information correction in a decoder-side motion vector derivation mode.
  • 16 is a flowchart illustrating an image decoding method according to an embodiment of the present invention.
  • the decoder may derive a motion correction candidate from at least one of motion information of a spatial neighboring block, motion information of a temporal neighboring block, predefined motion information, and most of the motion information present in the reference image ( S1601).
  • the motion correction candidate may be derived from at least one of the motion information of the spatial neighboring block, the motion information of the temporal neighboring block, the predefined motion information, and the most existing motion information in the reference image according to a predetermined order.
  • the predetermined order may be the motion information of the spatial neighboring block, the motion information of the temporal neighboring block, and the predefined motion information order.
  • the predefined motion information may include a zero vector.
  • the temporal neighboring block may be included in the reference image selected based on the reference image index of the spatial neighboring block.
  • motion information correction may be performed on the induced motion correction candidate.
  • the motion information correction may be corrected by applying both template matching to the motion vector included in the derived motion correction candidate.
  • bilateral template matching may include generating a bilateral template using a motion vector included in the derived motion correction candidate as an initial motion vector, and reconstructing a reference image indicated by the samples in the bilateral template and the initial motion vector. Comparing the samples, and correcting the initial motion vector.
  • the step of correcting the initial motion vector may be performed recursively.
  • the initial motion vector may be a bidirectional predictive motion vector other than a zero vector among the derived motion correction candidates.
  • the initial motion vector may be set to zero vector.
  • the correcting of the initial motion vector includes searching for a motion vector indicating a region in the reference image representing both templates and the minimum distortion, and setting the searched motion vector as a correction value of the initial motion vector. can do.
  • the searching of the motion vector may be searched in the limited search area in the reference image.
  • the limited search region may be set to a predetermined range in integer pixel units, and the searching for the motion vector may search for the motion vector in subpixel units within a predetermined range in integer pixel units.
  • both template matching may be performed in integer pixel units and subpixel units.
  • searching for a motion vector may search for a motion vector in subpixel units within a predetermined range of integer pixel units.
  • performing motion information correction on the derived motion correction candidate may be performed when the block does not correspond to the one-way prediction merge candidate, the local illumination compensation mode, and the affine motion compensation mode.
  • a prediction block of the current block may be generated using the motion correction candidate on which motion information correction is performed.
  • the video decoding method may further include decoding the motion correction mode usage information before step S1601 and determining the motion correction mode based on the decoded motion correction mode usage information. Based on the determination result, when the current block is in the motion compensation mode, step S1601 may be performed.
  • whether to decode the motion correction mode usage information may be determined based on a skip flag or a merge flag.
  • deriving the motion correction candidate first derives the motion information from the spatial neighboring block having a bidirectional predictive motion vector, and then motion information from the spatial neighboring block having a unidirectional predictive motion vector Can be derived.
  • the order of applying the embodiment may be different in the encoder and the decoder, and the order of applying the embodiment may be the same in the encoder and the decoder.
  • the above embodiment may be performed with respect to each of the luminance and chrominance signals, and the same embodiment may be performed with respect to the luminance and the chrominance signals.
  • the shape of the block to which the embodiments of the present invention are applied may have a square shape or a non-square shape.
  • the above embodiments of the present invention may be applied according to at least one of a coding block, a prediction block, a transform block, a block, a current block, a coding unit, a prediction unit, a transform unit, a unit, and a current unit.
  • the size here may be defined as a minimum size and / or a maximum size for the above embodiments to be applied, or may be defined as a fixed size to which the above embodiments are applied.
  • the first embodiment may be applied at the first size
  • the second embodiment may be applied at the second size. That is, the embodiments may be applied in combination according to the size.
  • the above embodiments of the present invention may be applied only when the minimum size or more and the maximum size or less. That is, the above embodiments may be applied only when the block size is included in a certain range.
  • the above embodiments may be applied only when the size of the current block is 8x8 or more.
  • the above embodiments may be applied only when the size of the current block is 4x4.
  • the above embodiments may be applied only when the size of the current block is 16x16 or less.
  • the above embodiments may be applied only when the size of the current block is 16x16 or more and 64x64 or less.
  • the above embodiments of the present invention can be applied according to a temporal layer.
  • a separate identifier is signaled to identify the temporal layer to which the embodiments are applicable and the embodiments can be applied to the temporal layer specified by the identifier.
  • the identifier here may be defined as the lowest layer and / or the highest layer to which the embodiment is applicable, or may be defined as indicating a specific layer to which the embodiment is applied.
  • a fixed temporal layer to which the above embodiment is applied may be defined.
  • the above embodiments may be applied only when the temporal layer of the current image is the lowest layer.
  • the above embodiments may be applied only when the temporal layer identifier of the current image is one or more.
  • the above embodiments may be applied only when the temporal layer of the current image is the highest layer.
  • a slice type to which the above embodiments of the present invention are applied is defined, and the above embodiments of the present invention may be applied according to the corresponding slice type.
  • the motion vectors are 16-pel units, 8-pel units, 4-pixel units, integer-pel units, 1 / 2-pixel units / 2-pel), 1 / 4-pel (1 / 4-pel) units, 1 / 8-pixel (1 / 8-pel) units, 1 / 16-pixel (1 / 16-pel) units, 1
  • the above embodiments of the present invention may also be applied when the device has at least one of / 32-pel units and 1 / 64-pixel units.
  • a motion vector may be selectively used for each pixel unit.
  • the methods are described based on a flowchart as a series of steps or units, but the present invention is not limited to the order of steps, and certain steps may occur in a different order or simultaneously from other steps as described above. Can be. Also, one of ordinary skill in the art appreciates that the steps shown in the flowcharts are not exclusive, that other steps may be included, or that one or more steps in the flowcharts may be deleted without affecting the scope of the present invention. I can understand.
  • Embodiments according to the present invention described above may be implemented in the form of program instructions that may be executed by various computer components, and may be recorded in a computer-readable recording medium.
  • the computer-readable recording medium may include program instructions, data files, data structures, etc. alone or in combination.
  • Program instructions recorded on the computer-readable recording medium may be those specially designed and configured for the present invention, or may be known and available to those skilled in the computer software arts.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs, DVDs, and magneto-optical media such as floptical disks. media), and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.
  • Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like.
  • the hardware device may be configured to operate as one or more software modules to perform the process according to the invention, and vice versa.
  • the present invention can be used in an apparatus for encoding / decoding an image.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)
  • Television Signal Processing For Recording (AREA)
PCT/KR2018/006401 2017-06-09 2018-06-05 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 Ceased WO2018226015A1 (ko)

Priority Applications (8)

Application Number Priority Date Filing Date Title
US16/620,545 US11616976B2 (en) 2017-06-09 2018-06-05 Video encoding/decoding method and device, and recording medium storing bit stream
EP24153593.9A EP4351139A3 (en) 2017-06-09 2018-06-05 Video encoding/decoding method and device, and recording medium storing bit stream
CN201880038074.0A CN110771169A (zh) 2017-06-09 2018-06-05 视频编码/解码方法和装置以及存储比特流的记录介质
EP18814404.2A EP3637772A4 (en) 2017-06-09 2018-06-05 VIDEO CODING / DECODING PROCESS AND DEVICE, AND RECORDING MEDIA STORING A BINARY STREAM
JP2019568020A JP2020522960A (ja) 2017-06-09 2018-06-05 画像符号化／復号化方法、装置、及びビットストリームを保存した記録媒体
JP2022184252A JP7731581B2 (ja) 2017-06-09 2022-11-17 画像符号化／復号化方法、装置、及びビットストリームを保存した記録媒体
US18/103,570 US12075087B2 (en) 2017-06-09 2023-01-31 Video encoding/decoding method and device, and recording medium storing bit stream
US18/734,611 US20240323431A1 (en) 2017-06-09 2024-06-05 Video encoding/decoding method and device, and recording medium storing bit stream

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20170072292 2017-06-09
KR10-2017-0072292 2017-06-09
KR20170092607 2017-07-21
KR10-2017-0092607 2017-07-21

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US16/620,545 A-371-Of-International US11616976B2 (en) 2017-06-09 2018-06-05 Video encoding/decoding method and device, and recording medium storing bit stream
US18/103,570 Continuation US12075087B2 (en) 2017-06-09 2023-01-31 Video encoding/decoding method and device, and recording medium storing bit stream

Publications (1)

Publication Number Publication Date
WO2018226015A1 true WO2018226015A1 (ko) 2018-12-13

Family

ID=64566774

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/006401 Ceased WO2018226015A1 (ko) 2017-06-09 2018-06-05 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체

Country Status (6)

Country Link
US (3) US11616976B2 (enExample)
EP (2) EP4351139A3 (enExample)
JP (2) JP2020522960A (enExample)
KR (3) KR102438181B1 (enExample)
CN (1) CN110771169A (enExample)
WO (1) WO2018226015A1 (enExample)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113455001A (zh) * 2018-12-27 2021-09-28 英迪股份有限公司 视频编码/解码方法和装置
CN113574868A (zh) * 2019-03-08 2021-10-29 韩国电子通信研究院 图像编码/解码方法和设备以及存储比特流的记录介质
CN113597760A (zh) * 2019-01-02 2021-11-02 北京字节跳动网络技术有限公司 视频处理的方法
CN113841408A (zh) * 2019-05-17 2021-12-24 北京字节跳动网络技术有限公司 用于视频处理的运动信息确定和存储
CN114080808A (zh) * 2019-07-06 2022-02-22 北京达佳互联信息技术有限公司 用于视频编解码中的解码器侧运动矢量细化的方法和装置
CN114128290A (zh) * 2019-07-08 2022-03-01 现代自动车株式会社 用于利用帧间预测来编码和解码视频的方法和装置
CN115002483A (zh) * 2019-01-17 2022-09-02 腾讯美国有限责任公司 视频编解码方法及装置
US12200200B2 (en) 2019-01-18 2025-01-14 Wilus Institute Of Standards And Technology Inc. Video signal processing method and device using motion compensation
US12348759B2 (en) 2018-05-31 2025-07-01 Beijing Bytedance Network Technology Co., Ltd. Concept of interweaved prediction

Families Citing this family (56)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2019017066A (ja) * 2017-07-03 2019-01-31 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカＰａｎａｓｏｎｉｃ Ｉｎｔｅｌｌｅｃｔｕａｌ Ｐｒｏｐｅｒｔｙ Ｃｏｒｐｏｒａｔｉｏｎ ｏｆ Ａｍｅｒｉｃａ 符号化装置、復号装置、符号化方法及び復号方法
WO2019147067A1 (ko) * 2018-01-26 2019-08-01 한국전자통신연구원 시간적 움직임 정보를 이용하는 영상 부호화 및 영상 복호화를 위한 방법 및 장치
CN111919448A (zh) * 2018-01-26 2020-11-10 韩国电子通信研究院 用于使用时间运动信息的图像编码和图像解码的方法和设备
CN111869214B (zh) * 2018-03-19 2024-11-29 高通股份有限公司 对高级时间运动矢量预测的改进
WO2019234598A1 (en) 2018-06-05 2019-12-12 Beijing Bytedance Network Technology Co., Ltd. Interaction between ibc and stmvp
WO2019244118A1 (en) 2018-06-21 2019-12-26 Beijing Bytedance Network Technology Co., Ltd. Component-dependent sub-block dividing
WO2020005719A1 (en) * 2018-06-27 2020-01-02 Vid Scale, Inc. Methods and apparatus for reducing the coding latency of decoder-side motion refinement
KR102576194B1 (ko) * 2018-06-27 2023-09-08 엘지전자 주식회사 인터 예측 모드 기반 영상 처리 방법 및 이를 위한 장치
TWI728388B (zh) 2018-06-29 2021-05-21 大陸商北京字節跳動網絡技術有限公司 Lut中的運動候選的檢查順序
KR20210024502A (ko) 2018-06-29 2021-03-05 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 Hmvp 후보를 병합/amvp에 추가할 때의 부분/풀 프루닝
WO2020003280A1 (en) 2018-06-29 2020-01-02 Beijing Bytedance Network Technology Co., Ltd. Which lut to be updated or no updating
CA3105330C (en) 2018-06-29 2023-12-05 Beijing Bytedance Network Technology Co., Ltd. Interaction between lut and amvp
KR102660666B1 (ko) 2018-06-29 2024-04-26 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 Lut들을 업데이트하기 위한 조건들
CN110662053B (zh) 2018-06-29 2022-03-25 北京字节跳动网络技术有限公司 使用查找表的视频处理方法、装置和存储介质
TWI723444B (zh) 2018-06-29 2021-04-01 大陸商北京字節跳動網絡技術有限公司 使用一個或多個查找表來按順序存儲先前編碼的運動信息並使用它們來編碼後面的塊的概念
TWI723445B (zh) 2018-06-29 2021-04-01 大陸商北京字節跳動網絡技術有限公司 查找表的更新：fifo、約束的fifo
TWI719526B (zh) 2018-07-02 2021-02-21 大陸商北京字節跳動網絡技術有限公司 查找表的更新
KR20240154102A (ko) * 2018-07-02 2024-10-24 엘지전자 주식회사 인터 예측 모드 기반 영상 처리 방법 및 이를 위한 장치
US11184635B2 (en) 2018-08-31 2021-11-23 Tencent America LLC Method and apparatus for video coding with motion vector constraints
TWI729483B (zh) 2018-09-04 2021-06-01 聯發科技股份有限公司 視訊編解碼系統的運動向量湊整統一的方法以及裝置
TWI863924B (zh) 2018-09-12 2024-12-01 大陸商北京字節跳動網絡技術有限公司 要檢查多少個hmvp候選
US11800099B2 (en) 2018-09-20 2023-10-24 Electronics And Telecommunications Research Institute Method and device for encoding/decoding image, and recording medium for storing bitstream
US11470308B2 (en) 2018-09-21 2022-10-11 Vid Scale, Inc. Complexity reduction and bit-width control for bi-directional optical flow
CN117768651A (zh) 2018-09-24 2024-03-26 北京字节跳动网络技术有限公司 处理视频数据的方法、装置、介质、以及比特流存储方法
WO2020094150A1 (en) 2018-11-10 2020-05-14 Beijing Bytedance Network Technology Co., Ltd. Rounding in current picture referencing
EP4325849A3 (en) * 2018-11-22 2024-04-17 Beijing Bytedance Network Technology Co., Ltd. Coordination method for sub-block based inter prediction
CN113852815B (zh) 2018-12-25 2022-12-27 北京达佳互联信息技术有限公司 利用三角形形状预测单元的视频编码方法、设备及介质
CN113228642B (zh) * 2018-12-27 2024-11-08 英迪股份有限公司 图像编码/解码方法和装置
CN114245115B (zh) 2018-12-30 2023-03-21 北京达佳互联信息技术有限公司 用于对视频进行编码的方法和装置
CN111083490B (zh) * 2019-01-02 2022-05-06 北京达佳互联信息技术有限公司 一种视频解码中运动补偿的方法及装置
CN113228673B (zh) * 2019-01-02 2023-03-03 华为技术有限公司 用于基于双向预测光流的逐像素校正的解码器和方法
WO2020143741A1 (en) 2019-01-10 2020-07-16 Beijing Bytedance Network Technology Co., Ltd. Invoke of lut updating
WO2020143824A1 (en) 2019-01-13 2020-07-16 Beijing Bytedance Network Technology Co., Ltd. Interaction between lut and shared merge list
WO2020147773A1 (en) 2019-01-16 2020-07-23 Beijing Bytedance Network Technology Co., Ltd. Inserting order of motion candidates in lut
CN111526362B (zh) * 2019-02-01 2023-12-29 华为技术有限公司 帧间预测方法和装置
KR20250038842A (ko) 2019-02-14 2025-03-19 엘지전자 주식회사 Dmvr 기반의 인터 예측 방법 및 장치
CN120568044A (zh) * 2019-03-07 2025-08-29 数字洞察力有限公司 图像编码/解码方法和传输比特流的方法
EP3912354A4 (en) * 2019-03-08 2022-03-16 Huawei Technologies Co., Ltd. SEARCH REGION FOR MOTION VECTOR REFINEMENT
WO2020182207A1 (en) * 2019-03-13 2020-09-17 Beijing Bytedance Network Technology Co., Ltd. Partitions on sub-block transform mode
WO2020192611A1 (en) 2019-03-22 2020-10-01 Beijing Bytedance Network Technology Co., Ltd. Interaction between merge list construction and other tools
CN117560489A (zh) * 2019-05-14 2024-02-13 北京字节跳动网络技术有限公司 用于残差编解码的上下文建模
WO2020243100A1 (en) * 2019-05-26 2020-12-03 Beijing Dajia Internet Information Technology Co., Ltd. Methods and apparatus for improving motion estimation in video coding
CN114208184B (zh) 2019-08-13 2025-01-07 北京字节跳动网络技术有限公司 基于子块的帧间预测中的运动精度
CN114424536A (zh) 2019-09-22 2022-04-29 北京字节跳动网络技术有限公司 基于变换单元的组合帧间帧内预测
CN113766245A (zh) * 2020-06-05 2021-12-07 Oppo广东移动通信有限公司 帧间预测方法、解码器、编码器及计算机存储介质
US12177475B2 (en) * 2021-01-29 2024-12-24 Qualcomm Incorporated Model-based motion vector difference derivation and template matching prediction for video coding
CN117616754A (zh) * 2021-06-15 2024-02-27 抖音视界有限公司 用于视频处理的方法、设备和介质
WO2023008888A1 (ko) * 2021-07-26 2023-02-02 한국전자통신연구원 영상 부호화/복호화를 위한 방법, 장치 및 기록 매체
WO2023172002A1 (ko) * 2022-03-11 2023-09-14 현대자동차주식회사 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
CN119111073A (zh) * 2022-04-21 2024-12-10 Lg 电子株式会社 使用模板匹配的图像编码/解码方法、用于发送比特流的方法以及其中存储有比特流的记录介质
WO2024106750A1 (ko) * 2022-11-18 2024-05-23 삼성전자 주식회사 비디오 코딩 방법 및 이를 위한 장치
WO2025005664A1 (ko) * 2023-06-27 2025-01-02 주식회사 케이티 영상 부호화/복호화 방법 및 비트스트림을 저장하는 기록 매체
WO2025071286A1 (ko) * 2023-09-26 2025-04-03 가온그룹 주식회사 개선된 국소적 조도 보상 템플릿 결정에 기반한 동영상 부호화/복호화 방법 및 장치
WO2025071283A1 (ko) * 2023-09-26 2025-04-03 가온그룹 주식회사 개선된 국소적 조도 보상 템플릿 결정에 기반한 동영상 부호화/복호화 방법 및 장치
KR20250144021A (ko) * 2024-03-26 2025-10-10 현대자동차주식회사 머지 후보들의 융합 방법에 기반한 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2025211725A1 (ko) * 2024-04-04 2025-10-09 현대자동차주식회사 인터 예측 모드를 이용한 영상 부호화 및 복호화 방법 및 장치

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110080954A1 (en) * 2009-10-01 2011-04-07 Bossen Frank J Motion vector prediction in video coding
US20150078451A1 (en) * 2005-04-14 2015-03-19 Fastvdo Llc Device and Method for Fast Block-Matching Motion Estimation in Video Encoders
WO2017036414A1 (en) * 2015-09-02 2017-03-09 Mediatek Inc. Method and apparatus of decoder side motion derivation for video coding
US20170085906A1 (en) * 2014-04-01 2017-03-23 Mediatek Inc. Method of Motion Information Coding
WO2017084512A1 (en) * 2015-11-20 2017-05-26 Mediatek Inc. Method and apparatus of motion vector prediction or merge candidate derivation for video coding

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19548452C1 (de) * 1995-12-22 1997-02-20 Siemens Ag Verfahren zur rechnergestützten Bewegungsschätzung für Bildpunkte zeitlich aufeinander folgender Bilder einer Videosequenz
US6711211B1 (en) 2000-05-08 2004-03-23 Nokia Mobile Phones Ltd. Method for encoding and decoding video information, a motion compensated video encoder and a corresponding decoder
EP4539464A3 (en) 2010-12-31 2025-06-11 Electronics And Telecommunications Research Institute Method for encoding video information and method for decoding video information, and apparatus using same
US20140126645A1 (en) 2011-07-01 2014-05-08 Electronics And Telecommunications Research Institute Video encoding and decoding methods and device using same
KR102070719B1 (ko) 2013-01-23 2020-01-30 한국전자통신연구원 인터 예측 방법 및 그 장치
CN105532004B (zh) 2013-07-12 2019-01-25 三星电子株式会社 层间视频解码方法及设备
US11330284B2 (en) 2015-03-27 2022-05-10 Qualcomm Incorporated Deriving motion information for sub-blocks in video coding
US11153600B2 (en) * 2016-02-08 2021-10-19 Sharp Kabushiki Kaisha Motion vector generation device, prediction image generation device, video decoding device, and video coding device
US10368083B2 (en) * 2016-02-15 2019-07-30 Qualcomm Incorporated Picture order count based motion vector pruning
EP3439303B1 (en) * 2016-04-28 2020-12-30 LG Electronics Inc. -1- Inter prediction mode-based image processing method and apparatus therefor

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150078451A1 (en) * 2005-04-14 2015-03-19 Fastvdo Llc Device and Method for Fast Block-Matching Motion Estimation in Video Encoders
US20110080954A1 (en) * 2009-10-01 2011-04-07 Bossen Frank J Motion vector prediction in video coding
US20170085906A1 (en) * 2014-04-01 2017-03-23 Mediatek Inc. Method of Motion Information Coding
WO2017036414A1 (en) * 2015-09-02 2017-03-09 Mediatek Inc. Method and apparatus of decoder side motion derivation for video coding
WO2017084512A1 (en) * 2015-11-20 2017-05-26 Mediatek Inc. Method and apparatus of motion vector prediction or merge candidate derivation for video coding

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12348759B2 (en) 2018-05-31 2025-07-01 Beijing Bytedance Network Technology Co., Ltd. Concept of interweaved prediction
CN113455001A (zh) * 2018-12-27 2021-09-28 英迪股份有限公司 视频编码/解码方法和装置
US12010304B2 (en) 2018-12-27 2024-06-11 Intellectual Discovery Co., Ltd. Video encoding/decoding method and apparatus utilizing merge candidate indices
CN113455001B (zh) * 2018-12-27 2024-04-09 英迪股份有限公司 视频编码/解码方法和装置
CN113597760A (zh) * 2019-01-02 2021-11-02 北京字节跳动网络技术有限公司 视频处理的方法
US12113984B2 (en) 2019-01-02 2024-10-08 Beijing Bytedance Network Technology Co., Ltd Motion vector derivation between color components
CN115002483A (zh) * 2019-01-17 2022-09-02 腾讯美国有限责任公司 视频编解码方法及装置
US12200200B2 (en) 2019-01-18 2025-01-14 Wilus Institute Of Standards And Technology Inc. Video signal processing method and device using motion compensation
CN113574868A (zh) * 2019-03-08 2021-10-29 韩国电子通信研究院 图像编码/解码方法和设备以及存储比特流的记录介质
CN113841408B (zh) * 2019-05-17 2024-02-06 北京字节跳动网络技术有限公司 用于视频处理的运动信息确定和存储
CN113841408A (zh) * 2019-05-17 2021-12-24 北京字节跳动网络技术有限公司 用于视频处理的运动信息确定和存储
CN114080808A (zh) * 2019-07-06 2022-02-22 北京达佳互联信息技术有限公司 用于视频编解码中的解码器侧运动矢量细化的方法和装置
CN114128290A (zh) * 2019-07-08 2022-03-01 现代自动车株式会社 用于利用帧间预测来编码和解码视频的方法和装置

Also Published As

Publication number Publication date
KR102438181B1 (ko) 2022-08-30
EP4351139A3 (en) 2024-05-15
US20240323431A1 (en) 2024-09-26
US12075087B2 (en) 2024-08-27
EP3637772A4 (en) 2020-12-09
KR20220123203A (ko) 2022-09-06
JP2023009280A (ja) 2023-01-19
US20230179793A1 (en) 2023-06-08
KR20230070198A (ko) 2023-05-22
KR102533727B1 (ko) 2023-05-17
EP3637772A1 (en) 2020-04-15
KR102661541B1 (ko) 2024-04-29
US11616976B2 (en) 2023-03-28
EP4351139A2 (en) 2024-04-10
US20200280735A1 (en) 2020-09-03
KR20180134764A (ko) 2018-12-19
CN110771169A (zh) 2020-02-07
JP7731581B2 (ja) 2025-09-01
JP2020522960A (ja) 2020-07-30

Similar Documents

Publication Publication Date Title
WO2018226015A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2019177354A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2019190224A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2018012886A1 (ko) 영상 부호화/복호화 방법 및 이를 위한 기록 매체
WO2019182385A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2018012851A1 (ko) 영상 부호화/복호화 방법 및 이를 위한 기록 매체
WO2019172705A1 (ko) 샘플 필터링을 이용한 영상 부호화/복호화 방법 및 장치
WO2018030773A1 (ko) 영상 부호화/복호화 방법 및 장치
WO2018097693A2 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2018097692A2 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020017910A1 (ko) 지역 조명 보상을 통한 효과적인 비디오 부호화/복호화 방법 및 장치
WO2020004987A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2019083334A1 (ko) 비대칭 서브 블록 기반 영상 부호화/복호화 방법 및 장치
WO2018066867A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2021054805A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020060316A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2018016823A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2019240493A1 (ko) 문맥 적응적 이진 산술 부호화 방법 및 장치
WO2021015581A1 (ko) 기하학적 분할을 사용하는 영상 부호화/복호화를 위한 방법, 장치 및 기록 매체
WO2020005035A1 (ko) 처리율 향상을 위한 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2018174617A1 (ko) 블록 형태에 기반한 예측 방법 및 장치
WO2020141816A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020050600A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020139006A2 (ko) 화면 내 예측 모드 유도 방법 및 장치
WO2020032531A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18814404

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019568020

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018814404

Country of ref document: EP

Effective date: 20200109