US11343530B2 - Image encoding/decoding method and device, and recording medium having bitstream stored thereon - Google Patents

Image encoding/decoding method and device, and recording medium having bitstream stored thereon Download PDF

Info

Publication number
US11343530B2
US11343530B2 US16/461,388 US201716461388A US11343530B2 US 11343530 B2 US11343530 B2 US 11343530B2 US 201716461388 A US201716461388 A US 201716461388A US 11343530 B2 US11343530 B2 US 11343530B2
Authority
US
United States
Prior art keywords
motion vector
block
information
prediction
current block
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.)
Active, expires
Application number
US16/461,388
Other languages
English (en)
Other versions
US20200267408A1 (en
Inventor
Ha Hyun LEE
Jung Won Kang
Hyun Suk KO
Sung Chang LIM
Jin Ho Lee
Dong San Jun
Seung Hyun Cho
Hui Yong KIM
Jin Soo Choi
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.)
Intellectual Discovery Co Ltd
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
Assigned to ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE reassignment ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CHO, SEUNG HYUN, CHOI, JIN SOO, KANG, JUNG WON, KIM, HUI YONG, LEE, HA HYUN, LEE, JIN HO, LIM, SUNG CHANG, JUN, DONG SAN, KO, HYUN SUK
Publication of US20200267408A1 publication Critical patent/US20200267408A1/en
Application granted granted Critical
Publication of US11343530B2 publication Critical patent/US11343530B2/en
Assigned to INTELLECTUAL DISCOVERY CO., LTD. reassignment INTELLECTUAL DISCOVERY CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Active legal-status Critical Current
Adjusted expiration legal-status Critical

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/513—Processing of motion vectors
    • H04N19/521—Processing of motion vectors for estimating the reliability of the determined motion vectors or motion vector field, e.g. for smoothing the motion vector field or for correcting 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/513—Processing of motion vectors
    • H04N19/517—Processing of motion vectors by encoding
    • H04N19/52—Processing of motion vectors by encoding by predictive encoding
    • 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/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/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/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
    • 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]
    • 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/132—Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • 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
    • H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
    • 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/537—Motion estimation other than block-based
    • 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/56—Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • 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/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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
    • 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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding

Definitions

  • the present invention relates to a method and apparatus for encoding/decoding an image and recording medium for storing a bitstream. More particularly, the present invention relates to a method and apparatus for encoding/decoding an image by refining a motion vector.
  • HD images high definition (HD) images or ultra high definition (UHD) images
  • UHD ultra high definition
  • higher resolution and quality image data have increased data amounts in comparison with conventional image data. Therefore, when transmitting image data by using a medium such as conventional wired or wireless broadband networks or when storing image data in a conventional storage medium, transmission cost and storage cost increase.
  • high-efficiency image encoding/decoding techniques are required.
  • Image compression technology includes various techniques, including: an inter-prediction technique of predicting a pixel value included in a current picture from a previous or subsequent picture of the current picture; an intra-prediction technique of predicting a pixel value included in a current picture by using pixel information in the current picture; an entropy encoding technique of assigning a short code to a value with a high appearance frequency and assigning a long code to a value with a low appearance frequency; etc.
  • Image data can be effectively compressed by using such image compression technology, and the compressed image data is transmitted or stored.
  • An object of the present invention is to provide a method and apparatus for encoding/decoding an image, the method and apparatus refining a motion vector to enhance encoding/decoding efficiency of an image.
  • a method for decoding an image including: deriving an initial motion vector from a merge candidate list of a current block; deriving a refined motion vector using the initial motion vector; and generating a prediction block of the current block using the refined motion vector.
  • the initial motion vector may be derived from a merge candidate indicated by merge index information.
  • a motion vector of the existing motion information may be mirrored or scaled to derive the initial motion vector in a prediction direction where the motion information is absent.
  • a motion vector indicating a template minimizing a difference with a neighbor template of the current block may be searched for in a search area of a reference picture indicated by the initial motion vector, and the motion vector indicating the template minimizing the difference may be derived as the refined motion vector.
  • the search area may be determined as an area centered on a pixel position of the reference picture indicated by the initial motion vector, the area having at least one of cross, square, diamond, and hexagon shapes.
  • the motion vector indicating the template minimizing the difference with the neighbor template of the current block in the search area of the reference picture indicated by the initial motion vector may be searched for based on at least one of a distortion value between templates and a cost value for the motion vector.
  • the refined motion vector may be derived based on at least one prediction block indicated by the initial motion vector.
  • a weighted sum of a first prediction block indicated by a first prediction direction initial motion vector and a second prediction block indicated by a second prediction direction initial motion vector may be set as a template and a search area of at least one reference picture indicated by at least one of the first prediction direction initial motion vector and the second prediction direction initial motion vector may be set, such that a motion vector indicating a third prediction block minimizing a difference with the template in the search area may be derived as the refined motion vector.
  • the refined motion vector may be derived using motion vectors indicating prediction blocks minimizing the difference with the template in the first search area and the second search area.
  • an existing initial motion vector may be mirrored or scaled to derive a non-existing initial motion vector.
  • the current block may be a sub-block of a decoding target block.
  • a method for encoding an image including: deriving an initial motion vector from a merge candidate list of a current block; deriving a refined motion vector using the initial motion vector; and generating a prediction block of the current block using the refined motion vector.
  • the initial motion vector may be derived from a merge candidate indicated by merge index information.
  • a motion vector of the existing motion information may be mirrored or scaled to derive the initial motion vector in a prediction direction where the motion information is absent.
  • a motion vector indicating a template minimizing a difference with a neighbor template of the current block may be searched for in a search area of a reference picture indicated by the initial motion vector, and the motion vector indicating the template minimizing the difference may be derived as the refined motion vector.
  • the search area may be determined as an area centered on a pixel position of the reference picture indicated by the initial motion vector, the area having at least one of cross, square, diamond, and hexagon shapes.
  • the motion vector indicating the template minimizing the difference with the neighbor template of the current block in the search area of the reference picture indicated by the initial motion vector may be searched for based on at least one of a distortion value between templates and a cost value for the motion vector.
  • the refined motion vector may be derived based on at least one prediction block indicated by the initial motion vector.
  • a weighted sum of a first prediction block indicated by a first prediction direction initial motion vector and a second prediction block indicated by a second prediction direction initial motion vector may be set as a template and a search area of a reference picture indicated by the first prediction direction initial motion vector or the second prediction direction initial motion vector may be set, such that a motion vector indicating a third prediction block minimizing a difference with the template in the search area may be derived as the refined motion vector.
  • an existing initial motion vector may be mirrored or scaled to derive a non-existing initial motion vector.
  • the current block may be a sub-block of a encoding target block.
  • a recording medium stores a bitstream formed by a method for decoding an image, the method including: deriving an initial motion vector from a merge candidate list of a current block; deriving a refined motion vector using the initial motion vector; and generating a prediction block of the current block using the refined motion vector.
  • a method and apparatus for encoding/decoding an image can be provided with enhanced compression efficiency.
  • encoding and decoding efficiency of an image can be enhanced.
  • FIG. 1 is a block diagram illustrating configurations of an encoding apparatus according to an embodiment of the present invention.
  • FIG. 2 is a block diagram illustrating configurations of a decoding apparatus according to an embodiment of the present invention.
  • FIG. 3 is a view schematically illustrating a partition structure of an image when encoding and decoding the image.
  • FIG. 4 is a view illustrating an embodiment of an inter prediction process.
  • FIG. 5 is a flowchart illustrating a method for encoding an image according to an embodiment of the present invention.
  • FIG. 6 is a flowchart illustrating a method for decoding an image according to an embodiment of the present invention.
  • FIG. 7 is a view illustrating an example of deriving a spatial merge candidate and a temporal merge candidate of a current block.
  • FIG. 8 is a view illustrating spatial neighbor blocks and temporal neighbor blocks for configuring an additional merge candidate list.
  • FIGS. 9 and 10 are views illustrating configurations of an initial motion vector list.
  • FIG. 11 is a view illustrating a method of deriving an initial motion vector using merge index information.
  • FIG. 12 is a view illustrating motion vector mirroring.
  • FIG. 13 is a view illustrating motion vector scaling.
  • FIG. 14 is a view illustrating an example of deriving an additional motion vector when only one motion vector corresponding to an L 0 or L 1 list exists in a block where bi-prediction can be performed.
  • FIG. 15 is a view illustrating an example of selecting a merge candidate having bi-directional motion information in a block where bi-prediction can be performed as an initial motion vector.
  • FIGS. 16 to 21 are views illustrating templates according to an embodiment of the present invention.
  • FIG. 22 is a view illustrating an example of refining an initial motion vector by using a template.
  • FIGS. 23 to 25 are views illustrating an example of refining an initial motion vector by using prediction blocks of a current block.
  • FIGS. 26 and 27 are views illustrating a sub-block.
  • FIG. 28 is a view illustrating an example of setting an initial motion vector for motion vector refining in sub-block units.
  • FIG. 29 is a flowchart illustrating a method for decoding an image according to an embodiment of the present invention.
  • first ‘first’, ‘second’, etc. can be used to describe various components, but the components are not to be construed as being limited to the terms. The terms are only used to differentiate one component from other components.
  • the ‘first’ component may be named the ‘second’ component without departing from the scope of the present invention, and the ‘second’ component may also be similarly named the ‘first’ component.
  • the term ‘and/or’ includes a combination of a plurality of items or any one of a plurality of terms.
  • constitutional parts shown in the embodiments of the present invention are independently shown so as to represent characteristic functions different from each other.
  • each constitutional part includes each of enumerated constitutional parts for convenience.
  • at least two constitutional parts of each constitutional part may be combined to form one constitutional part or one constitutional part may be divided into a plurality of constitutional parts to perform each function.
  • the embodiment where each constitutional part is combined and the embodiment where one constitutional part is divided are also included in the scope of the present invention, if not departing from the essence of the present invention.
  • constituents may not be indispensable constituents performing essential functions of the present invention but be selective constituents improving only performance thereof.
  • the present invention may be implemented by including only the indispensable constitutional parts for implementing the essence of the present invention except the constituents used in improving performance.
  • the structure including only the indispensable constituents except the selective constituents used in improving only performance is also included in the scope of the present invention.
  • an image may mean a picture configuring a video, or may mean the video itself.
  • encoding or decoding or both of an image may mean “encoding or decoding or both of a video”, and may mean “encoding or decoding or both of one image among images of a video.”
  • a picture and the image may have the same meaning.
  • Encoder means an apparatus performing encoding.
  • Decoder means an apparatus performing decoding
  • Block is an M ⁇ N array of a sample.
  • M and N mean positive integers, and the block may mean a sample array of a two-dimensional form.
  • the block may refer to a unit.
  • a current block my mean an encoding target block that becomes a target when encoding, or a decoding target block that becomes a target when decoding.
  • the current block may be at least one of an encode block, a prediction block, a residual block, and a transform block.
  • Sample is a basic unit constituting a block. It may be expressed as a value from 0 to 2 Bd -1 according to a bit depth (Bd). In the present invention, the sample may be used as a meaning of a pixel.
  • Unit refers to an encoding and decoding unit.
  • the unit may be a region generated by partitioning a single image.
  • the unit may mean a subdivided unit when a single image is partitioned into subdivided units during encoding or decoding.
  • a predetermined process for each unit may be performed.
  • a single unit may be partitioned into sub-units that have sizes smaller than the size of the unit.
  • the unit may mean a block, a macroblock, a coding tree unit, a code tree block, a coding unit, a coding block, a prediction unit, a prediction block, a residual unit, a residual block, a transform unit, a transform block, etc.
  • the unit may include a luma component block, a chroma component block associated with the luma component block, and a syntax element of each color component block.
  • the unit may have various sizes and forms, and particularly, the form of the unit may be a two-dimensional geometrical figure such as a rectangular shape, a square shape, a trapezoid shape, a triangular shape, a pentagonal shape, etc.
  • unit information may include at least one of a unit type indicating the coding unit, the prediction unit, the transform unit, etc., and a unit size, a unit depth, a sequence of encoding and decoding of a unit, etc.
  • Coding Tree Unit is configured with a single coding tree block of a luma component Y, and two coding tree blocks related to chroma components Cb and Cr. In addition, it may mean that including the blocks and a syntax element of each block.
  • Each coding tree unit may be partitioned by using at least one of a quad-tree partitioning method and a binary-tree partitioning method to configure a lower unit such as coding unit, prediction unit, transform unit, etc. It may be used as a term for designating a pixel block that becomes a process unit when encoding/decoding an image as an input image.
  • Coding Tree Block may be used as a term for designating any one of a Y coding tree block, Cb coding tree block, and Cr coding tree block.
  • Neighbor Block means a block adjacent to a current block.
  • the block adjacent to the current block may mean a block that comes into contact with a boundary of the current block, or a block positioned within a predetermined distance from the current block.
  • the neighbor block may mean a block adjacent to a vertex of the current block.
  • the block adjacent to the vertex of the current block may mean a block vertically adjacent to a neighbor block that is horizontally adjacent to the current block, or a block horizontally adjacent to a neighbor block that is vertically adjacent to the current block.
  • Reconstructed Neighbor block means a neighbor block adjacent to a current block and which has been already spatially/temporally encoded or decoded.
  • the reconstructed neighbor block may mean a reconstructed neighbor unit.
  • a reconstructed spatial neighbor block may be a block within a current picture and which has been already reconstructed through encoding or decoding or both.
  • a reconstructed temporal neighbor block is a block at the same position as the current block of the current picture within a reference picture, or a neighbor block thereof.
  • Unit Depth means a partitioned degree of a unit.
  • a root node may be the highest node, and a leaf node may be the lowest node.
  • a level in which a unit is present may mean a unit depth.
  • Bitstream means a bitstream including encoding image information.
  • Parameter Set corresponds to header information among a configuration within a 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 a parameter set. In addition, a parameter set may include a slice header, and tile header information.
  • Parsing may mean determination of a value of a syntax element by performing entropy decoding, or may mean the entropy decoding itself.
  • Symbol may mean at least one of a syntax element, a coding parameter, and a transform coefficient value of an encoding/decoding target unit.
  • the symbol may mean an entropy encoding target or an entropy decoding result.
  • Prediction Unit means a basic unit when performing prediction such as inter-prediction, intra-prediction, inter-compensation, intra-compensation, and motion compensation.
  • a single prediction unit may be partitioned into a plurality of partitions with a small size, or may be partitioned into a lower prediction unit.
  • Prediction Unit Partition means a form obtained by partitioning a prediction unit.
  • Reference Picture List means a list including one or more reference pictures used for inter-picture prediction or motion compensation.
  • LC List Combined
  • L 0 List 0
  • L List 1
  • L 2 List 2
  • L 3 List 3
  • One or more reference picture lists may be used for inter-picture prediction.
  • Inter-picture prediction Indicator may mean an inter-picture prediction direction (uni-directional prediction, bi-directional prediction, and the like) of a current block.
  • the inter-picture prediction indicator may mean the number of reference pictures used to generate a prediction block of a current block.
  • the inter-picture prediction indicator may mean the number of prediction blocks used to perform inter-picture prediction or motion compensation with respect to a current block.
  • Reference Picture Index means an index indicating a specific reference picture in a reference picture list.
  • Reference Picture may mean a picture to which a specific block refers for inter-picture prediction or motion compensation.
  • Motion Vector is a two-dimensional vector used for inter-picture prediction or motion compensation and may mean an offset between a reference picture and an encoding/decoding target picture.
  • (mvX, mvY) may represent a motion vector
  • mvX may represent a horizontal component
  • mvY may represent a vertical component.
  • Motion Vector Candidate may mean a block that becomes a prediction candidate when predicting a motion vector, or a motion vector of the block.
  • a motion vector candidate may be listed in a motion vector candidate list.
  • Motion Vector Candidate List may mean a list of motion vector candidates.
  • Motion Vector Candidate Index means an indicator indicating a motion vector candidate in a motion vector candidate list. It is also referred to as an index of a motion vector predictor.
  • Motion Information may mean information including a motion vector, a reference picture index, an inter-picture prediction indicator, and at least any one among reference picture list information, a reference picture, a motion vector candidate, a motion vector candidate index, a merge candidate, and a merge index.
  • Merge Candidate List means a list composed of merge candidates.
  • Merge Candidate means a spatial merge candidate, a temporal merge candidate, a combined merge candidate, a combined bi-prediction merge candidate, a zero merge candidate, or the like.
  • the merge candidate may have an inter-picture prediction indicator, a reference picture index for each list, and motion information such as a motion vector.
  • Merge Index means information indicating a merge candidate within a merge candidate list.
  • the merge index may indicate a block used to derive a merge candidate, among reconstructed blocks spatially and/or temporally adjacent to a current block.
  • the merge index may indicate at least one item in the motion information possessed by a merge candidate.
  • Transform Unit means a basic unit used when encoding or decoding a residual signal, for example, when performing transform, reverse transform, quantization, dequantization, or transform coefficient encoding/decoding.
  • One transform unit may be partitioned into a plurality of smaller transform units.
  • Scaling means a process of multiplying a transform coefficient level by a factor.
  • a transform coefficient may be generated by scaling a transform coefficient level.
  • the scaling also may be referred to as dequantization.
  • Quantization Parameter may mean a value used when generating a transform coefficient level of a transform coefficient during quantization.
  • the quantization parameter also may mean a value used when generating a transform coefficient by scaling a transform coefficient level during dequantization.
  • the quantization parameter may be a value mapped on a quantization step size.
  • Delta Quantization Parameter means a difference value between a predicted quantization parameter and a quantization parameter of an encoding/decoding target unit.
  • Scan means a method of sequencing coefficients within a block or a matrix. For example, changing a two-dimensional matrix of coefficients into a one-dimensional matrix may be referred to as scanning, and changing a one-dimensional matrix of coefficients into a two-dimensional matrix may be referred to as scanning or inverse scanning.
  • Transform Coefficient may mean a coefficient value generated after transform is performed in an encoder. It may mean a coefficient value generated after at least one of entropy decoding and dequantization is performed in a decoder. A quantized level obtained by quantizing a transform coefficient or a residual signal, or a quantized transform coefficient level also may fall within the meaning of the transform coefficient.
  • Quantized Level means a value generated by quantizing a transform coefficient or a residual signal in an encoder.
  • the quantized level may mean a value that is a dequantization target to undergo dequantization in a decoder.
  • a quantized transform coefficient level that is a result of transform and quantization also may fall within the meaning of the quantized level.
  • Non-zero Transform Coefficient means a transform coefficient having a value other than zero, or a transform coefficient level having a value other than zero.
  • Quantization Matrix means a matrix used in a quantization process or a dequantization process performed to improve subjective or objective image quality.
  • the quantization matrix also may be referred to as a scaling list.
  • Quantization Matrix Coefficient means each element within a quantization matrix.
  • the quantization matrix coefficient also may be referred to as a matrix coefficient.
  • Default Matrix means a predetermined quantization matrix preliminarily defined in an encoder or a decoder.
  • Non-default Matrix means a quantization matrix that is not preliminarily defined in an encoder or a decoder but is signaled by a user.
  • FIG. 1 is a block diagram showing a configuration of an encoding apparatus according to an embodiment to which the present invention is applied.
  • An encoding apparatus 100 may be an encoder, a video encoding apparatus, or an image encoding apparatus.
  • a video may include at least one image.
  • the encoding apparatus 100 may sequentially encode at least one image.
  • the encoding apparatus 100 may include a motion prediction unit 111 , a motion compensation unit 112 , an intra-prediction unit 120 , a switch 115 , a subtractor 125 , a transform unit 130 , a quantization unit 140 , an entropy encoding unit 150 , a dequantization unit 160 , a inverse-transform unit 170 , an adder 175 , a filter unit 180 , and a reference picture buffer 190 .
  • the encoding apparatus 100 may perform encoding of an input image by using an intra mode or an inter mode or both. In addition, encoding apparatus 100 may generate a bitstream through encoding the input image, and output the generated bitstream. The generated bitstream may be stored in a computer readable recording medium, or may be streamed through a wired/wireless transmission medium.
  • the switch 115 When an intra mode is used as a prediction mode, the switch 115 may be switched to an intra.
  • an inter mode is used as a prediction mode, the switch 115 may be switched to an inter mode.
  • 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 an input block of the input image.
  • the encoding apparatus 100 may encode a residual of the input block and the prediction block after the prediction block being generated.
  • the input image may be called as a current image that is a current encoding target.
  • the input block may be called as a current block that is current encoding target, or as an encoding target block.
  • the intra-prediction unit 120 may use a pixel value of a block that has been already encoded/decoded and is adjacent to a current block as a reference pixel.
  • the intra-prediction unit 120 may perform spatial prediction by using a reference pixel, or generate prediction samples of an input block by performing spatial prediction.
  • the intra prediction may mean intra-prediction.
  • the motion prediction unit 111 may retrieve a region that best matches with an input block from a reference image when performing motion prediction, and deduce a motion vector by using the retrieved region.
  • the reference image may be stored in the reference picture buffer 190 .
  • the motion compensation unit 112 may generate a prediction block by performing motion compensation using a motion vector.
  • inter-prediction may mean inter-prediction or motion compensation.
  • the motion prediction unit 111 and the motion compensation unit 112 can generate a prediction block by applying an interpolation filter to a partial region of the reference image when the motion vector value does not have an integer value.
  • a motion prediction and motion compensation method of a prediction unit included in a coding unit based on an encoding unit for performing prediction or motion compensation includes a skip mode (Skip Mode), a merge mode, an advanced motion vector prediction (AMVP) Mode and the current picture reference mode, and it is possible to perform inter picture prediction or motion compensation according to each mode.
  • the subtractor 125 may generate a residual block by using a residual between an input block and a prediction block.
  • the residual block may be called as a residual signal.
  • the residual signal may mean a difference between an original signal and a prediction signal.
  • the residual signal may be a signal generated by transforming or quantizing, or transforming and quantizing a difference between the original signal and the prediction signal.
  • the residual block may be a residual signal of a block unit.
  • the transform unit 130 may generate a transform coefficient by performing transform of a residual block, and output the generated transform coefficient.
  • the transform coefficient may be a coefficient value generated by performing transform of the residual block.
  • the transform unit 130 may skip transform of the residual block.
  • a quantized level may be generated by applying quantization to the transform coefficient or to the residual signal.
  • the quantized level may be also called as a transform coefficient in embodiments.
  • the quantization unit 140 may generate a quantized level by quantizing the transform coefficient or the residual signal according to a quantization parameter, and output the generated quantized level.
  • the quantization unit 140 may quantize the transform coefficient by using a quantization matrix.
  • the entropy encoding unit 150 may generate a bitstream by performing entropy encoding according to a probability distribution on values calculated by the quantization unit 140 or on coding parameter values calculated when performing encoding, and output the generated bitstream.
  • the entropy encoding unit 150 may perform entropy encoding of pixel information of an image and information for decoding an image.
  • the information for decoding the image may include a syntax element.
  • the entropy encoding unit 150 may use an encoding method for entropy encoding such as exponential Golomb, context-adaptive variable length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), etc.
  • the entropy encoding unit 150 may perform entropy encoding by using a variable length coding/code (VLC) table.
  • VLC variable length coding/code
  • the entropy encoding unit 150 may deduce a binarization method of a target symbol and a probability model of a target symbol/bin, and perform arithmetic coding by using the deduced binarization method, and a context model.
  • the entropy encoding unit 150 may change a two-dimensional block form coefficient into a one-dimensional vector form by using a transform coefficient scanning method.
  • a coding parameter may include information (flag, index, etc.) such as syntax element that is encoded in an encoder and signaled to a decoder, and information derived when performing encoding or decoding.
  • the coding parameter may mean information required when encoding or decoding an image.
  • signaling the flag or index may mean that a corresponding flag or index is entropy encoded and included in a bitstream by an encoder, and may mean that the corresponding flag or index is entropy decoded from a bitstream by a decoder.
  • an encoded current image may be used as a reference image for another image that is processed afterwards. Accordingly, the encoding apparatus 100 may reconstruct or decode the encoded current image, or store the reconstructed or decoded image as a reference image.
  • a quantized level may be dequantized in the dequantization unit 160 , or may be inverse-transformed in the inverse-transform unit 170 .
  • a dequantized or inverse-transformed coefficient or both may be added with a prediction block by the adder 175 .
  • the dequantized or inverse-transformed coefficient or both may mean a coefficient on which at least one of dequantization and inverse-transform is performed, and may mean a reconstructed residual block.
  • a reconstructed block may pass through the filter unit 180 .
  • the filter unit 180 may apply at least one of a deblocking filter, a sample adaptive offset (SAO), and an adaptive loop filter (ALF) to the reconstructed block or a reconstructed image.
  • the filter unit 180 may be called as an in-loop filter.
  • the deblocking filter may remove block distortion generated in boundaries between blocks.
  • whether or not to apply a deblocking filter may be determined based pixels included in several rows or columns which are included in the block.
  • another filter may be applied according to a required deblocking filtering strength.
  • a proper offset value may be added to a pixel value by using a sample adaptive offset.
  • the sample adaptive offset may correct an offset of a deblocked image from an original image by a pixel unit.
  • a method of partitioning pixels of an image into a predetermined number of regions, determining a region to which an offset is applied, and applying the offset to the determined region, or a method of applying an offset in consideration of edge information on each pixel may be used.
  • the adaptive loop filter may perform filtering based on a comparison result of the filtered reconstructed image and the original image. Pixels included in an image may be partitioned into predetermined groups, a filter to be applied to each group may be determined, and differential filtering may be performed for each group. Information of whether or not to apply the ALF may be signaled by coding units (CUs), and a form and coefficient of the ALF to be applied to each block may vary.
  • CUs coding units
  • FIG. 2 is a block diagram showing a configuration of a decoding apparatus according to an embodiment to which the present invention is applied.
  • a decoding apparatus 200 may be a decoder, a video decoding apparatus, or an image decoding apparatus.
  • the decoding apparatus 200 may include an entropy decoding unit 210 , a dequantization unit 220 , a inverse-transform unit 230 , an intra-prediction unit 240 , a motion compensation unit 250 , an adder 255 , a filter unit 260 , and 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 that is streamed through a wired/wireless transmission medium.
  • the decoding apparatus 200 may decode the bitstream by using an intra mode or an inter mode.
  • the decoding apparatus 200 may generate a reconstructed image generated through decoding or a decoded image, and output the reconstructed image or decoded image.
  • a switch When a prediction mode used when decoding is an intra mode, a switch may be switched to an intra. Alternatively, when a prediction mode used when decoding is an inter mode, a switch may be switched to an inter mode.
  • 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 reconstructed block that becomes a decoding target by adding the reconstructed residual block with the prediction block.
  • the decoding target block may be called a current block.
  • the entropy decoding unit 210 may generate symbols by entropy decoding the bitstream according to a probability distribution.
  • the generated symbols may include a symbol of a quantized level form.
  • an entropy decoding method may be a inverse-process of the entropy encoding method described above.
  • the entropy decoding unit 210 may change a one-dimensional vector form coefficient into a two-dimensional block form by using a transform coefficient scanning method.
  • a quantized level may be dequantized in the dequantization unit 220 , or inverse-transformed in the inverse-transform unit 230 .
  • the quantized level may be a result of dequantizing or inverse-transforming or both, and may be generated as a reconstructed residual block.
  • the dequantization unit 220 may apply a quantization matrix to the quantized level.
  • the intra-prediction unit 240 may generate a prediction block by performing spatial prediction that uses a pixel value of a block adjacent to a decoding target block and which has been already decoded.
  • the motion compensation unit 250 may generate a prediction block by performing motion compensation that uses a motion vector and a reference image stored in the reference picture buffer 270 .
  • the adder 255 may generate a reconstructed block by adding the reconstructed residual block with the prediction 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 reconstructed image.
  • the filter unit 260 may output the reconstructed image.
  • the reconstructed block or reconstructed image may be stored in the reference picture buffer 270 and used when performing inter-prediction.
  • FIG. 3 is a view schematically showing a partition structure of an image when encoding and decoding the image.
  • FIG. 3 schematically shows an example of partitioning a single unit into a plurality of lower units.
  • a coding unit may be used.
  • the coding unit may be used as a basic unit when encoding/decoding the image.
  • the coding unit may be used as a unit for distinguishing an intra mode and an inter mode when encoding/decoding the image.
  • the coding unit may be a basic unit used for prediction, transform, quantization, inverse-transform, dequantization, or an encoding/decoding process of a transform coefficient.
  • an image 300 is sequentially partitioned in a largest coding unit (LCU), and a LCU unit is determined as a partition structure.
  • LCU may be used in the same meaning as a coding tree unit (CTU).
  • a unit partitioning may mean partitioning a block associated with to the unit.
  • block partition information information of a unit depth may be included.
  • Depth information may represent a number of times or a degree or both in which a unit is partitioned.
  • a single unit may be partitioned in a layer associated with depth information based on a tree structure.
  • Each of partitioned lower unit may have depth information.
  • Depth information may be information representing a size of a CU, and may be stored in each CU.
  • a partition structure may mean a distribution of a coding unit (CU) within an LCU 310 . Such a distribution may be determined according to whether or not to partition a single CU into a plurality (positive integer equal to or greater than 2 including 2, 4, 8, 16, etc.) of CUs.
  • a horizontal size and a vertical size of the CU generated by partitioning may respectively be half of a horizontal size and a vertical size of the CU before partitioning, or may respectively have sizes smaller than a horizontal size and a vertical size before partitioning according to a number of times of partitioning.
  • the CU may be recursively partitioned into a plurality of CUs. Partitioning of the CU may be recursively performed until to a predefined depth or predefined size.
  • a depth of an LCU may be 0, and a depth of a smallest coding unit (SCU) may be a predefined maximum depth.
  • the LCU may be a coding unit having a maximum coding unit size
  • the SCU may be a coding unit having a minimum coding unit size as described above. Partitioning is started from the LCU 310 , a CU depth increases by 1 as a horizontal size or a vertical size or both of the CU decreases by partitioning.
  • information whether or not the CU is partitioned may be represented by using partition information of the CU.
  • the partition information may be 1-bit information. All CUs, except for a SCU, may include partition information. For example, when a value of partition information is 1, the CU may not be partitioned, when a value of partition information is 2, the CU may be partitioned.
  • an LCU having a depth 0 may be a 64 ⁇ 64 block. 0 may be a minimum depth.
  • a SCU having a depth 3 may be an 8 ⁇ 8 block. 3 may be a maximum depth.
  • a CU of a 32 ⁇ 32 block and a 16 ⁇ 16 block may be respectively represented as a depth 1 and a depth 2.
  • a horizontal size and a vertical size of the four partitioned coding units may be a half size of a horizontal and vertical size of the CU before being partitioned.
  • each of the four partitioned coding units may have a 16 ⁇ 16 size.
  • the coding unit may be partitioned into a quad-tree form.
  • a horizontal or vertical size of the two coding units may be a half of a horizontal or vertical size of the coding unit before being partitioned.
  • each of two partitioned coding units may have a size of 16 ⁇ 32.
  • the coding unit is partitioned in a binary-tree form.
  • An LCU 310 of FIG. 3 is an example of an LCU to which both of partitioning of a quad-tree form and partitioning of a binary-tree form are applied.
  • FIG. 4 is a diagram illustrating an embodiment of an inter-picture prediction process.
  • a rectangle may represent a picture.
  • an arrow represents a prediction direction.
  • Pictures may be categorized into intra pictures (I pictures), predictive pictures (P pictures), and Bi-predictive pictures (B pictures) according to the encoding type thereof.
  • the I picture may be encoded through intra-prediction without requiring inter-picture prediction.
  • the P picture may be encoded through inter-picture prediction by using a reference picture that is present in one direction (i.e., forward direction or backward direction) with respect to a current block.
  • the B picture may be encoded through inter-picture prediction by using reference pictures that are present in two directions (i.e., forward direction and backward direction) with respect to a current block.
  • the encoder may perform inter-picture prediction or motion compensation and the decoder may perform the corresponding motion compensation.
  • the inter-picture prediction or motion compensation may be performed using a reference picture and motion information.
  • Motion information of a current block may be derived during inter-picture prediction by each of the encoding apparatus 100 and the decoding apparatus 200 .
  • the motion information of the current block may be derived by using motion information of a reconstructed neighboring block, motion information of a collocated block (also referred to as a col block or a co-located block), and/or a block adjacent to the co-located block.
  • the co-located block may mean a block that is located spatially at the same position as the current block, within a previously reconstructed collocated picture (also referred to as a col picture or a co-located picture).
  • the co-located picture may be one picture among one or more reference pictures included in a reference picture list.
  • a method of deriving the motion information of the current block may vary depending on a prediction mode of the current block.
  • prediction modes for inter-picture prediction there may be an AMVP mode, a merge mode, a skip mode, a current picture reference mode, etc.
  • the merge mode may be referred to as a motion merge mode.
  • At least one of motion vectors of the reconstructed neighboring blocks, motion vectors of the co-located blocks, motion vectors of blocks adjacent to the co-located blocks, and a (0, 0) motion vector may be determined as motion vector candidates for the current block, and a motion vector candidate list is generated by using the emotion vector candidates.
  • the motion vector candidate of the current block can be derived by 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 vectors of the collocated blocks or the motion vectors of the blocks adjacent to the collocated blocks may be referred to as temporal motion vector candidates, and the motion vectors of the reconstructed neighboring blocks may be referred to as spatial motion vector candidates.
  • the encoding apparatus 100 may calculate a motion vector difference (MVD) between the motion vector of the current block and the motion vector candidate and may perform entropy encoding on the motion vector difference (MVD).
  • the encoding apparatus 100 may perform entropy encoding on a motion vector candidate index and generate a bitstream.
  • the motion vector candidate index may indicate an optimum motion vector candidate among the motion vector candidates included in the motion vector candidate list.
  • the decoding apparatus may perform entropy decoding on the motion vector candidate index included in the bitstream and may select a motion vector candidate of a decoding target block from among the motion vector candidates included in the motion vector candidate list by using the entropy-decoded motion vector candidate index.
  • the decoding apparatus 200 may add the entropy-decoded MVD and the motion vector candidate extracted through the entropy decoding, thereby deriving the motion vector of the decoding target block.
  • the bitstream may include a reference picture index indicating a reference picture.
  • the reference picture index may be entropy-encoded by the encoding apparatus 100 and then signaled as a bitstream to the decoding apparatus 200 .
  • the decoding apparatus 200 may generate a prediction block of the decoding target block based on the derived motion vector and the reference picture index information.
  • the merge mode may mean a method of merging motion of a plurality of blocks.
  • the merge mode may mean a mode of deriving the motion information of the current block from the motion information of the neighboring blocks.
  • the merge candidate list may be generated using the motion information of the reconstructed neighboring blocks and/or the motion information of the collocated blocks.
  • the motion information may include at least one of a motion vector, a reference picture index, and an inter-picture prediction indicator.
  • the prediction indicator may indicate one-direction prediction (L 0 prediction or L 1 prediction) or two-direction predictions (L 0 prediction and L 1 prediction).
  • the merge candidate list may be a list of motion information stored.
  • the motion information included in the merge candidate list may be at least either one of the zero merge candidate and new motion information that is a combination of the motion information (spatial merge candidate) of one neighboring block adjacent to the current block, the motion information (temporal merge candidate) of the collocated block of the current block, which is included within the reference picture, and the motion information exiting in the merge candidate list.
  • the encoding apparatus 100 may generate a bitstream by performing entropy encoding on at least one of a merge flag and a merge index and may signal the bitstream to the decoding apparatus 200 .
  • the merge flag may be information indicating whether or not to perform the merge mode for each block
  • the merge index may be information indicating that which neighboring block, among the neighboring blocks of the current block, is a merge target block.
  • the neighboring blocks of the current block may include a left neighboring block on the left side of the current block, an upper neighboring block disposed above the current block, and a temporal neighboring block temporally adjacent to the current block.
  • the skip mode may be a mode in which the motion information of the neighboring block is applied to the current block as it is.
  • the encoding apparatus 100 may perform entropy encoding on information of the fact that the motion information of which block is to be used as the motion information of the current block to generate a bit stream, and may signal the bitstream to the decoding apparatus 200 .
  • the encoding apparatus 100 may not signal a syntax element regarding at least any one of the motion vector difference information, the encoding block flag, and the transform coefficient level to the decoding apparatus 200 .
  • the current picture reference mode may mean a prediction mode in which a previously reconstructed region within a current picture to which the current block belongs is used for prediction.
  • a vector may be used to specify the previously-reconstructed region.
  • Information indicating whether the current block is to be encoded in the current picture reference mode may be encoded by using the reference picture index of the current block.
  • the flag or index indicating whether or not the current block is a block encoded in the current picture reference mode may be signaled, and may be deduced based on the reference picture index of the current block.
  • the current picture may be added to the reference picture list for the current block so as to be located at a fixed position or a random position in the reference picture list.
  • the fixed position may be, for example, a position indicated by a reference picture index of 0 , or the last position in the list.
  • the reference picture index indicating the random position may be signaled.
  • FIG. 5 is a flowchart illustrating a method for encoding an image according to an embodiment of the present invention.
  • FIG. 6 is a flowchart illustrating a method for decoding an image according to an embodiment of the present invention.
  • the encoding apparatus may derive merge candidates at step S 501 , and may generate a merge candidate list based on the derived merge candidates.
  • motion information may be determined using the generated merge candidate list at step S 502 , and motion compensation of the current block may be performed using the determined motion information at step S 503 .
  • the encoding apparatus may perform entropy encoding on information about motion compensation at step S 504 .
  • the decoding apparatus may perform entropy decoding on the information about motion compensation received from the encoding apparatus at step S 601 , may derive the merge candidates at step S 602 , and may generate the merge candidate list based on the derived merge candidates.
  • motion information of the current block may be determined using the generated merge candidate list at step S 603 .
  • the decoding apparatus may perform motion compensation using motion information at step S 604 .
  • FIGS. 5 and 6 show examples to which the merge mode described in FIG. 4 is applied.
  • the merge candidate for the current block may include at least one of a spatial merge candidate, a temporal merge candidate, and an additional merge candidate.
  • deriving of the spatial merge candidate may mean deriving the spatial merge candidate and adding the spatial merge candidate to the merge candidate list.
  • FIG. 7 is a view illustrating an example of deriving a spatial merge candidate and a temporal merge candidate of a current block.
  • the spatial merge candidate of the current block may be derived from neighboring blocks adjacent to a current block X.
  • the neighboring blocks adjacent to the current block may include at least one of a block B 1 adjacent to the top of the current block, a block A 1 adjacent to the left of the current block, a block B 0 adjacent to the upper right corner of the current block, a block B 2 adjacent to the upper left corner of the current block, and a block A 0 adjacent to the lower left corner of the current block.
  • whether or not the neighbor block adjacent to the current block can be used in deriving the spatial merge candidate of the current block may be determined.
  • whether or not the neighbor block adjacent to the current block can be used in deriving the spatial merge candidate of the current block may be determined according to predetermined priorities. For example, in the example shown in FIG. 7 , availability of deriving the spatial merge candidate may be determined in the order of blocks at the locations A 1 , B 1 , B 0 , A 0 , and B 2 .
  • the spatial merge candidates determined based on the order for determining availability may be added to the merge candidate list of the current block in sequence.
  • the derived spatial merge candidates may be added to the merge candidate list in order.
  • the spatial merge candidates may be derived based on at least one of coding parameters.
  • motion information of the spatial merge candidates may include at least three pieces of motion information, such as motion information of the L 0 , L 1 , L 2 , L 3 , etc.
  • the reference picture list may include at least one of L 0 , L 1 , L 2 , L 3 , etc.
  • the temporal merge candidate of the current block may be derived from a reconstructed block included in a collocated picture of the current picture.
  • the collocated picture is a picture where encoding/decoding is completed before the current picture, and may be a picture having a temporal order different from that of the current picture.
  • Deriving of the temporal merge candidate may mean deriving the temporal merge candidate and adding the temporal merge candidate to the merge candidate list.
  • a temporal merge candidate of the current block may be derived from a block including an outer location of a block corresponding to spatially the same location as a current block X or from a block including an inner location of a block corresponding to spatially the same location as the current block X.
  • the temporal merge candidate may mean motion information of a collocated block.
  • the temporal merge candidate of the current block X may be derived from a block H adjacent to the lower right corner of a block C corresponding to spatially the same location as the current block or from a block C 3 including the central point of the block C.
  • the block H or block C 3 , etc. used to derive the temporal merge candidate of the current block may be referred to as ‘a collocated block’.
  • the block H When the temporal merge candidate of the current block can be derived from a block H including an outer location of the block C, the block H may be set as a collocated block of the current block. In this case, the temporal merge candidate of the current block may be derived based on motion information of the block H. In contrast, when the temporal merge candidate of the current block cannot be derived from the block H, the block C 3 including an inner location of the block C may be set as a collocated block of the current block. In this case, the temporal merge candidate of the current block may be derived based on motion information of the block C 3 .
  • the temporal merge candidate for the current block may not be derived or may be derived from a block having different location from the block H and the block C 3 .
  • the temporal merge candidate of the current block may be derived from multiple blocks in a collocated picture.
  • multiple temporal merge candidates for the current block may be derived from the block H and the block C 3 .
  • a motion vector of the temporal merge candidate of the current block may be obtained by scaling a motion vector of the collocated block.
  • scaling may be performed based on at least one of the distance between the current picture and the reference picture referenced by the current block, and the distance between the collocated picture and the reference picture referenced by the collocated block.
  • the motion vector of the collocated block is scaled, thereby deriving the motion vector of the temporal merge candidate of the current block.
  • At least one of the temporal merge candidate, the collocated picture, the collocated block, the prediction list utilization flag, and the reference picture index may be derived based on at least one of coding parameters of the current block, the neighbor block, and the collocated block.
  • At least one of the spatial merge candidates and the temporal merge candidates is derived, and then the derived merge candidate is added to the merge candidate list according to the derived order, whereby the merge candidate list can be generated.
  • the additional merge candidate may mean 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.
  • the deriving of the additional merge candidate may mean deriving the additional merge candidate and adding the additional merge candidate to the merge candidate list.
  • the modified spatial merge candidate may mean a merge candidate in which at least one piece of motion information of the derived spatial merge candidate is modified.
  • the modified temporal merge candidate may mean a merge candidate in which at least one piece of motion information of the derived temporal merge candidate is modified.
  • the combined merge candidate may mean a merge candidate derived by combining at least one piece of motion information among motion information of the spatial merge candidate, the temporal merge candidate, the modified spatial merge candidate, the modified temporal merge candidate, the combined merge candidate, and the merge candidates having the predetermined motion information value that exist in the merge candidate list.
  • the combined merge candidate may mean a merge candidate derived by combining at least one piece of motion information of a spatial merge candidate, a temporal merge candidate, a modified spatial merge candidate, a modified temporal merge candidate, a combined merge candidate, and a merge candidate having a predetermined motion information value.
  • the spatial merge candidate and the temporal merge candidate are derived from a block that does not exist in the merge candidate list but can be used to derive at least one of the spatial merge candidate and the temporal merge candidate.
  • the modified spatial merge candidate and the modified temporal merge candidate are generated based on the spatial merge candidate and the temporal merge candidate.
  • the combined merge candidate may be derived using entropy-decoded motion information from the bitstream in the decoder.
  • motion information used in deriving the combined merge candidate in the encoder may be entropy encoded in the bitstream.
  • the combined merge candidate may mean a combined bi-prediction merge candidate.
  • the combined bi-prediction merge candidate is a merge candidate using bi-prediction, and may mean a merge candidate having L 0 motion information and L 1 motion information.
  • a merge candidate having a predetermined motion information value may mean a zero merge candidate having a motion vector of (0, 0).
  • the merge candidate having the predetermined motion information value may be set to have the same value in the encoding apparatus and the decoding apparatus.
  • At least one of the modified spatial merge candidate, the modified temporal merge candidate, the combined merge candidate, and the merge candidate having the predetermined motion information value may be derived or generated based on at least one of coding parameters of the current block, the neighbor block, or the collocated block. Also, at least one of the modified spatial merge candidate, the modified temporal merge candidate, the combined merge candidate, and the merge candidate having the predetermined motion information value may be added to the merge candidate list based on at least one coding parameters of the current block, the neighbor block, or the collocated block.
  • the size of the merge candidate list may be determined based on the coding parameter of the current block, the neighbor block, or the collocated block, and may differ depending on the coding parameter.
  • a refined motion vector derived using a motion vector refining method may be used in deriving the merge candidate. Detailed description thereof will be described later with reference to FIGS. 7 to 28 .
  • the encoder may determine a merge candidate being used in 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 a bitstream.
  • merge_idx merge candidate index
  • the encoder may select a merge candidate from the merge candidate list based on the merge candidate index to determine motion information of the current 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 a merge candidate of 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 may be used in motion compensation of the current block.
  • motion compensation may mean inter prediction.
  • the encoding apparatus and the decoding apparatus may perform inter prediction or motion compensation using the determined motion information at step S 503 and S 604 .
  • the current block may contain motion information of the determined merge candidate.
  • the current block may have at least one motion vector up to at most N motion vectors depending on a prediction direction. At least one prediction block up to at most N prediction blocks may be generated using the motion vector to derive a final 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.
  • multiple prediction blocks may be generated using multiple motion vectors (or motion information), and the final prediction block of the current block may be determined based on a weighted sum of the multiple prediction blocks.
  • Reference pictures including multiple prediction blocks indicated by multiple motion vectors (or motion information) may be included in different reference picture lists, and may be included in the same reference picture list.
  • a plurality of prediction blocks may be generated based on at least one of a spatial motion vector candidate, a temporal motion vector candidate, a motion vector having a predetermined value, and a combined motion vector candidate.
  • the final prediction block of the current block may be determined based on the weighted sum of the plurality of prediction blocks.
  • a plurality of prediction blocks may be generated based on motion vector candidates indicated by a preset motion vector candidate index.
  • the final prediction block of the current block may be determined based on the weighted sum of the plurality of prediction blocks.
  • a plurality of prediction blocks may be generated based on motion vector candidates that exist in a preset motion vector candidate index range.
  • the final prediction block of the current block may be determined based on the weighted sum of the plurality of prediction blocks.
  • a weighting factor being applied to each prediction block may have the same value by 1/N (here, N is the number of generated prediction blocks). For example, when two prediction blocks are generated, a weighting factor being applied to each prediction block may be 1 ⁇ 2. When three prediction blocks are generated, a weighting factor being applied to each prediction block may be 1 ⁇ 3. When four prediction blocks are generated, a weighting factor being applied to each prediction block may be 1 ⁇ 4. Alternatively, the final prediction block of the current block may be determined by assigning different weighting factors to respective prediction blocks.
  • the weighting factor does not have to have a fixed value for each prediction block, and may have a variable value for each prediction block.
  • the weighting factors being applied to respective prediction blocks may be the same, or may be different.
  • weighting factors being applied to the two prediction blocks may be a variable value for each block such as (1 ⁇ 2, 1 ⁇ 2), (1 ⁇ 3, 2 ⁇ 3), (1 ⁇ 4, 3 ⁇ 4), (2 ⁇ 5, 3 ⁇ 5), (3 ⁇ 8, 5 ⁇ 8), etc.
  • the weighting factor may be a positive real number and a negative real number.
  • the weighting factor may be a negative real number such as ( ⁇ 1 ⁇ 2, 3/2), ( ⁇ 1 ⁇ 3, 4/3), ( ⁇ 1 ⁇ 4, 5/4), etc.
  • one or more pieces of weighting factor information for the current block may be signaled through a bitstream.
  • the weighting factor information may be signaled for each prediction block, and may be signaled for each reference picture. Multiple prediction blocks may share one piece of weighting factor information.
  • the encoding apparatus and the decoding apparatus may determine whether or not the predicted motion vector (or motion information) is used based on a prediction block list utilization flag. For example, when the prediction block list utilization flag indicates one, which is the first value, for each reference picture list, it may indicate that the encoding apparatus and the decoding apparatus can use the predicted motion vector of the current block to perform inter prediction or motion compensation. When the prediction block list utilization flag indicates zero which is the second value, it may indicate that the encoding apparatus and the decoding apparatus do not perform inter prediction or motion compensation by using the predicted motion vector of the current block. In the meantime, the first value of the prediction block list utilization flag may be set to zero, and the second value thereof may be set to one.
  • Formulas 1 to 3 described below indicate an example of generating a final prediction block of the current block when inter-prediction indicators of the current block are PRED_BI, PRED_TRI, and PRED_QUAD and a prediction direction for each reference picture list is uni-directional.
  • P _ BI WF _ L 0 *P _ L 0+OFFSET_ L 0 +WF _ L 1 *P _ L 1+OFFSET_ L 1 +RF )>>1
  • P _ TRI ( WF _ L 0 *P _ L 0+OFFSET_ L 0 +WF _ L 1 *P _ L 1+OFFSET_ L 1 +WF _ L 2 *P _ L 2+OFFSET_ L 2 +RF )/3
  • P _QUAD ( WF - L 0 *P _ L 0+OFFSET_ L 0 +WF _ L 1 *P - L 1+OFFSET_ L 1 +WF _ L 2 *P _ L 2+OFFSET_ L 2 +WF _ L 3 *P _ L 3+OFFSET_ L 3 +RF )>2
  • P_BI, P_TRI, and P_QUAD may indicate the final prediction block of the current block
  • WF_LX may indicate a weighting factor value of a prediction block generated by using the LX
  • OFFSET_LX may indicate an offset value for the prediction block generated by using the LX
  • P_LX may mean a prediction block generated by using a motion vector (or motion information) for the LX of the current block.
  • RF may mean a rounding factor that may be set to zero, a positive number, or a negative number.
  • the LX reference picture list may include at least one of a long-term reference picture, a reference picture on which deblocking filter is not performed, a reference picture on which sample adaptive offset is not performed, a reference picture on which adaptive loop filter is not performed, a reference picture on which deblocking filter and adaptive offset are performed, a reference picture on which deblocking filter and adaptive loop filter is performed, a reference picture on which sample adaptive offset and adaptive loop filter are performed, and a reference picture on which deblocking filter, sample adaptive offset, and adaptive loop filter are performed.
  • the LX reference picture list may be at least one of an L 2 reference picture list and an L 3 reference picture list.
  • the final prediction block for the current block may be obtained based on a weighted sum of prediction blocks.
  • weighting factors being applied to prediction blocks derived from the same reference picture list may have the same values, or may have different values.
  • At least one of a weighting factor (WF_LX) and an offset (OFFSET_LX) for multiple prediction blocks may be a coding parameter being entropy encoded/decoded.
  • the weighting factor and the offset may be derived from an encoded/decoded neighboring block adjacent to the current block.
  • the neighboring block adjacent to the current block may include at least one of a block used for deriving the spatial motion vector candidate of the current block or a block used for deriving the temporal motion vector candidate of the current block.
  • the weighting factor and the offset may be determined based on a display order of a current picture and reference pictures (POC).
  • POC current picture and reference pictures
  • the weighting factor or the offset may be set to a small value.
  • the weighting factor or the offset may be set to a large value. For example, when a POC difference between the current picture and an L 0 reference picture is 2, a weighting factor value being applied to a prediction block generated by referring to the L 0 reference picture may be set to 1 ⁇ 3.
  • a weighting factor value being applied to a prediction block generated by referring to the L 0 reference picture may be set to 2 ⁇ 3.
  • the weighting factor or offset value may have an inverse relation with the display order difference between the current picture and the reference picture.
  • the weighting factor or offset value may have a proportional relation with the display order difference between the current picture and the reference picture.
  • At least one of the weighting factor or the offset may be entropy encoded/decoded. Also, based on at least one of coding parameters, a weighted sum of prediction blocks may be calculated.
  • the weighted sum of a plurality of prediction blocks may be applied to only a partial area in the prediction block.
  • the partial area may be an area corresponding to the boundary in the prediction block.
  • the weighted sum may be applied for each sub-block of the prediction block.
  • inter prediction or motion compensation may be performed using the same prediction block or the same final prediction block.
  • inter prediction or motion compensation may be performed using the same prediction block or the same final prediction block.
  • the weighted sum may be calculated using at least one motion vector candidate existing in the motion vector candidate list, and may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using the spatial motion vector candidates may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using the spatial motion vector candidates and the temporal motion vector candidates may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using the combined motion vector candidates may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using motion vector candidates having particular motion vector candidate indexes may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using motion vector candidates existing in a particular motion vector candidate index range may be calculated, 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 existing in the merge candidate list, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using the spatial merge candidates may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using the spatial merge candidates and the temporal merge candidates may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using the combined merge candidates may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using merge candidates having particular merge candidate indexes may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • the weighted sum of prediction blocks generated by using merge candidates existing in a particular merge candidate index range may be calculated, and the calculated weighted sum may be used as the final prediction block of the current block.
  • motion compensation may be performed using the motion vector/information of the current block.
  • the final prediction block which is the result of motion compensation, may be generated using at least one prediction block.
  • the current block may mean at least one of a current coding block and a current prediction block.
  • the encoding apparatus may entropy encode the information about motion compensation through a bitstream, and the decoding apparatus may entropy decode the information about motion compensation included in the bitstream.
  • the information about motion compensation being entropy encoded/decoded may include at least one of an inter-prediction indicator (inter_pred_idc), a reference picture index (ref_idx_ 10 , ref_idx_ 11 , ref_idx_ 12 , ref_idx_ 13 ), a motion vector candidate index (mvp_ 10 _idx, mvp_l 1 _idx, mvp_ 12 _idx, mvp_ 13 _idx), a motion vector difference, information on whether or not a skip mode is used (cu_skip_flag), information on whether or not a merge mode is used (merge_flag), merge index information (merge_index), information on whether or not merge mode-based motion vector refining is used (f
  • the inter-prediction indicator may mean inter-prediction direction or the number of prediction directions of the current block when the current block is encoded/decoded through inter prediction.
  • the inter-prediction indicator may indicate uni-directional prediction, or multi-directional prediction such as bi-directional prediction, tri-directional prediction, or quad-directional prediction, etc.
  • the inter-prediction indicator may mean the number of reference pictures that are used when the current block generates the prediction block. Alternatively, one reference picture may be used for multi-directional prediction. In this case, M reference pictures are used to perform N-directional prediction (N>M).
  • the inter-prediction indicator may mean the number of prediction blocks that are used when performing inter prediction or motion compensation for the current block.
  • a reference picture indicator may indicate a uni-direction (PRED_LX), a bi-direction (PRED_BI), a tri-direction (PRED_TRI), a quad-direction (PRED_QUAD), or greater direction depending on the number of prediction directions of the current block.
  • a prediction list utilization flag indicates whether or not the prediction block is generated by using the reference picture list.
  • the reference picture index may specify a reference picture being referenced by the current block in each reference picture list. At least one reference picture index may be entropy encoded/decoded for each reference picture list. Motion compensation may be performed on the current block by using at least one reference picture index.
  • the motion vector candidate index indicates a motion vector candidate for the current block in a motion vector candidate list generated for each reference picture list or for each reference picture index. At least one motion vector candidate index for each motion vector candidate list may be entropy encoded/decoded. Motion compensation may be performed on the current block by using at least one motion vector candidate index.
  • the motion vector difference indicates a difference value between a motion vector and a predicted motion vector.
  • At least one motion vector difference may be entropy encoded/decoded for the motion vector candidate list generated for each reference picture list or each reference picture index for the current block.
  • Motion compensation may be performed on the current block by using at least one motion vector difference.
  • cu_skip_flag When information on whether or not a skip mode is used (cu_skip_flag) has the first value of one, it may indicate the use of the skip mode. When it has the second value of zero, it may not indicate the use of the skip mode. Motion compensation of the current block may be performed using the skip mode based on the information on whether or not a skip mode is used.
  • merge_flag When information on whether or not a merge mode is used (merge_flag) has the first value of one, it may indicate the use of the merge mode. When it has the second value of zero, it may not indicate the use of the merge mode. Motion compensation of the current block may be performed using the merge mode based on the information on whether or not a merge mode is used.
  • the merge index information 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 that derived a merge candidate among reconstructed blocks spatially/temporally adjacent to the current block.
  • the merge index information may indicate at least one piece of motion information of the merge candidate.
  • the merge index information when it has the first value of zero, it may indicate the first merge candidate in the merge candidate list.
  • it has the second value of one it may indicate the second merge candidate in the merge candidate list.
  • it has the third value of two it may indicate the third merge candidate in the merge candidate list.
  • it has the fourth value to the N-th value it may indicate the merge candidate corresponding to the value according to the order in the merge candidate list.
  • N may mean a positive integer including zero.
  • Motion compensation of the current block may be performed using the merge mode based on the merge index information.
  • Information on whether or not merge mode-based motion vector refining is used may mean information indicating whether or not merge mode-based motion vector refining is used.
  • the information may be entropy encoded/decoded in at least one of a coding block and a prediction block.
  • the information on whether or not merge mode-based motion vector refining is used has the first value of one, it may indicate the use of the motion vector based on the merge mode.
  • it may not indicate the use of the motion vector based on the merge mode.
  • the first value and the second value may differ.
  • motion vector refining may be determined based on other inter prediction modes (e.g., the skip mode, the AMVP mode, etc.) that are pre-defined in the encoder/decoder. That is, even when fruc_flag is not explicitly signaled, motion vector refining may be selectively used under a predetermined condition.
  • other inter prediction modes e.g., the skip mode, the AMVP mode, etc.
  • the information on whether or not merge mode-based motion vector refining is used may be entropy decoded, when information on whether or not a merge mode is used (merge_flag) has the first value indicating the use of the merge mode.
  • the final prediction block for the current block may be generated through a weighted sum for each prediction block.
  • a weighting factor and an offset may be applied for each prediction block.
  • a weighted sum factor such as the weighting factor or the offset, etc. used in calculating a weighted sum may be entropy encoded/decoded for at least one of a reference picture list, a reference picture, a motion vector candidate index, a motion vector difference, a motion vector, information on whether or not a skip mode is used, information on whether or not a merge mode is used, and merge index information.
  • a weighted sum factor of each prediction block may be entropy encoded/decoded based on an inter prediction indicator.
  • the weighted sum factor may include at least one of a weighting factor and offset.
  • motion compensation may be performed on all or some blocks existing in the CTU by using information on the motion compensation depending on a value of information on motion compensation.
  • information on motion compensation may be entropy encoded/decoded based on at least one of the size and the depth of the predetermined block.
  • information on the size or the depth of the predetermined block may be entropy encoded/decoded.
  • information on the size or the depth of the predetermined block may be determined based on at least one of a preset value in the encoder and the decoder and a coding parameter or based at least one of another syntax element values.
  • Information on motion compensation may be entropy encoded/decoded in only a block that is larger than or equal to the predetermined block in size, and information on motion compensation may not be entropy encoded/decoded in a block that is smaller than the predetermined block in size.
  • motion compensation may be performed on sub-blocks in a block that is larger than or equal to the predetermined block in size based on information on motion compensation that is entropy encoded/decoded in a block that is larger than or equal to the predetermined block in size. That is, sub-blocks in a block that is larger than or equal to the predetermined block in size may share information on motion compensation including a motion vector candidate, a motion vector candidate list, a merge candidate, a merge candidate list, etc.
  • Information on motion compensation may be entropy encoded/decoded in only a block that is shallower than or equal to the predetermined block in depth, and information on motion compensation may not be entropy encoded/decoded in a block that is deeper than the predetermined block in depth.
  • motion compensation may be performed on sub-blocks in a block that is shallower than or equal to the predetermined block in depth based on information on motion compensation entropy encoded/decoded in a block that is shallower than or equal to the predetermined block in depth. That is, sub-blocks in a block that is shallower than or equal to the predetermined block in depth may share information on motion compensation including a motion vector candidate, a motion vector candidate list, a merge candidate, a merge candidate list, etc.
  • Information on motion compensation may be entropy encoded/decoded by a block unit, and may be entropy encoded/decoded at a higher level.
  • information on motion compensation may be entropy encoded/decoded by a block unit such as a CTU, a CU, or a PU, etc., or may be entropy encoded/decoded at a higher level such as a video parameter set, a sequence parameter set, a picture parameter set, a adaptation parameter set, or a slice header, etc.
  • Information on motion compensation may be entropy encoded/decoded based on an information difference value on motion compensation indicating a difference value between information on motion compensation and an information prediction value on motion compensation.
  • information on motion compensation of an encoded/decoded block adjacent to the current block may be used as information on motion compensation of the current block.
  • At least one piece of information on motion compensation may be derived.
  • At least one piece of information on motion compensation may be entropy decoded from a bitstream based on at least one of coding parameters. At least one piece of information on motion compensation may be entropy encoded in a bitstream based on at least one of coding parameters.
  • Information on motion compensation may further include at least one of a motion vector, a motion vector candidate, a motion vector candidate index, a motion vector difference value, a motion vector prediction value, information on whether or not a skip mode is used (skip_flag), information on whether or not a merge mode is used (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-side motion vector derivation information, and bi-directional optical flow information.
  • the decoder-side motion vector derivation may mean pattern matched motion vector derivation.
  • Motion vector resolution information may be information indicating whether or not particular resolution is used for at least one of a motion vector and a motion vector difference value.
  • resolution may mean precision.
  • particular resolution may set to at least one of a 16-pixel (16-pel) unit, a 8-pixel (8-pel) unit, a 4-pixel (4-pel) unit, an integer-pixel (integer-pel) unit, a 1 ⁇ 2-pixel (1 ⁇ 2-pel) unit, a 1 ⁇ 4-pixel (1 ⁇ 4-pel) unit, a 1 ⁇ 8-pixel (1 ⁇ 8-pel) unit, a 1/16-pixel ( 1/16-pel) unit, a 1/32-pixel ( 1/32-pel) unit, and a 1/64-pixel ( 1/64-pel) unit.
  • Overlapped block motion compensation information may be information indicating whether or not the weighted sum of the prediction block of the current block is calculated by using a motion vector of the neighbor block spatially adjacent to the current block during motion compensation of the current block.
  • Local illumination compensation information may be information indicating whether or not at least one of a weighting factor value and an offset value is applied when generating the prediction block of the current block.
  • at least one of the weighting factor value and the offset value may be a value calculated based on a reference block.
  • Affine motion compensation information may be information indicating whether or not an affine motion model is used during motion compensation of the current block.
  • the affine motion model may be a model for partitioning one block into several sub-blocks by using a plurality of parameters, and calculating motion vectors of the partitioned sub-blocks by using representative motion vectors.
  • Decoder-side motion vector derivation information may be information indicating whether or not a motion vector required for motion compensation is used by being derived by the decoder. Information on a motion vector may not be entropy encoded/decoded based on decoder-side motion vector derivation information. Also, when decoder-side motion vector derivation information indicates that the decoder derives and uses a motion vector, information on a merge mode may be entropy encoded/decoded. That is, decoder-side motion vector derivation information may indicate whether or not a merge mode is used in the decoder.
  • Bi-directional optical flow information may be information indicating whether or not motion compensation is performed by correcting a motion vector for each pixel or sub-block. Based on bi-directional optical flow information, a motion vector for each pixel or sub-block may not be entropy encoded/decoded. Here, motion vector correction may modify a motion vector value from a motion vector for each block into a motion vector for each pixel or sub-block.
  • Motion compensation is performed on the current block by using at least one piece of information on motion compensation, and at least one piece of information on motion compensation may be entropy encoded/decoded.
  • a binarization method such as a truncated rice binarization method, a K-th order Exp_Golomb binarization method, a limited K-th order Exp_Golomb binarization method, a fixed-length binarization method, a unary binarization method or a truncated unary binarization method, etc. may be used.
  • a context model may be determined by using at least one piece of information about motion compensation of a neighboring block adjacent to the current block or area information of the neighbor block, information about previously encoded/decoded motion compensation or previously encoded/decoded area information, information about the depth of the current block, and information about the size of the current block.
  • entropy encoding/decoding may be performed by using at least one piece of information about motion compensation of a neighboring block, information about previously encoded/decoded motion compensation, information about the depth of the current block, and information about the size of the current block as a prediction value for information about motion compensation of the current block.
  • the motion vector of the current block may be derived using at least one of a method of deriving a motion vector based on a skip/merge mode and a method of deriving a motion vector using an enhanced motion vector prediction mode.
  • deriving of the motion vector may include deriving the motion vector of the current block as well as deriving reference picture index information of the current block.
  • the merge mode-based motion vector refining method may include at least one step of deriving an initial motion vector, deriving a refined motion vector based on the initial motion vector, and deriving a refined motion vector in sub-block units.
  • the initial motion vector for the current block may be derived using the merge candidate of the merge candidate list derived from at least one of the spatial neighbor block and the temporal neighbor block.
  • an additional merge candidate list may be configured for merge mode-based motion vector refining.
  • FIG. 8 is a view illustrating spatial neighbor blocks and temporal neighbor blocks for configuring an additional merge candidate list.
  • a predetermined number of candidates from the spatial neighbor blocks A 0 , A 1 , A 2 , B 0 , B 1 , B 2 , and B 3 are included the additional merge candidate list in the order of A 1 , B 1 , B 0 , A 0 , B 2 , B 3 , and A 2 , and then a candidate derived from the temporal neighbor block, a combined bi-prediction merge candidate, and a zero merge candidate are included in the additional merge candidate list so as to derive the initial motion vector.
  • the initial motion vector for the current block may be derived using all or some merge candidates of the merge candidate list.
  • the merge candidate may replace motion information derived from an additional spatial neighbor block and/or temporal neighbor block in configuring the merge candidate list may not be used as the initial motion vector.
  • FIGS. 9 and 10 are views illustrating configurations of an initial motion vector list.
  • an initial motion vector list of the corresponding list direction may be configured as shown in FIG. 10 .
  • the initial motion vector list may include at least one of the motion vector and the reference picture index.
  • the initial motion vector list may use only the motion vector of the merge candidate list, and the reference picture index may use a fixed predetermined value.
  • the fixed predetermined value may be a value signaled from the encoder to the decoder, or may be a value set in the encoder and the decoder in common.
  • reference picture index information of the merge candidate of the merge candidate list is different from reference picture index information of the initial motion vector list
  • a motion vector scaled in consideration of the temporal distance (or the POC difference) may be used as the initial motion vector.
  • FIG. 11 is a view illustrating a method of deriving an initial motion vector using merge index information.
  • motion information of the merge candidate corresponding to the merge index information may be used as the initial motion vector.
  • the L 0 list [motion vector: (3, 1), reference picture index: 0 ] and the L 1 list [motion vector: ( ⁇ 3, 1), reference picture index: 0 ] that are the fourth candidates in the merge candidate list may be derived as the initial motion vectors of respective list directions.
  • the merge index information may be index information for the merge mode.
  • initial motion vector index information used for merge mode-based motion vector refining may be further defined, and it may be entropy encoded/decoded for each encoding/decoding block.
  • the motion vector of the merge candidate corresponding to a predetermined number may be set as the initial motion vector without entropy decoding the merge index information.
  • the predetermined number may be a number set in the encoder and the decoder in common.
  • the L 0 list [motion vector: (3, 1), reference picture index: 0 ] and the L 1 list [motion vector: ( ⁇ 2, 0), reference picture index: 0 ] that are the first candidates of the merge candidate list in FIG. 11 may be used as the initial motion vectors of L 0 /L 1 list directions.
  • motion information derived based on existing motion information may be used as additional initial motion information.
  • the existing motion information may be motion information of another merge candidate in the same list.
  • an additional initial motion vector to replace non-existing motion information may be derived in consideration of at least one of the reference picture indicated by the existing motion information, the current picture including the current block, and the temporal distance (or the POC difference) between reference pictures in the list requiring motion information generation.
  • an additional initial motion vector to replace a non-existing motion vector may be derived performing at least one of mirroring and scaling an existing motion vector.
  • the L 0 motion vector mirrored based on the reference picture of the L 1 reference picture list having the POC difference the same as the POC difference between the reference picture indicated by the L 0 motion vector and the picture including the current block may be derived as the L 1 list motion vector.
  • a picture having the smallest POC difference from the current picture may be derived as the L 1 reference picture
  • the L 0 motion vector scaled in consideration of the POC difference between the L 0 reference picture and the current picture and the POC difference between the derived L 1 reference picture and the current picture may be derived as the L 1 direction motion vector.
  • FIG. 12 is a view illustrating motion vector mirroring.
  • the L 0 motion vector mirrored based on the reference picture of the L 1 reference picture list having the POC difference the same as the POC difference between the reference picture indicated by the L 0 motion vector and the picture including the current block may be derived as the L 1 list motion vector.
  • the POC difference between the two pictures may be calculated as 4. Since among reference pictures in the L 1 list direction, there is a picture having the POC difference of 4 from the current picture, the motion vector generated by mirroring the L 0 motion vector with respect to the relevant picture and the reference picture index of the relevant reference picture may be used as the L 1 motion information.
  • the L 1 motion vector generated by mirroring the L 0 motion vector in the L 1 list direction is (3, 1), and the L 1 reference picture index is 0.
  • FIG. 13 is a view illustrating motion vector scaling.
  • a picture having the smallest POC difference from the current picture may be derived as the L 1 reference picture, and the L 0 motion vector scaled in consideration of the POC difference between the L 0 reference picture and the current picture and the POC difference between the derived L 1 reference picture and the current picture may be derived as the L 1 direction motion vector.
  • the picture (POC 1 ) having the smallest POC difference from the current picture may be derived as the L 1 reference picture.
  • the L 0 motion vector scaled in consideration of the POC difference (tb) between the L 0 reference picture and the current picture and the POC difference (td) between the derived L 1 reference picture and the current picture may be derived as the L 1 direction motion vector.
  • the process of scaling the motion vector may be performed as follows.
  • td may mean the difference between the picture order count for the current picture and the picture order count for the L 1 reference picture of the current block.
  • tb may mean the difference between the picture order count for the current picture and the picture order count for the L 0 reference picture of the current block.
  • At least one of the td value and the tb value may be adjusted so that the td value or the tb value exists in a range of ⁇ 128 to 127.
  • the td value or the tb value when the td value or the tb value is less than ⁇ 128, the td value or the tb value may be adjusted to ⁇ 128, and when the td value or the tb value is greater than 127, the td value or the tb value may be adjusted to 127.
  • the td value or the tb value may not be adjusted. That is, clipping of the tb value or the tb value may be performed such that the tb value or the tb value is in the range of predetermined values.
  • the tx value may be determined as (16384+Abs(td/2))/td.
  • Abs( ) an absolute value function
  • the output value of the function is the absolute value of the input value.
  • the scaling factor DistScaleFactor may be determined as (tb*tx+32)>>6, and the value of DistScaleFactor may be adjusted to be in a range of ⁇ 1024 to 1023.
  • the scaled motion vector may be determined as Sign(DistScaleFactor*mv)*ffAbs(DistScaleFactor*my)+127)>>8).
  • Sign( ) s a function outputting sign information of a particular value.
  • Sign( ⁇ 1) outputs-.
  • An existing motion vector value before being scaled may be designated as my.
  • FIG. 14 is a view illustrating an example of deriving an additional motion vector when only one motion vector corresponding to an L 0 or L 1 list exists in a block where bi-prediction can be performed.
  • an additional motion vector may be derived from the merge candidate list of the prediction direction where a motion vector is absent.
  • n is a value set in the encoder/decoder in common, and may be a positive integer including 1.
  • FIG. 15 is a view illustrating an example of selecting a merge candidate having bi-directional motion information in a block where bi-prediction can be performed as an initial motion vector.
  • the merge candidate having bi-directional motion information in the merge candidate list may be used as the initial motion vector.
  • the candidate having the smallest merge index information may be used.
  • the motion vector corresponding to the merge candidate index of 3 having bi-directional motion information which can be used as first may be used as the initial motion vector.
  • motion information of the merge candidate selected by the existing merge index information may be derived as the initial motion vector.
  • motion refining may be performed based on the motion vector rounded to the near integer pixel position.
  • rounding to the integer pixel position may be performed through the following formula 4.
  • the shift value differs depending on the precision.
  • the shift value may be 4, and in the case of 1 ⁇ 8 motion vector precision, the shift value may be 3.
  • round MV ( x,y ) (( MV x +(1 ⁇ shift ⁇ 1))>>shift) ⁇ shift, (( MV y +(1 ⁇ shift ⁇ 1))>>shift) ⁇ shift [Formula 4]
  • the encoder/decoder may perform motion vector refining in block units using the derived initial motion vector.
  • the spatial neighbor block and/or the temporal neighbor block of the current block may be used in refining the initial motion vector.
  • a reconstruction pixel of the spatial neighbor block and/or the temporal neighbor block used in refining the motion vector may be defined as a template.
  • the encoder/decoder may configure the template with spatial neighbor reconstruction pixels of the current block, and may perform refining on the initial motion vector by using the template.
  • FIGS. 16 to 21 are views illustrating templates according to an embodiment of the present invention.
  • the template may be configured using pixels of the top and/or left neighbor reconstruction block of the current block as shown in FIG. 16 .
  • the template may be configured using only pixels of an available block.
  • the template when the top neighbor reconstruction block of the current block is unavailable as the picture boundary, the slice boundary, the tile boundary, or the CTU boundary, the template may be configured using only pixels of the left neighbor reconstruction block.
  • the template when the left neighbor reconstruction block of the current block is unavailable as the picture boundary, the slice boundary, the tile boundary, or the CTU boundary, the template may be configured using only pixels of the top neighbor reconstruction block.
  • unavailable pixels may be replaced with available pixels to configure the template.
  • the available pixel may be a neighbor pixel of the current block, a pixel derived applying an interpolation filter to neighbor pixels, or a pixel having a pre-defined value in the encoder/decoder.
  • the template may be configured using a prediction pixel value rather than a reconstructed pixel value.
  • the pixel value of the relevant position may be generated applying the interpolation filter.
  • a filter used in interpolation may be a bi-linear filter, an 8-tap DCT-IF filter, etc.
  • the encoder/decoder may use the same predetermined method, and information on the interpolation filter type may be signaled as being included in a bitstream.
  • the size of the template may be M ⁇ N and, M and N may be positive integers.
  • the size of the top template may be 64 ⁇ 4 and the size of the left template may be 4 ⁇ 32.
  • the length of the pixel may be calculated depending on the precision of the motion vector.
  • the pixel length of the template may be calculated as 4 pixels.
  • the sizes of the top template and the left template may be the same.
  • M of the top template when the size of the template is M ⁇ N, M of the top template may have a value greater than the width of the current block and N may have the pixel length fixed in the encoder/decoder.
  • N of the right template may have a value greater than the height of the current block, and M may have the pixel length fixed in the encoder/decoder.
  • the size of the top template may be 128 ⁇ 6 and the size of the left template may be 6 ⁇ 128.
  • the size of the template may be M ⁇ N, and M and N may be equal to the width/height of the current block.
  • the size of the left template may be 64 ⁇ 64 and the size of the top template may be 64 ⁇ 64.
  • the size of the template may be M ⁇ N, and the templates of opposite sizes may be used depending on the size or depth information of the current block.
  • the size of the top template may be 128 ⁇ 6 and the size of the left template may be 6 ⁇ 64.
  • the size of the top template may be 16 ⁇ 2 and the size of the left template may be 2 ⁇ 16.
  • template size information required in configuring the template may be signaled as being included in a bitstream.
  • FIG. 22 is a view illustrating an example of refining an initial motion vector by using a template.
  • the motion vector indicating a template minimizing the error with the neighbor template of the current block is searched for in the search area of the reference picture indicated by the initial motion vector, and the motion vector may be determined as the refined motion vector.
  • the template in the reference picture may be generated based on a particular search area including the pixel position indicated by the initial motion vector.
  • a particular search area centered on the pixel position indicated by the initial motion vector may be differently applied depending on a search method in cross, square, diamond, hexagon shapes, etc.
  • minimizing the error between the template in the reference picture and the neighbor template of the current block may mean minimizing the difference between the template in the reference picture and the neighbor template of the current block.
  • the error may be calculated in consideration of at least one of a distortion value and a cost value for the motion vector.
  • the weighting factor may have a negative number less than 0 or a positive number greater than 0.
  • the distortion value may be calculated using at least one of SAD and MR-SAD between templates.
  • SAD ⁇ i,j
  • MR - SAD ⁇ i,j
  • Ctp(i,j) may mean the left or top template pixel value of the current block
  • Ltp(i,j) may mean the left or top template pixel value in the reference picture
  • detlatDC may mean (the left template average pixel value of the current block—the left template average pixel value in the reference picture) or (the top template average pixel value of the current block—the top template average pixel value in the reference picture).
  • a new motion vector (nMV) indicating a template minimizing the error with the template of the current block may be found.
  • the refining process may not be further performed.
  • another new motion vector may be obtained and refined in a particular search area centered on the pixel position indicated by the new motion vector (nMV).
  • searching for a new motion vector may be repeated.
  • searching for the new motion vector may be limited based on information on the number of times of performing motion refining.
  • searching for the new motion vector may be limited to two times in total.
  • the information on the number of times of performing motion refining may be signaled as being included in a bitstream.
  • the number of times of performing motion refining may be a particular value that is preset in both the encoder and the decoder.
  • a refined motion vector for the motion vector may be obtained from each prediction direction.
  • search area information required to determine the search area may be signaled as being included in a bitstream.
  • the size of the particular search area may differ depending on the coding parameter, such as the picture type, the temporal layer, the block size, etc. For example, when the size of the search area of the picture corresponding to the highest layer can have a 1 integer pixel size, the size of the search area of the picture corresponding to the lower layers may have an 8 integer pixel size.
  • FIGS. 23 to 25 are views illustrating an example of refining an initial motion vector by using prediction blocks of a current block. Refining of the initial motion vector may be performed using the prediction blocs of the current block generated from the motion vector without using the template described in FIG. 22 .
  • the motion vector may be refined based on the difference between the prediction blocks in each reference picture indicated by the initial motion vector.
  • the prediction block may be positioned in a particular search range centered on the pixel position indicated by the initial motion vector.
  • the prediction block is generated from the motion vector derived from a particular search range, and the motion vector minimizing the difference between prediction blocks may be determined as the refined motion vector.
  • the difference between prediction blocks may mean the difference between multiple prediction blocks generated based on an initial motion vector in the L 0 direction (hereinafter, referred to as “an L 0 initial motion vector”) or an initial motion vector in the L 1 direction (hereinafter, referred to as “an L 1 initial motion vector”), or may mean the difference between prediction blocks respectively generated based on the L 0 initial motion vector and the L 1 initial motion vector.
  • the motion vector minimizing the error between the prediction block P 0 generated from the motion vector shifted within a particular search range centered on the pixel position in the L 0 reference picture indicated by the L 0 initial motion vector and the prediction block P 1 generated from the L 1 motion vector derived based on the L 0 motion vector may be determined as the refined motion vector.
  • the L 1 motion vector may be a motion vector derived by mirroring or scaling the initial L 0 motion vector or the L 0 motion vector shifted within the particular search range.
  • the motion vector minimizing the error between the prediction block P 1 generated from the motion vector shifted within a particular search range centered on the pixel position in the L 1 reference picture indicated by the L 1 initial motion vector and the prediction block P 0 generated from the L 0 motion vector derived based on the L 1 motion vector may be defined as the refined motion vector.
  • the L 0 motion vector may be a motion vector derived by mirroring or scaling an L 1 initial motion vector or the L 1 motion vector shifted within the particular search range.
  • x and y may be different positive integers including 0.
  • the L 0 motion vector mirrored based on the reference picture of the L 1 reference picture list having the same POC difference as the POC difference between the reference picture indicated by the L 0 motion vector and the picture having the current block may be derived as the L 1 directional motion vector.
  • the L 0 motion vector scaled in consideration of the POC difference based on a picture having the smallest POC difference from the current picture may be derived as the L 1 directional motion vector.
  • motion refining may be performing using the block generated by weighted summing of the prediction block generated from the L 0 initial motion vector and the prediction block generated from the L 1 initial motion vector.
  • the prediction block Ps generated by weighted summing of the prediction block P 0 generated from the L 0 initial motion vector and the prediction block P 1 generated from the L 1 initial motion vector may be set to a template.
  • the prediction block Pr 0 may be generated shifting the motion vector within a particular search range centered on the pixel position indicated by the L 0 initial motion vector.
  • the motion vector minimizing the error between the generated prediction block (Pr 0 ) and the template (Ps) may be determined as the refined motion vector in the L 0 list direction.
  • the prediction block (Pr 1 ) may be generated shifting the motion vector within a particular search range centered on the pixel position indicated by the L motion vector.
  • the motion vector minimizing the error between the generated prediction block (Pr 1 ) and the template (Ps) may be determined as the refined motion vector in the L 1 list direction.
  • a 1 and a 2 are weighting factors used in weighted summing.
  • the weighting factor is not limited to a fixed value, and may be a variable value.
  • the weighting factors applied to each prediction block may be the same or different from each other.
  • weighting factor information for a decoding target block may be signaled as being included in a bitstream.
  • only the prediction block P 0 generated from the L 0 initial motion vector may be set as a template.
  • the motion vector minimizing the error between the template and the prediction block Pr 0 generated shifting the motion vector within a particular search range centered on the pixel position indicated by the L 0 initial motion vector may be determined as the refined motion vector in the L 0 list direction.
  • the difference between prediction blocks may be calculated in consideration of at least one of a distortion value and a cost value for the motion vector.
  • the weighting factor may have a negative number less than 0 or a positive number greater than 0.
  • the distortion value may be calculated using at least one of SAD, SATD, and MR-SAD between prediction blocks.
  • the new motion vector (nMV) minimizing the error between the prediction blocks is searched for.
  • the refining process may not be further performed.
  • the error between the prediction blocks P 0 and P 1 obtained from the new motion vector (nMV) is less than the error between the prediction blocks P 0 and P 1 obtained from the refined motion vector (rMV)
  • another new motion vector is searched for in a particular search area centered on the pixel position indicated by the new motion vector (nMV) to refine the another new motion vector.
  • searching for a new motion vector may be repeated.
  • searching for the new motion vector may be limited based on the information on the number of times of performing motion refining.
  • searching for the new motion vector may be limited to two times in total.
  • the information on the number of times of performing motion refining may be signaled as being included in a bitstream.
  • the number of times of performing motion refining may be a particular value that is preset in both the encoder and the decoder.
  • the encoder/decoder may select one of the motion vector refining methods by using motion vector refining mode information (MV_REFINE_MODE) that indicates the motion vector refining method.
  • MV_REFINE_MODE motion vector refining mode information
  • the motion vector refining mode information (MV_REFINE_MODE) has the first value of 0, the motion vector may be refined using the neighbor template of the current block.
  • the motion vector refining mode information (MV_REFINE_MODE) has the second value of 1, the motion vector may be refined using the prediction blocks obtained from the motion vector.
  • the first value and the second value may be respectively set to 1 and 0.
  • the motion vector refining mode information may be signaled as being included in a bitstream.
  • the motion vector refining method may be determined depending on the coding parameter.
  • the motion vector when the initial motion vector of the current block has the uni-directional motion vector, the motion vector may be refined using the neighbor template.
  • the motion vector may be refined using a prediction block signal obtained from the motion vector.
  • the encoder/decoder may select the motion vector refining method by using the coding parameter rather than the motion vector refining mode information. For example, when the current block can use only the L 0 or L 1 motion vector, the motion vector can be refined using the neighbor template. When the current block can use both the L 0 and L 1 motion vectors, the motion vector of each prediction direction may be refined using, as the template, the prediction block generated by weighted summing the prediction block obtained from the motion vector. As another example, when the current block can use only the L 0 or L 1 motion vector, the motion vector can be refined using the neighbor template. When the current block can use both the L 0 and L 1 motion vectors, the motion vector of each prediction direction may be refined using the difference between prediction blocks obtained from the motion vector of each prediction direction.
  • the initial motion vector may be used as the motion vector of the current block without refining the initial motion vector.
  • the current block may be partitioned into one or more sub-blocks.
  • the current block may be partitioned into M*N sub-blocks by dividing the current block into N sub-blocks in the horizontal direction and M sub-blocks in the vertical direction.
  • M and N may be arbitrary integers equal to or greater than 1.
  • M and N may be the same or different integers.
  • the current block may be partitioned into W*H sub-blocks having W pixels in the horizontal direction and H pixels in the vertical direction.
  • W and H may be arbitrary integers equal to or greater than 2.
  • W and H may be the same or different integers.
  • the size of the sub-block may be determined depending on the size of the current block.
  • a 4 ⁇ 4 sub-block may be used.
  • a 8 ⁇ 8 sub-block may be used.
  • K is a positive integer, e.g., 256.
  • the size of the sub-block may be predetermined in the encoder and the decoder.
  • the size of the sub-block may be determined based on sub-block size information.
  • the sub-block size information may be signaled as being included in a bitstream.
  • both sub-block size information and current block size information may be considered in determining the size of the sub-block.
  • the size of the sub-block may be determined as 8.
  • the sub-block may have at least one of a square shape and a rectangular shape.
  • the sub-block when the current block has a square shape, the sub-block may have a rectangular shape.
  • the sub-block when the current block has a rectangular shape, the sub-block may have a square shape.
  • the encoder and the decoder may set the initial motion vector for motion vector refining in sub-block units by using at least one of the following methods.
  • the initial motion vectors of at least one sub-block unit set by the methods (1) to (5) only the initial motion vector having the same value as reference picture index information of the motion information determined in block units may be used.
  • a scaled value considering the temporal distance may be used as the initial motion vector in sub-block units.
  • reference picture index information of sub-blocks may be set to the same particular value.
  • reference picture index information of all sub-blocks may be set to a value of 0.
  • the motion vector is scaled considering the temporal distance, and then may be used as the initial motion vector of the relevant sub-block.
  • the encoder and the decoder may perform motion vector refining in sub-block units by using the derived initial motion vector.
  • the encoder and the decoder use the spatial neighbor blocks and/or the temporal neighbor blocks of the current block to perform refining on the initial motion vector of the sub-block through at least one of the motion vector refining method using the above-described template and the motion vector refining method using the prediction block.
  • information on motion compensation may include information on whether or not merge mode-based motion vector refining is used that may be used in the motion vector refining method, template size information, search area information, weighting factor information, information on the number of times of performing motion refining, motion vector refining mode information, and sub-block size information.
  • the generated motion vector candidate list may be used to derive a refined motion vector candidate.
  • the generated motion vector candidate may be used as the initial motion vector and the refined motion vector may be derived through the motion vector refining method using the template.
  • the motion vector candidate minimizing the difference between the template in the reference picture and the neighbor template of the encoding/decoding target block may be used as the refined motion vector.
  • the determined refined motion vector candidate when the determined refined motion vector candidate has the motion vector value different from the motion vector value of the first motion vector candidate of the motion vector candidate list, the determined refined motion vector candidate may be used as the first candidate of the motion vector candidate list.
  • the position of existing motion vector candidates in the list may be incremented by one step and the N-th candidate may be removed from the list.
  • the motion vector candidate when one motion vector candidate is determined from the motion vector of the reconstructed neighbor block, the motion vector of the col block, and the motion vector of the block adjacent to the col block, the motion vector candidate may be used as the initial motion vector and the refined motion vector may be derived through the motion vector refining method using the template.
  • the refined motion vector candidate when the determined refined motion vector candidate has the refined motion vector value different from the refined motion vector value of the first motion vector candidate of the motion vector candidate list, the refined motion vector candidate may be used as the second candidate of the motion vector candidate list.
  • overlapped block motion compensation OMBC
  • BIO bi-directional optical flow
  • local illumination compensation information for the encoded/decoded block through the motion refining method may be derived from a candidate block corresponding to merge index information.
  • FIG. 29 is a flowchart illustrating a method for decoding an image according to an embodiment of the present invention.
  • the decoder may derive an initial motion vector from a merge candidate list of a current block at step S 2910 .
  • the initial motion vector may be derived from a merge candidate indicated by merge index information in the merge candidate list.
  • the motion vector of the existing motion information may be mirrored or scaled to derived the initial motion vector in a prediction direction where the motion information is absent. Since a detailed description thereof has been described with reference to FIGS. 12 and 13 , it will be omitted.
  • the decoder may derive the refined motion vector by using the initial motion vector at step S 2920 .
  • the motion vector indicating the template minimizing the difference with the neighbor template of the current block is searched for in the search area of the reference picture indicated by the initial motion vector, and the motion vector indicating the template minimizing the difference may be derived as the refined motion vector.
  • the particular search area may be determined as an area centered on the pixel position of the reference picture indicated by the initial motion vector, the area having at least one of cross, square, diamond, and hexagon shapes.
  • the motion vector indicating the template minimizing the difference between neighbor templates of the current block in the search area of the reference picture indicated by the initial motion vector may be searched for based on at least one of the distortion value between templates and the cost value for the motion vector.
  • the refined motion vector may be derived based on at least one prediction block indicated by the initial motion vector.
  • a weighted sum of the first prediction block indicated by the first prediction direction initial motion vector and the second prediction block indicated by the second prediction direction initial motion vector may be set as a template, and a search area of at least one reference picture indicated by at least one of the first prediction direction initial motion vector and the second prediction direction initial motion vector may be set, such that the motion vector indicating the third prediction block minimizing the difference with the template in the search area may be derived as the refined motion vector.
  • the refined motion vector may be derived using motion vectors indicating prediction blocks minimizing the difference with the template in the first search area and the second search area.
  • the existing initial motion vector may be mirrored or scaled to derive a non-existing initial motion vector.
  • a prediction block of the current block may be generated using the refined motion vector at step S 2930 .
  • the current block may be a sub-block of a decoding target block.
  • the motion vector may be refined in sub-block units.
  • the above embodiments may be performed in the same method in an encoder and a decoder.
  • a sequence of applying to above embodiment may be different between an encoder and a decoder, or the sequence applying to above embodiment may be the same in the encoder and the decoder.
  • the above embodiment may be performed on each luma signal and chroma signal, or the above embodiment may be identically performed on luma and chroma signals.
  • a block form to which the above embodiments of the present invention are applied may have a square form or a non-square form.
  • the above embodiment of the present invention may be applied depending on a size of 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 may be defined as a minimum size or maximum size or both so that the above embodiments are applied, or may be defined as a fixed size to which the above embodiment is applied.
  • a first embodiment may be applied to a first size
  • a second embodiment may be applied to a second size.
  • the above embodiments may be applied in combination depending on a size.
  • the above embodiments may be applied when a size is equal to or greater that a minimum size and equal to or smaller than a maximum size.
  • the above embodiments may be applied when a block size is included within a certain range.
  • the above embodiments may be applied when a size of current block is 8 ⁇ 8 or greater.
  • the above embodiments may be applied when a size of current block is 4 ⁇ 4 or greater.
  • the above embodiments may be applied when a size of current block is 16 ⁇ 16 or greater.
  • the above embodiments may be applied when a size of current block is equal to or greater than 16 ⁇ 16 and equal to or smaller than 64 ⁇ 64.
  • the above embodiments of the present invention may be applied depending on a temporal layer.
  • a temporal layer to which the above embodiments may be applied may be signaled, and the above embodiments may be applied to a specified temporal layer identified by the corresponding identifier.
  • the identifier may be defined as the lowest layer or the highest layer or both to which the above embodiment may be applied, or may be defined to indicate a specific layer to which the embodiment is applied.
  • a fixed temporal layer to which the embodiment is applied may be defined.
  • the above embodiments may be applied when a temporal layer of a current image is the lowest layer.
  • the above embodiments may be applied when a temporal layer identifier of a current image is 1.
  • the above embodiments may be applied when a temporal layer of a current image is the highest layer.
  • a slice type to which the above embodiments of the present invention are applied may be defined, and the above embodiments may be applied depending on the corresponding slice type.
  • the embodiments of the present invention may be implemented in a form of program instructions, which are executable by various computer components, and recorded in a computer-readable recording medium.
  • the computer-readable recording medium may include stand-alone or a combination of program instructions, data files, data structures, etc.
  • the program instructions recorded in the computer-readable recording medium may be specially designed and constructed for the present invention, or well-known to a person of ordinary skilled in computer software technology field.
  • Examples of the computer-readable recording medium include magnetic recording media such as hard disks, floppy disks, and magnetic tapes; optical data storage media such as CD-ROMs or DVD-ROMs; magneto-optimum media such as floptical disks; and hardware devices, such as read-only memory (ROM), random-access memory (RAM), flash memory, etc., which are particularly structured to store and implement the program instruction.
  • Examples of the program instructions include not only a mechanical language code formatted by a compiler but also a high level language code that may be implemented by a computer using an interpreter.
  • the hardware devices may be configured to be operated by one or more software modules or vice versa to conduct the processes according to the present invention.
  • the present invention may 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)
US16/461,388 2016-11-28 2017-11-28 Image encoding/decoding method and device, and recording medium having bitstream stored thereon Active 2037-12-27 US11343530B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
KR20160159717 2016-11-28
KR10-2016-0159717 2016-11-28
PCT/KR2017/013673 WO2018097693A2 (ko) 2016-11-28 2017-11-28 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2017/013673 A-371-Of-International WO2018097693A2 (ko) 2016-11-28 2017-11-28 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/723,725 Continuation US20220256187A1 (en) 2016-11-28 2022-04-19 Image encoding/decoding method and device, and recording medium having bitstream stored thereon

Publications (2)

Publication Number Publication Date
US20200267408A1 US20200267408A1 (en) 2020-08-20
US11343530B2 true US11343530B2 (en) 2022-05-24

Family

ID=62195228

Family Applications (4)

Application Number Title Priority Date Filing Date
US16/461,388 Active 2037-12-27 US11343530B2 (en) 2016-11-28 2017-11-28 Image encoding/decoding method and device, and recording medium having bitstream stored thereon
US17/723,725 Pending US20220256187A1 (en) 2016-11-28 2022-04-19 Image encoding/decoding method and device, and recording medium having bitstream stored thereon
US18/346,732 Pending US20230353776A1 (en) 2016-11-28 2023-07-03 Image encoding/decoding method and device, and recording medium having bitstream stored thereon
US18/409,711 Pending US20240155150A1 (en) 2016-11-28 2024-01-10 Image encoding/decoding method and device, and recording medium having bitstream stored thereon

Family Applications After (3)

Application Number Title Priority Date Filing Date
US17/723,725 Pending US20220256187A1 (en) 2016-11-28 2022-04-19 Image encoding/decoding method and device, and recording medium having bitstream stored thereon
US18/346,732 Pending US20230353776A1 (en) 2016-11-28 2023-07-03 Image encoding/decoding method and device, and recording medium having bitstream stored thereon
US18/409,711 Pending US20240155150A1 (en) 2016-11-28 2024-01-10 Image encoding/decoding method and device, and recording medium having bitstream stored thereon

Country Status (6)

Country Link
US (4) US11343530B2 (ja)
EP (1) EP3547687A4 (ja)
JP (3) JP7044778B2 (ja)
KR (4) KR102283517B1 (ja)
CN (8) CN117528105A (ja)
WO (1) WO2018097693A2 (ja)

Families Citing this family (65)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117528105A (zh) * 2016-11-28 2024-02-06 英迪股份有限公司 图像编码方法、图像解码方法及用于传送比特流的方法
WO2019072368A1 (en) 2017-10-09 2019-04-18 Huawei Technologies Co., Ltd. LIMITED MEMORY ACCESS WINDOW FOR MOTION VECTOR REFINEMENT
KR102387363B1 (ko) * 2017-11-30 2022-04-18 엘지전자 주식회사 영상 코딩 시스템에서 인터 예측에 따른 영상 디코딩 방법 및 장치
CN111819851A (zh) * 2018-01-30 2020-10-23 夏普株式会社 用于使用预测运动向量起点对视频编码执行运动向量预测的系统和方法
KR102551363B1 (ko) * 2018-02-28 2023-07-04 삼성전자주식회사 부호화 방법 및 그 장치, 복호화 방법 및 그 장치
KR102368620B1 (ko) * 2018-02-28 2022-02-28 삼성전자주식회사 비디오 복호화 방법 및 장치, 비디오 부호화 방법 및 장치
CN116684594A (zh) * 2018-04-30 2023-09-01 寰发股份有限公司 照度补偿方法及相应的电子装置
JP7104186B2 (ja) 2018-06-05 2022-07-20 北京字節跳動網絡技術有限公司 Ｉｂｃとａｔｍｖｐとの間でのインタラクション
EP3809701A4 (en) * 2018-06-18 2022-06-22 Industry Academy Cooperation Foundation Of Sejong University METHOD AND APPARATUS FOR ENCODING/DECODING AN IMAGE
CN110636298B (zh) 2018-06-21 2022-09-13 北京字节跳动网络技术有限公司 对于Merge仿射模式和非Merge仿射模式的统一约束
CN110636297B (zh) 2018-06-21 2021-05-14 北京字节跳动网络技术有限公司 分量相关的子块分割
WO2020004931A1 (ko) * 2018-06-27 2020-01-02 엘지전자 주식회사 영상 코딩 시스템에서 인터 예측에 따른 영상 처리 방법 및 장치
TWI719523B (zh) 2018-06-29 2021-02-21 大陸商北京字節跳動網絡技術有限公司 哪個查找表需要更新或不更新
KR20200002697A (ko) * 2018-06-29 2020-01-08 한국전자통신연구원 처리율 향상을 위한 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
JP7328330B2 (ja) 2018-06-29 2023-08-16 北京字節跳動網絡技術有限公司 Ｌｕｔにおける動き候補のチェック順序
CN110662053B (zh) 2018-06-29 2022-03-25 北京字节跳动网络技术有限公司 使用查找表的视频处理方法、装置和存储介质
WO2020003284A1 (en) 2018-06-29 2020-01-02 Beijing Bytedance Network Technology Co., Ltd. Interaction between lut and amvp
SG11202012293RA (en) 2018-06-29 2021-01-28 Beijing Bytedance Network Technology Co Ltd Update of look up table: fifo, constrained fifo
KR20210025537A (ko) 2018-06-29 2021-03-09 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 하나 또는 다수의 룩업 테이블들을 사용하여 이전에 코딩된 모션 정보를 순서대로 저장하고 이를 사용하여 후속 블록들을 코딩하는 개념
JP7460617B2 (ja) 2018-06-29 2024-04-02 北京字節跳動網絡技術有限公司 Ｌｕｔ更新条件
EP3791585A1 (en) 2018-06-29 2021-03-17 Beijing Bytedance Network Technology Co. Ltd. Partial/full pruning when adding a hmvp candidate to merge/amvp
CN117354509A (zh) * 2018-06-29 2024-01-05 英迪股份有限公司 对图像解码和编码的方法及非暂态计算机可读存储介质
WO2020009427A1 (ko) * 2018-07-02 2020-01-09 엘지전자 주식회사 영상 코딩 시스템의 인터 예측에서 템플릿 기반의 후보 리스트 재정렬 방법 및 장치
WO2020009390A1 (ko) * 2018-07-02 2020-01-09 엘지전자 주식회사 영상 코딩 시스템에서 인터 예측에 따른 영상 처리 방법 및 장치
CN110677669B (zh) 2018-07-02 2021-12-07 北京字节跳动网络技术有限公司 具有lic的lut
WO2020009515A1 (ko) * 2018-07-05 2020-01-09 엘지전자 주식회사 Ctu 단위의 버퍼 압축을 이용한 영상 코딩 방법 및 그 장치
WO2020013673A1 (ko) * 2018-07-13 2020-01-16 엘지전자 주식회사 Dmvr에 기반하여 인터 예측을 수행하는 방법 및 장치
WO2020017840A1 (ko) * 2018-07-16 2020-01-23 엘지전자 주식회사 Dmvr에 기반하여 인터 예측을 수행하는 방법 및 장치
US11184635B2 (en) * 2018-08-31 2021-11-23 Tencent America LLC Method and apparatus for video coding with motion vector constraints
CN115250350B (zh) 2018-09-03 2024-04-09 华为技术有限公司 运动矢量的获取方法、装置、计算机设备及存储介质
WO2020053800A1 (en) 2018-09-12 2020-03-19 Beijing Bytedance Network Technology Co., Ltd. How many hmvp candidates to be checked
CN114125467A (zh) * 2018-09-13 2022-03-01 华为技术有限公司 一种预测运动信息的解码方法及装置
TWI815967B (zh) * 2018-09-19 2023-09-21 大陸商北京字節跳動網絡技術有限公司 仿射模式編解碼的模式相關自適應調整運動矢量分辨率
JP6976916B2 (ja) 2018-09-21 2021-12-08 Kddi株式会社 画像復号装置、画像符号化装置、画像処理システム及びプログラム
GB2577318B (en) * 2018-09-21 2021-03-10 Canon Kk Video coding and decoding
WO2020065518A1 (en) * 2018-09-24 2020-04-02 Beijing Bytedance Network Technology Co., Ltd. Bi-prediction with weights in video coding and decoding
JP7391958B2 (ja) * 2018-11-08 2023-12-05 オッポ広東移動通信有限公司 ビデオ信号符号化／復号方法及び前記方法に用いられる機器
CN112997480B (zh) * 2018-11-10 2023-08-22 北京字节跳动网络技术有限公司 成对平均候选计算中的取整
KR20200056272A (ko) * 2018-11-14 2020-05-22 에스케이텔레콤 주식회사 인터 예측 방법 및 이를 이용한 영상 복호화 장치
WO2020101392A1 (ko) 2018-11-14 2020-05-22 에스케이텔레콤 주식회사 인터 예측 방법 및 이를 이용한 영상 복호화 장치
JP2022507874A (ja) 2018-11-20 2022-01-18 インターデイジタル ヴィーシー ホールディングス インコーポレイテッド 二重木を伴う現ピクチャ参照ブロックベクトル初期化
KR102660160B1 (ko) 2018-11-22 2024-04-24 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 서브 블록 기반 인터 예측을 위한 조정 방법
CN116962710A (zh) * 2018-12-15 2023-10-27 华为技术有限公司 图像重建方法和装置
WO2020130617A1 (ko) * 2018-12-18 2020-06-25 엘지전자 주식회사 비디오 데이터를 처리하기 위한 방법 및 장치
CN112236996A (zh) * 2018-12-21 2021-01-15 株式会社 Xris 视频信号编码/解码方法及其装置
CN112468825B (zh) 2018-12-28 2022-04-26 杭州海康威视数字技术股份有限公司 一种编解码方法及其设备
KR102648159B1 (ko) 2019-01-10 2024-03-18 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 Lut 업데이트의 호출
CN113383554B (zh) 2019-01-13 2022-12-16 北京字节跳动网络技术有限公司 LUT和共享Merge列表之间的交互
WO2020147773A1 (en) 2019-01-16 2020-07-23 Beijing Bytedance Network Technology Co., Ltd. Inserting order of motion candidates in lut
CN112868233B (zh) 2019-02-28 2023-03-21 华为技术有限公司 编码器、解码器及相应的帧间预测方法
EP3922023A4 (en) 2019-03-05 2022-06-15 Huawei Technologies Co., Ltd. USING EXTENDED SAMPLES WHILE SEARCHING IN A DECODER-SIDE MOTION REFINEMENT
EP3939303A1 (en) * 2019-03-11 2022-01-19 VID SCALE, Inc. Symmetric merge mode motion vector coding
TWI738248B (zh) 2019-03-14 2021-09-01 聯發科技股份有限公司 運動細化以及子分區基礎填充的視訊處理的方法以及裝置
CN113615193A (zh) 2019-03-22 2021-11-05 北京字节跳动网络技术有限公司 Merge列表构建和其他工具之间的交互
KR20240006015A (ko) 2019-06-14 2024-01-12 엘지전자 주식회사 움직임 벡터를 이용한 영상 코딩 방법 및 장치
JP7323649B2 (ja) * 2019-06-14 2023-08-08 エルジー エレクトロニクス インコーポレイティド インター予測に基づく画像コーディング方法及び装置
CN114208184A (zh) 2019-08-13 2022-03-18 北京字节跳动网络技术有限公司 基于子块的帧间预测中的运动精度
CN113709487B (zh) * 2019-09-06 2022-12-23 杭州海康威视数字技术股份有限公司 一种编解码方法、装置及其设备
KR20220051842A (ko) * 2019-09-18 2022-04-26 삼성전자주식회사 움직임 정보의 부호화 장치 및 방법, 및 복호화 장치 및 방법
CN114424553A (zh) 2019-09-22 2022-04-29 北京字节跳动网络技术有限公司 基于子块的帧间预测的缩放方法
US11792423B2 (en) * 2019-11-22 2023-10-17 Qualcomm Incorporated Early termination of motion vector refinement process in video coding
CN111163322B (zh) * 2020-01-08 2022-08-30 绍兴文理学院 对基于历史运动矢量的索引进行映射的编码及解码方法
WO2022173913A1 (en) * 2021-02-11 2022-08-18 Dolby Laboratories Licensing Corporation Intra-prediction for hexagonally-sampled video and image compression
WO2023027564A1 (ko) * 2021-08-27 2023-03-02 주식회사 윌러스표준기술연구소 움직임 정보를 보정하는 방법 및 이를 위한 장치
WO2024010338A1 (ko) * 2022-07-05 2024-01-11 한국전자통신연구원 영상 부호화/복호화를 위한 방법, 장치 및 기록 매체

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5973754A (en) * 1995-12-22 1999-10-26 Siemens Aktiengesellschaft Method for computer-supported motion estimation for picture elements of chronologically following images of a video sequence
US20030112872A1 (en) 2001-12-15 2003-06-19 Seong-Mo Park Apparatus and method for performing mixed motion estimation based on hierarchical search
US6584212B1 (en) 1999-11-08 2003-06-24 Electronics And Telecommunications Research Institute Apparatus for motion estimation with control part implemented by state transition diagram
KR100772576B1 (ko) 2000-05-08 2007-11-02 노키아 코포레이션 비디오 정보를 부호화 및 복호화하기 위한 방법, 움직임보상 비디오 부호기 및 대응하는 복호기
WO2011047994A1 (en) 2009-10-20 2011-04-28 Thomson Licensing Motion vector prediction and refinement
JP2013016934A (ja) 2011-06-30 2013-01-24 Jvc Kenwood Corp 画像符号化装置、画像符号化方法及び画像符号化プログラム
US20130114717A1 (en) * 2011-11-07 2013-05-09 Qualcomm Incorporated Generating additional merge candidates
KR20130081676A (ko) 2012-01-09 2013-07-17 삼성전자주식회사 움직임 벡터 정규화에 기초한 영상의 부호화 방법 및 장치, 영상의 복호화 방법 및 장치
KR20130085013A (ko) 2012-01-18 2013-07-26 한국전자통신연구원 영상 부호화 및 복호화 방법 및 장치
US20140205013A1 (en) * 2013-01-23 2014-07-24 Electronics And Telecommunications Research Institute Inter-prediction method and apparatus
WO2016160608A1 (en) 2015-03-27 2016-10-06 Qualcomm Incorporated Motion vector derivation in video coding
US20180041769A1 (en) * 2016-08-08 2018-02-08 Mediatek Inc. Pattern-based motion vector derivation for video coding
EP3342167A1 (en) 2015-09-02 2018-07-04 MediaTek, Inc Method and apparatus of decoder side motion derivation for video coding
JP2019519998A (ja) 2016-06-30 2019-07-11 インターデジタル ヴイシー ホールディングス， インコーポレイテッド 自動的な動き情報の精緻化を伴うビデオコード化のための方法及び機器

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101929026B1 (ko) * 2011-01-07 2018-12-13 엘지전자 주식회사 영상 정보 부호화 방법 및 복호화 방법과 이를 이용한 장치
KR20130050407A (ko) * 2011-11-07 2013-05-16 오수미 인터 모드에서의 움직임 정보 생성 방법
RU2624578C2 (ru) * 2012-07-02 2017-07-04 Самсунг Электроникс Ко., Лтд. Способ и устройство для прогнозирования вектора движения для кодирования видео или декодирования видео
PL400344A1 (pl) * 2012-08-13 2014-02-17 Politechnika Poznanska Sposób wyznaczania predyktora wektora ruchu
EP2952003B1 (en) * 2013-01-30 2019-07-17 Intel Corporation Content adaptive partitioning for prediction and coding for next generation video
KR20130067280A (ko) * 2013-04-18 2013-06-21 엠앤케이홀딩스 주식회사 인터 예측 부호화된 동영상 복호화 방법
WO2015006984A1 (en) * 2013-07-19 2015-01-22 Mediatek Singapore Pte. Ltd. Reference view selection for 3d video coding
EP3078196B1 (en) * 2013-12-06 2023-04-05 MediaTek Inc. Method and apparatus for motion boundary processing
US9854237B2 (en) * 2014-10-14 2017-12-26 Qualcomm Incorporated AMVP and merge candidate list derivation for intra BC and inter prediction unification
ES2737843B2 (es) * 2016-07-05 2021-07-15 Kt Corp Metodo y aparato para procesar una senal de video
CN117528105A (zh) 2016-11-28 2024-02-06 英迪股份有限公司 图像编码方法、图像解码方法及用于传送比特流的方法
US10750203B2 (en) * 2016-12-22 2020-08-18 Mediatek Inc. Method and apparatus of adaptive bi-prediction for video coding

Patent Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5973754A (en) * 1995-12-22 1999-10-26 Siemens Aktiengesellschaft Method for computer-supported motion estimation for picture elements of chronologically following images of a video sequence
US6584212B1 (en) 1999-11-08 2003-06-24 Electronics And Telecommunications Research Institute Apparatus for motion estimation with control part implemented by state transition diagram
KR100772576B1 (ko) 2000-05-08 2007-11-02 노키아 코포레이션 비디오 정보를 부호화 및 복호화하기 위한 방법, 움직임보상 비디오 부호기 및 대응하는 복호기
US20030112872A1 (en) 2001-12-15 2003-06-19 Seong-Mo Park Apparatus and method for performing mixed motion estimation based on hierarchical search
WO2011047994A1 (en) 2009-10-20 2011-04-28 Thomson Licensing Motion vector prediction and refinement
KR20120096471A (ko) 2009-10-20 2012-08-30 톰슨 라이센싱 움직임 벡터 예측 및 미세조정
US20130101040A1 (en) * 2009-10-20 2013-04-25 Thomson Licensing Method for coding a block of a sequence of images and method for reconstructing said block
JP2013016934A (ja) 2011-06-30 2013-01-24 Jvc Kenwood Corp 画像符号化装置、画像符号化方法及び画像符号化プログラム
KR20140092876A (ko) 2011-11-07 2014-07-24 퀄컴 인코포레이티드 부가적인 병합 후보들의 생성
US20130114717A1 (en) * 2011-11-07 2013-05-09 Qualcomm Incorporated Generating additional merge candidates
WO2013070757A1 (en) 2011-11-07 2013-05-16 Qualcomm Incorporated Generating additional merge candidates
KR20130081676A (ko) 2012-01-09 2013-07-17 삼성전자주식회사 움직임 벡터 정규화에 기초한 영상의 부호화 방법 및 장치, 영상의 복호화 방법 및 장치
KR20130085013A (ko) 2012-01-18 2013-07-26 한국전자통신연구원 영상 부호화 및 복호화 방법 및 장치
US20140205013A1 (en) * 2013-01-23 2014-07-24 Electronics And Telecommunications Research Institute Inter-prediction method and apparatus
KR20140095607A (ko) 2013-01-23 2014-08-04 한국전자통신연구원 인터 예측 방법 및 그 장치
WO2016160608A1 (en) 2015-03-27 2016-10-06 Qualcomm Incorporated Motion vector derivation in video coding
JP2018512810A (ja) 2015-03-27 2018-05-17 クゥアルコム・インコーポレイテッドＱｕａｌｃｏｍｍ Ｉｎｃｏｒｐｏｒａｔｅｄ ビデオコーディングにおけるサブブロックの動き情報の導出
EP3342167A1 (en) 2015-09-02 2018-07-04 MediaTek, Inc Method and apparatus of decoder side motion derivation for video coding
JP2019519998A (ja) 2016-06-30 2019-07-11 インターデジタル ヴイシー ホールディングス， インコーポレイテッド 自動的な動き情報の精緻化を伴うビデオコード化のための方法及び機器
US20180041769A1 (en) * 2016-08-08 2018-02-08 Mediatek Inc. Pattern-based motion vector derivation for video coding

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
Chen, et al. "Algorithm description of joint exploration test model 1." Joint Video Exploration Team (JVET) of ITU-T SG Oct. 16, 2016 (40 pages in English).
Chen, Jianle et al., "Further improvements to HMKTA-1.0", ITU-Telecommunications Standardization Sector Study Group, 16 Question 6, Video Coding Experts Group (VCEG), 52nd Meeting: Jun. 19-26, 2015 Warsaw, Poland (pp. 1-8).
Fukushima, et al. "Merge based mvd transmission" Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6thMeeting: Torino, IT, Jul. 14-22, 2011. (11 pages in English).
International Search Report dated May 1, 2018 in counterpart International Patent Application No. PCT/KR2017/013673 (3 pages in English and 3 pages in Korean).
Jung, Joel et al., "Competition-Based Scheme for Motion Vector Selection and Coding", ITU-Telecommunications Standardization Sector Study Group, 16 Question 6, Video Coding Experts Group (VCEG), 29th Meeting: Klagenfurt, Austria, Jul. 17-18, 2006 (pp. 1-7).

Also Published As

Publication number Publication date
CN117528109A (zh) 2024-02-06
EP3547687A2 (en) 2019-10-02
CN117528105A (zh) 2024-02-06
KR20220054572A (ko) 2022-05-03
KR20210095113A (ko) 2021-07-30
KR102509513B1 (ko) 2023-03-14
KR20180061060A (ko) 2018-06-07
KR102283517B1 (ko) 2021-07-29
EP3547687A4 (en) 2020-07-15
KR20230037530A (ko) 2023-03-16
JP7253844B2 (ja) 2023-04-07
JP7044778B2 (ja) 2022-03-30
JP2022051733A (ja) 2022-04-01
CN117528107A (zh) 2024-02-06
WO2018097693A2 (ko) 2018-05-31
CN117528108A (zh) 2024-02-06
US20200267408A1 (en) 2020-08-20
CN117528111A (zh) 2024-02-06
JP2023068059A (ja) 2023-05-16
CN109997363B (zh) 2023-12-05
US20230353776A1 (en) 2023-11-02
US20240155150A1 (en) 2024-05-09
WO2018097693A3 (ko) 2018-07-19
CN117528110A (zh) 2024-02-06
CN117528106A (zh) 2024-02-06
JP2019536376A (ja) 2019-12-12
CN109997363A (zh) 2019-07-09
KR102391524B1 (ko) 2022-04-27
US20220256187A1 (en) 2022-08-11
KR102625959B1 (ko) 2024-01-17

Similar Documents

Publication Publication Date Title
US20230353776A1 (en) Image encoding/decoding method and device, and recording medium having bitstream stored thereon
US11743470B2 (en) Image encoding/decoding method and recording medium for same
US11997304B2 (en) Image encoding/decoding method and device, and recording medium in which bitstream is stored
US11895329B2 (en) Image encoding/decoding method and recording medium therefor
US11743473B2 (en) Method and apparatus for encoding/decoding a video using a motion compensation
US20230344992A1 (en) Method and apparatus for encoding and decoding image, and recording medium for storing bitstream
US20230106821A1 (en) Method and device for image encoding/decoding on basis of asymmetric sub-block
US11616976B2 (en) Video encoding/decoding method and device, and recording medium storing bit stream
US20220279171A1 (en) Image encoding/decoding method and device, and recording medium in which bitstream is stored
US20230379455A1 (en) Method and Device for Encoding/Decoding Image and Recording Medium Having Bitstream Stored Thereon
US11438589B2 (en) Video encoding/decoding method and apparatus, and recording medium in which bit stream is stored
US11323705B2 (en) Image encoding/decoding method and apparatus using sample filtering
US11546605B2 (en) Image encoding/decoding method and device, and recording medium storing bitstream
US20230308644A1 (en) Method and apparatus for encoding/decoding image, and recording medium for storing bitstream
US20240073448A1 (en) Image encoding/decoding method and device, and recording medium in which bitstream is stored
US12003713B2 (en) Image encoding/decoding method and apparatus using sample filtering
US20240187644A1 (en) Image encoding/decoding method and recording medium therefor

Legal Events

Date Code Title Description
AS Assignment

Owner name: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE, KOREA, REPUBLIC OF

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LEE, HA HYUN;KANG, JUNG WON;KO, HYUN SUK;AND OTHERS;SIGNING DATES FROM 20190423 TO 20190430;REEL/FRAME:049191/0564

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO SMALL (ORIGINAL EVENT CODE: SMAL); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: ADVISORY ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS

STPP Information on status: patent application and granting procedure in general

Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: INTELLECTUAL DISCOVERY CO., LTD., KOREA, REPUBLIC OF

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE;REEL/FRAME:062023/0959

Effective date: 20221122