US9351012B2 - Method of decoding video data - Google Patents

Method of decoding video data Download PDF

Info

Publication number
US9351012B2
US9351012B2 US14/618,833 US201514618833A US9351012B2 US 9351012 B2 US9351012 B2 US 9351012B2 US 201514618833 A US201514618833 A US 201514618833A US 9351012 B2 US9351012 B2 US 9351012B2
Authority
US
United States
Prior art keywords
block
quantization parameter
prediction
unit
motion vector
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
Application number
US14/618,833
Other versions
US20150156510A1 (en
Inventor
Soo Mi Oh
Moonock Yang
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.)
Gensquare LLC
Original Assignee
Infobridge Pte Ltd
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
Priority to US14/618,833 priority Critical patent/US9351012B2/en
Application filed by Infobridge Pte Ltd filed Critical Infobridge Pte Ltd
Priority to US14/692,691 priority patent/US9635384B2/en
Priority to US14/692,680 priority patent/US9648343B2/en
Priority to US14/692,690 priority patent/US9641860B2/en
Priority to US14/692,679 priority patent/US9615106B2/en
Publication of US20150156510A1 publication Critical patent/US20150156510A1/en
Application granted granted Critical
Publication of US9351012B2 publication Critical patent/US9351012B2/en
Priority to US15/481,954 priority patent/US10212449B2/en
Priority to US16/242,546 priority patent/US10873757B2/en
Assigned to GENSQUARE LLC reassignment GENSQUARE LLC NUNC PRO TUNC ASSIGNMENT (SEE DOCUMENT FOR DETAILS). Assignors: INFOBRIDGE PTE. LTD.
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/513Processing of motion vectors
    • H04N19/517Processing of motion vectors by encoding
    • H04N19/52Processing of motion vectors by encoding by predictive encoding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/103Selection of coding mode or of prediction mode
    • H04N19/105Selection 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/117Filters, e.g. for pre-processing or post-processing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/119Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/12Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/124Quantisation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/124Quantisation
    • H04N19/126Details of normalisation or weighting functions, e.g. normalisation matrices or variable uniform quantisers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/13Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/136Incoming video signal characteristics or properties
    • H04N19/137Motion inside a coding unit, e.g. average field, frame or block difference
    • H04N19/139Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/157Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H04N19/159Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/17Methods 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/176Methods 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/182Methods 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 a pixel
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/189Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H04N19/196Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46Embedding additional information in the video signal during the compression process
    • H04N19/463Embedding additional information in the video signal during the compression process by compressing encoding parameters before transmission
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/513Processing of motion vectors
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/513Processing of motion vectors
    • H04N19/521Processing 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/523Motion estimation or motion compensation with sub-pixel accuracy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/587Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal sub-sampling or interpolation, e.g. decimation or subsequent interpolation of pictures in a video sequence
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/59Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial sub-sampling or interpolation, e.g. alteration of picture size or resolution
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
    • H04N19/615Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding using motion compensated temporal filtering [MCTF]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/63Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
    • H04N19/635Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets characterised by filter definition or implementation details
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/80Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/129Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/157Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/17Methods 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/172Methods 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 picture, frame or field
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/513Processing of motion vectors
    • H04N19/517Processing of motion vectors by encoding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/56Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/80Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation
    • H04N19/82Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation involving filtering within a prediction loop

Definitions

  • the present invention relates to a method of decoding video data, and more particularly, to a method of deriving motion information in merge mode by constructing a merge candidate list using spatial and temporal merge candidates and generating a prediction block using the motion information.
  • Methods for compressing video data include MPEG-2, MPEG-4 and H.264/MPEG-4 AVC. According to these methods, one picture is divided into macroblocks to encode an image, the respective macroblocks are encoded by generating a prediction block using inter prediction or intra prediction. The difference between an original block and the prediction block is transformed to generate a transformed block, and the transformed block is quantized using a quantization parameter and one of a plurality of predetermined quantization matrices. The quantized coefficient of the quantized block are scanned by a predetermined scan type and then entropy-coded. The quantization parameter is adjusted per macroblock and encoded using a previous quantization parameter.
  • motion estimation is used to eliminate temporal redundancy between consecutive pictures.
  • one or more reference pictures are used to estimate motion of a current block, and motion compensation is performed to generate a prediction block using motion information.
  • the motion information includes one or more reference picture indexes and one or more motion vectors.
  • the motion vectors are predicted and encoded using neighboring motion vectors, and the reference picture indexes are encoded without neighboring reference picture indexes. Also, the computational complexity for generating a prediction block is high because the prediction block is interpolated using a long-tap filter.
  • the correlation between motion information of a current block and motion information of one or more neighboring block increases.
  • the correlation between motion vector of a current block and motion vector of neighboring block within a reference picture becomes higher as the picture size becomes larger if motion of image is almost constant or slow. Accordingly, the conventional compression method described above decreases compression efficiency of motion information if the picture size is larger than that of high-definition picture and various sizes are allowed for motion estimation and motion compensation.
  • the present invention is directed to a method of decoding video data by deriving motion information by constructing a merge candidate list using spatial merge candidates and temporal candidate and generating prediction block using a filter determined by the motion vector.
  • One aspect of the present invention provides a method of decoding video data, comprising: deriving a reference picture index and a motion vector of a current prediction unit; generating a prediction block of the current prediction unit using the reference picture index and the motion vector; generating a quantized block by inverse-scanning quantized coefficient components; generating a transformed block by inverse-quantizing the quantized block using a quantization parameter; generating a residual block by inverse-transforming the transformed block; and generating a reconstructed pixels using the prediction block and the residual block.
  • Prediction pixels of the prediction block is generated using an interpolation filter selected based on the motion vector.
  • a method derives a reference picture index and a motion vector of a current prediction unit, generates a prediction block of the current prediction unit using the reference picture index and the motion vector, generating a residual block by inverse-scan, inverse-quantization and inverse transform, and generates reconstructed pixels using the prediction block and the residual block.
  • Prediction pixels of the prediction block is generated using an interpolation filter selected based on the motion vector. Accordingly, the coding efficiency of the motion information is improved by including various merge candidates. Also, the computational complexity of an encoder and a decoder is reduced by selecting different filter according to location of the prediction pixels determined by the motion vector.
  • FIG. 1 is a block diagram of an image coding apparatus according to the present invention.
  • FIG. 2 is a flow chart illustrating a method of encoding video data in an inter prediction mode according to the present invention.
  • FIG. 3 is a conceptual diagram illustrating pixel positions indicated by a motion vector according to the present invention.
  • FIG. 4 is a flow chart illustrating a method of encoding motion information in a merge mode according to the present invention.
  • FIG. 5 is a conceptual diagram illustrating positions of spatial merge candidate blocks according to the present invention.
  • FIG. 6 is a conceptual diagram illustrating positions of spatial merge candidate blocks in an asymmetric partitioning mode according to the present invention.
  • FIG. 7 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
  • FIG. 8 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
  • FIG. 9 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
  • FIG. 10 is a conceptual diagram illustrating position of temporal merge candidate block according to the present invention.
  • FIG. 11 is a conceptual diagram illustrating a method of storing motion information according to the present invention.
  • FIG. 12 is a block diagram of an image decoding apparatus 200 according to the present invention.
  • FIG. 13 is a flow chart illustrating a method of decoding an image in inter prediction mode according to the present invention.
  • FIG. 14 is a flow chart illustrating a method of deriving motion information in merge mode.
  • FIG. 15 is a flow chart illustrating a procedure of generating a residual block in inter prediction mode according to the present invention.
  • An image encoding apparatus and an image decoding apparatus may be a user terminal such as a personal computer, a personal mobile terminal, a mobile multimedia player, a smartphone or a wireless communication terminal.
  • the image encoding device and the image decoding device may be include a communication unit for communicating with various devices, a memory for storing various programs and data used to encode or decode images.
  • FIG. 1 is a block diagram of an image coding apparatus 100 according to the present invention.
  • the image coding apparatus 100 includes a picture division unit 110 , an intra prediction unit 120 , an inter prediction unit 130 , a transform unit 140 , a quantization unit 150 , a scanning unit 160 , an entropy coding unit 170 , an inverse quantization/transform unit 180 , a post-processing unit 190 and a picture storing unit 195 .
  • the picture division unit 110 divides a picture or a slice into plural largest coding units (LCUs), and divides each LCU into one or more coding units.
  • the size of LCU may be 32 ⁇ 32, 64 ⁇ 64 or 128 ⁇ 128.
  • the picture division unit 110 determines prediction mode and partitioning mode of each coding unit.
  • An LCU includes one or more coding units.
  • the LCU has a recursive quad tree structure to specify a division structure of the LCU. Parameters for specifying the maximum size and the minimum size of the coding unit are included in a sequence parameter set.
  • the division structure is specified by one or more split coding unit flags (split_cu_flags).
  • split_cu_flags The size of a coding unit is 2N ⁇ 2N. If the size of the LCU is 64 ⁇ 64 and the size of a smallest coding unit (SCU) is 8 ⁇ 8, the size of the coding unit may be 64 ⁇ 64, 32 ⁇ 32, 16 ⁇ 16 or 8 ⁇ 8.
  • a coding unit includes one or more prediction units.
  • the size of the prediction unit is 2N ⁇ 2N or N ⁇ N.
  • the size of the prediction unit is specified by the partitioning mode.
  • the partitioning mode is one of 2N ⁇ 2N, 2N ⁇ N, N ⁇ 2N and N ⁇ N if the coding unit is partitioned symmetrically.
  • the partitioning mode is one of 2N ⁇ nU, 2N ⁇ nD, nL ⁇ 2N and nR ⁇ 2N if the coding unit is partitioned asymmetrically.
  • the partitioning modes are allowed based on the size of the coding unit to reduce complexity of hardware. If the coding unit has a minimum size, the asymmetric partitioning is not allowed. Also, if the coding unit has the minimum size, N ⁇ N partitioning mode may not be allowed.
  • a coding unit includes one or more transform units.
  • the transform unit has a recursive quad tree structure to specify a division structure of the coding unit.
  • the division structure is specified by one or more split transform unit flags (split_tu_flags). Parameters for specifying the maximum size and the minimum size of the luma transform unit are included in a sequence parameter set.
  • the intra prediction unit 120 determines an intra prediction mode of a current prediction unit and generates a prediction block using the intra prediction mode.
  • the inter prediction unit 130 determines motion information of a current prediction unit using one or more reference pictures stored in the picture storing unit 195 , and generates a prediction block of the prediction unit.
  • the motion information includes one or more reference picture indexes and one or more motion vectors.
  • the transform unit 140 transforms a residual block to generate a transformed block.
  • the residual block has the same size of the transform unit. If the prediction unit is larger than the transform unit, the residual signals between the current block and the prediction block are partitioned into multiple residual blocks.
  • the quantization unit 150 determines a quantization parameter for quantizing the transformed block.
  • the quantization parameter is a quantization step size.
  • the quantization parameter is determined per quantization unit.
  • the size of the quantization unit may vary and be one of allowable sizes of coding unit. If a size of the coding unit is equal to or larger than a minimum size of the quantization unit, the coding unit becomes the quantization unit.
  • a plurality of coding units may be included in a quantization unit of minimum size. The minimum size of the quantization unit is determined per picture and a parameter for specifying the minimum size of the quantization unit is included in a picture parameter set.
  • the quantization unit 150 generates a quantization parameter predictor and generates a differential quantization parameter by subtracting the quantization parameter predictor from the quantization parameter.
  • the differential quantization parameter is entropy-coded.
  • the quantization parameter predictor is generated by using quantization parameters of neighboring coding units and a quantization parameter of previous coding unit as follows.
  • a left quantization parameter, an above quantization parameter and a previous quantization parameter are sequentially retrieved in this order.
  • An average of the first two available quantization parameters retrieved in that order is set as the quantization parameter predictor when two or more quantization parameters are available, and when only one quantization parameter is available, the available quantization parameter is set as the quantization parameter predictor. That is, if the left and above quantization parameters are available, an average of the left and above quantization parameters is set as the quantization parameter predictor. If only one of the left and above quantization parameters is available, an average of the available quantization parameter and the previous quantization parameters is set as the quantization parameter predictor. If both of the left and above quantization parameters are unavailable, the previous quantization parameter is set as the quantization parameter predictor. The average is rounded off.
  • the differential quantization parameter is converted into bins for the absolute value of the differential quantization parameter and a bin for indicating sign of the differential quantization parameter through a binarization process, and the bins are arithmetically coded. If the absolute value of the differential quantization parameter is 0, the bin for indicating sign may be omitted. Truncated unary is used for binarization of the absolute.
  • the quantization unit 150 quantizes the transformed block using a quantization matrix and the quantization parameter to generate a quantized block.
  • the quantized block is provided to the inverse quantization/transform unit 180 and the scanning unit 160 .
  • the scanning unit 160 determines applies a scan pattern to the quantized block.
  • a diagonal scan is used as the scan pattern if CABAC is used for entropy coding.
  • the quantized coefficients of the quantized block are split into coefficient components.
  • the coefficient components are significant flags, coefficient signs and coefficient levels.
  • the diagonal scan is applied to each of the coefficient components.
  • the significant coefficient indicates whether the corresponding quantized coefficient is zero or not.
  • the coefficient sign indicates a sign of non-zero quantized coefficient, and the coefficient level indicates an absolute value of non-zero quantized coefficient.
  • the quantized block is divided into multiple subsets and the diagonal scan is applied to each subset. Significant flags, coefficient signs and coefficients levels of each subset are scanned respectively according to the diagonal scan.
  • the predetermined size is 4 ⁇ 4.
  • the subset is a 4 ⁇ 4 block containing 16 transform coefficients.
  • the scan pattern for scanning the subsets is the same as the scan pattern for scanning the coefficient components.
  • the significant flags, the coefficient signs and the coefficients levels of each subset are scanned in the reverse direction.
  • the subsets are also scanned in the reverse direction.
  • a parameter indicating last non-zero coefficient position is encoded and transmitted to a decoding side.
  • the parameter indicating last non-zero coefficient position specifies a position of last non-zero quantized coefficient within the quantized block.
  • a non-zero subset flag is defined for each subset other than the first subset and the last subset and is transmitted to the decoding side.
  • the first subset covers a DC coefficient.
  • the last subset covers the last non-zero coefficient.
  • the non-zero subset flag indicates whether the subset contains non-zero coefficients or not.
  • the entropy coding unit 170 entropy-codes the scanned component by the scanning unit 160 , intra prediction information received from the intra prediction unit 120 , motion information received from the inter prediction unit 130 , and so on.
  • the inverse quantization/transform unit 180 inversely quantizes the quantized coefficients of the quantized block, and inversely transforms the inverse quantized block to generate residual signals.
  • the post-processing unit 190 performs a deblocking filtering process for removing blocking artifact generated in a reconstructed picture.
  • the picture storing unit 195 receives post-processed image from the post-processing unit 190 , and stores the image in picture units.
  • a picture may be a frame or a field.
  • FIG. 2 is a flow chart illustrating a method of encoding video data in an inter prediction mode according to the present invention.
  • Motion information of a current block is determined (S 110 ).
  • the current block is a prediction unit.
  • a size of the current block is determined by a size and a partitioning mode of the coding unit.
  • the motion information varies according to a prediction type. If the prediction type is a uni-directional prediction, the motion information includes a reference index specifying a picture of a reference list 0, and a motion vector. If the prediction type is a bi-directional prediction, the motion information includes two reference indexes specifying a picture of a reference list 0 and a picture of a reference list 1, and a list 0 motion vector and a list 1 motion vector.
  • a prediction block of the current block is generated using the motion information (S 120 ).
  • the prediction block is generated by copying a block of the reference picture specified by the motion vector. If the motion vector indicates a sub-pixel location, the prediction block is generated by interpolating the pixels of the reference picture.
  • the motion vector is given in quarter-pixel units.
  • FIG. 3 is a conceptual diagram illustrating pixel positions indicated by a motion vector according to the present invention.
  • the pixels labeled with L 0 , R 0 , R 1 , L 1 , A 0 and B 0 are integer position pixels of the reference picture and the pixels labeled with a L0 to r L0 at sub-pixel locations are fractional pixels to be interpolated using an interpolation filter which is selected based on the motion vector.
  • a pixel to be interpolated is located at a sub-pixel location a L0 , b L0 or c L0 , the pixel labeled with a L0 , b L0 or c L0 is generated by applying an interpolation filter to horizontally nearest integer position pixels. If a pixel to be interpolated is located at a sub-pixel location d L0 , h L0 or n L0 , the pixel labeled with d L0 , h L0 or n L0 is generated by applying an interpolation filter to vertically nearest integer position pixels.
  • the pixel labeled with e L0 , i L0 or p L0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘a’ within its label. If a pixel to be interpolated is located at a sub-pixel location g L0 , k L0 or r L0 , the pixel labeled with g L0 , k L0 or r L0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘c’ within its label.
  • the pixel labeled with f L0 , j L0 or q L0 is generated by applying an interpolation filter to vertically neighboring interpolated pixels each of which includes a character ‘c’ within its label.
  • the interpolation filter is determined based on the sub-pixel location of the pixel to be interpolated, or based on a prediction mode and a sub-pixel location of the pixel to be interpolated.
  • the sub-pixel location H indicates a half-pixel location in interpolation direction.
  • the locations b L0 , h L0 , i L0 , I L0 , and k L0 correspond to the sub-pixel location H.
  • the sub-pixel locations FL and FR indicate a quarter-pixel location in interpolation direction.
  • the locations a L0 , d L0 , e L0 , f L0 , and g L0 correspond to the sub-pixel location FL
  • the locations c L0 , n L0 , p L0 , q L0 , and r L0 correspond to the sub-pixel location FR.
  • Sub-Pixel Prediction mode Location Filter coefficient Uni-directional H ⁇ 2, ⁇ 8, 36, 36, ⁇ 8, 2 ⁇ prediction FL ⁇ 3, 51, 20, ⁇ 7, 2 ⁇ FR ⁇ 2, ⁇ 7, 20, 51, ⁇ 3 ⁇ H ⁇ 1, 4, ⁇ 11, 40, 40, ⁇ 11, 4, ⁇ 1 ⁇ Bi-directional FL ⁇ 1, 4, ⁇ 10, 57, 19, ⁇ 7, 3, ⁇ 1 ⁇ prediction FR ⁇ 1, 3, ⁇ 7, 19, 57, ⁇ 10, 4, ⁇ 1 ⁇
  • 6-tap symmetry filter may be used to interpolate pixels of half-pixel location H
  • 5-tap asymmetry filter may be used to interpolate pixels of quarter-pixel location FL or FR
  • 8-tap symmetry filter may be used for the half-pixel location H
  • 8-tap asymmetry filter may be used for the quarter-pixel location FL and FR.
  • the filter may be determined by only the sub-pixel location of the pixel to be interpolated.
  • 8-tap symmetry filter may be used to interpolate pixels of half-pixel locations and 7-tap asymmetry filter or 6-tap asymmetry filter may be used to interpolate pixels of quarter-pixel locations.
  • same filter or another filter having smaller number of taps may be used to interpolate pixels of sub-pixel locations.
  • a residual block is generated using the current block and the prediction block (S 130 ).
  • the residual block has the same size of the transform unit. If the prediction unit is larger than the transform unit, the residual signals between the current block and the prediction block are into multiple residual blocks.
  • the residual block is encoded (S 140 ).
  • the residual block is encoded by the transform unit 140 , the quantization unit 150 , the scanning unit 160 and the entropy coding unit 170 of FIG. 1 .
  • the motion information is encoded (S 150 ).
  • the motion information may be encoded predictively using spatial candidates and a temporal candidate of the current block.
  • the motion information is encoded in a skip mode, a merge mode or an AMVP mode.
  • the prediction unit has the size of coding unit and the motion information is encoded using the same method as that of the merge mode.
  • the motion information of the current prediction unit is equal to motion information of one candidate.
  • the AMVP mode the motion vector of the motion information is predictively coded using one or more motion vector candidate.
  • FIG. 4 is a flow chart illustrating a method of encoding motion information in the merge mode according to the present invention.
  • FIG. 5 is a conceptual diagram illustrating positions of spatial merge candidate blocks according to the present invention.
  • the merge candidate block is a left block (block A), an above block (block B), an above-right block (block C), a left-below block (block D) or an above-left block (block E) of the current block.
  • the blocks are prediction blocks.
  • the above-left block (block E) is set as merge candidate block when one or more of the blocks A, B, C and D are unavailable.
  • the motion information of an available merge candidate block N is set as a spatial merge candidate N. N is A, B, C, D or E.
  • the spatial merge candidate may be set as unavailable according to the shape of the current block and the position of the current block. For example, if the coding unit is split into two prediction units (block P 0 and block P 1 ) using asymmetric partitioning, it is probable that the motion information of the block P 0 is not equal to the motion information of the block P 1 . Therefore, if the current block is the asymmetric block P 1 , the block P 0 is set as unavailable candidate block as shown in FIGS. 6 to 9 .
  • FIG. 6 is a conceptual diagram illustrating positions of spatial merge candidate blocks in an asymmetric partitioning mode according to the present invention.
  • a coding unit is partitioned into two asymmetric prediction blocks P 0 and P 1 and the partitioning mode is an nL ⁇ 2N mode.
  • the size of the block P 0 is hN ⁇ 2N and the size of the block P 1 is (2 ⁇ h)N ⁇ 2N.
  • the value of h is 1 ⁇ 2.
  • the current block is the block P 1 .
  • the blocks A, B, C, D and E are spatial merge candidate blocks.
  • the block P 0 is the spatial merge candidate block A.
  • the spatial merge candidate A is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block B, C, D or E having the same motion information of the spatial merge candidate block A is set as unavailable.
  • FIG. 7 is another conceptual diagram illustrating positions of spatial merge candidate blocks in an asymmetric partitioning mode according to the present invention.
  • a coding unit is partitioned into two asymmetric prediction blocks P 0 and P 1 and the partitioning mode is an nR ⁇ 2N mode.
  • the size of the block P 0 is (2 ⁇ h)N ⁇ 2N and the size of the block P 1 is hN ⁇ 2N.
  • the value of h is 1 ⁇ 2.
  • the current block is the block P 1 .
  • the blocks A, B, C, D and E are spatial merge candidate blocks.
  • the block P 0 is the spatial merge candidate block A.
  • the spatial merge candidate A is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block B, C, D or E having the same motion information of the spatial merge candidate block A is set as unavailable.
  • FIG. 8 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
  • a coding unit is partitioned into two asymmetric prediction blocks P 0 and P 1 and the partitioning mode is a 2N ⁇ nU mode.
  • the size of the block P 0 is 2N ⁇ hN and the size of the block P 1 is 2N ⁇ (2 ⁇ h)N.
  • the value of h is 1 ⁇ 2.
  • the current block is the block P 1 .
  • the blocks A, B, C, D and E are spatial merge candidate blocks.
  • the block P 0 is the spatial merge candidate block B.
  • the spatial merge candidate B is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block C, D or E having the same motion information of the spatial merge candidate block B is set as unavailable.
  • FIG. 9 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
  • a coding unit is partitioned into two asymmetric prediction blocks P 0 and P 1 and the partitioning mode is a 2N ⁇ nD mode.
  • the size of the block P 0 is 2N ⁇ (2 ⁇ h)N and the size of the block P 1 is 2N ⁇ hN.
  • the value of h is 1 ⁇ 2.
  • the current block is the block P 1 .
  • the blocks A, B, C, D and E are spatial merge candidate blocks.
  • the block P 0 is the spatial merge candidate block B.
  • the spatial merge candidate B is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block C, D or E having the same motion information of the spatial merge candidate block B is set as unavailable.
  • the spatial merge candidate may also be set as unavailable based on merge area. If the current block and the spatial merge candidate block belong to same merge area, the spatial merge candidate block is set as unavailable.
  • the merge area is a unit area in which motion estimation is performed and information specifying the merge area is included in a bit stream.
  • a temporal merge candidate is derived (S 220 ).
  • the temporal merge candidate includes a reference picture index and a motion vector of the temporal merge candidate.
  • the reference picture index of the temporal merge candidate may be derived using one or more reference picture indexes of neighboring block. For example, one of the reference picture indexes of a left neighboring block, an above neighboring block and a corner neighboring block is set as the reference picture index of the temporal merge candidate.
  • the corner neighboring block is one of an above-right neighboring block, a left-below neighboring block and an above-left neighboring block.
  • the reference picture index of the temporal merge candidate may be set to zero to reduce the complexity.
  • the motion vector of the temporal merge candidate may be derived as follows.
  • a temporal merge candidate picture is determined.
  • the temporal merge candidate picture includes a temporal merge candidate block.
  • One temporal merge candidate picture is used within a slice.
  • a reference picture index of the temporal merge candidate picture may be set to zero.
  • the current slice is a P slice
  • one of the reference pictures of the reference picture list 0 is set as the temporal merge candidate picture.
  • the current slice is a B slice
  • one of the reference pictures of the reference picture lists 0 and 1 is set as the temporal merge candidate picture.
  • a list indicator specifying whether the temporal merge candidate picture belongs to the reference picture lists 0 or 1 is included in a slice header if the current slice is a B slice.
  • the reference picture index specifying the temporal merge candidate picture may be included in the slice header.
  • FIG. 10 is a conceptual diagram illustrating position of temporal merge candidate block according to the present invention.
  • a first candidate block may be a right-below corner block (block H) of the block C.
  • the block C has same size and same location of the current block and is located within the temporal merge candidate picture.
  • a second candidate block is a block covering an upper-left pixel of the center of the block C.
  • the temporal merge candidate block may be the first candidate block or the second candidate block. If the first candidate block is available, the first candidate block is set as the temporal merge candidate block. If the first candidate block is unavailable, the second candidate block is set as the temporal merge candidate block. If the second candidate block is unavailable, the temporal merge candidate block is set as unavailable.
  • the temporal merge candidate block is determined based on the position of the current block. For example, if the current block is adjacent to a lower LCU (that is, if the first candidate block belongs to a lower LCU), the first candidate block may be changed into a block within a current LCU or is set as unavailable.
  • the first and second candidate blocks may be changed into another block based on each position of the candidate block within a motion vector storing unit.
  • the motion vector storing unit is a basic unit storing motion information of reference pictures.
  • FIG. 11 is a conceptual diagram illustrating a method of storing motion information according to the present invention.
  • the motion storing unit may be a 16 ⁇ 16 block.
  • the motion vector storing unit may be divided into sixteen 4 ⁇ 4 bocks. If the motion vector storing unit is a 16 ⁇ 16 block, the motion information is stored per the motion vector storing unit. If the motion vector storing unit includes multiple prediction units of reference picture, motion information of a predetermined prediction unit of the multiple prediction units is stored in memory to reduce amount of motion information to be stored in memory.
  • the predetermined prediction unit may be a block covering one of the sixteen 4 ⁇ 4 blocks.
  • the predetermined prediction unit may be a block covering a block C 3 , a block BR. Or the predetermined prediction unit may be a block covering a block UL.
  • the candidate block if the candidate block does not include the predetermined block, the candidate block is changed into a block including the predetermined block.
  • the motion vector of the temporal merge candidate block is set as the motion vector of the temporal merge candidate.
  • a merge candidate list is constructed (S 230 ).
  • the available spatial candidates and the available temporal candidate are listed in a predetermined order.
  • the spatial merge candidates are listed up to four in the order of A, B, C, D and E.
  • the temporal merge candidate may be listed between B and C or after the spatial candidates.
  • merge candidate list If the number of merge candidates listed in the merge candidate list is smaller than a predetermined number of the merge candidates, one or more merge candidates are generated (S 250 ). The generated merge candidate is listed after the last available merge candidate.
  • the merge candidate may be generated by combining the list 0 motion information and the list 1 motion information. Multiple merge candidates may be generated if there are multiple combinations.
  • One or more zero merge candidates may be added to the list. If the slice type is P, the zero merge candidate has only list 0 motion information. If the slice type is B, the zero merge candidate has list 0 motion information and list 1 motion information.
  • a merge predictor is selected among the merge candidates of the merge list, a merge index specifying the merge predictor is encoded (S 260 ).
  • FIG. 12 is a block diagram of an image decoding apparatus 200 according to the present invention.
  • the image decoding apparatus 200 includes an entropy decoding unit 210 , an inverse scanning unit 220 , an inverse quantization unit 230 , an inverse transform unit 240 , an intra prediction unit 250 , an inter prediction unit 260 , a post-processing unit 270 , a picture storing unit 280 and an adder 290 .
  • the entropy decoding unit 210 extracts the intra prediction information, the inter prediction information and the quantized coefficient components from a received bit stream using a context-adaptive binary arithmetic decoding method.
  • the inverse scanning unit 220 applies an inverse scan pattern to the quantized coefficient components to generate quantized block.
  • the inverse scan pattern is a diagonal scan.
  • the quantized coefficient components include the significant flags, the coefficient signs and the coefficients levels.
  • the significant flags, the coefficient signs and the coefficients levels are inversely scanned in the unit of subset using the diagonal scan to generate subsets, and the subsets are inversely scanned using the diagonal scan to generate the quantized block.
  • the predetermined size is equal to the size of the subset.
  • the subset is a 4 ⁇ 4 block including 16 transform coefficients.
  • the significant flags, the coefficient signs and the coefficient levels are inversely scanned in the reverse direction.
  • the subsets are also inversely scanned in the reverse direction.
  • a parameter indicating last non-zero coefficient position and the non-zero subset flags are extracted from the bit stream.
  • the number of encoded subsets is determined based on the parameter indicating last non-zero coefficient position.
  • the non-zero subset flag is used to determine whether the corresponding subset has at least one non-zero coefficient. If the non-zero subset flag is equal to 1, the subset is generated using the diagonal scan. The first subset and the last subset are generated using the inverse scan pattern.
  • the inverse quantization unit 230 receives the differential quantization parameter from the entropy decoding unit 210 and generates the quantization parameter predictor to generate the quantization parameter of the coding unit.
  • the operation of generating the quantization parameter predictor is the same as the operation of the quantization unit 150 of FIG. 1 .
  • the quantization parameter of the current coding unit is generated by adding the differential quantization parameter and the quantization parameter predictor. If the differential quantization parameter for the current coding unit is not transmitted from an encoding side, the differential quantization parameter is set to zero.
  • the inverse quantization unit 230 inversely quantizes the quantized block.
  • the inverse transform unit 240 inversely transforms the inverse-quantized block to generate a residual block.
  • An inverse transform matrix is adaptively determined according to the prediction mode and the size of the transform unit.
  • the inverse transform matrix is a DCT-based integer transform matrix or a DST-based integer transform matrix. In inter prediction, the DCT-based integer transforms are used.
  • the intra prediction unit 250 derives an intra prediction mode of a current prediction unit using the received intra prediction information, and generates a prediction block according to the derived intra prediction mode.
  • the inter prediction unit 260 derives the motion information of the current prediction unit using the received inter prediction information, and generates a prediction block using the motion information.
  • the post-processing unit 270 operates the same as the post-processing unit 180 of FIG. 1 .
  • the picture storing unit 280 receives post-processed image from the post-processing unit 270 , and stores the image in picture units.
  • a picture may be a frame or a field.
  • the adder 290 adds the restored residual block and a prediction block to generate a reconstructed block.
  • FIG. 13 is a flow chart illustrating a method of decoding an image in inter prediction mode according to the present invention.
  • Motion information of a current block is derived (S 310 ).
  • the current block is a prediction unit.
  • a size of the current block is determined by the size of the coding unit and the partitioning mode.
  • the motion information varies according to a prediction type. If the prediction type is a uni-directional prediction, the motion information includes a reference index specifying a picture of a reference list 0, and a motion vector. If the prediction type is a bi-directional prediction, the motion information includes a reference index specifying a picture of a reference list 0, a reference index specifying a picture of a reference list 1, and a list 0 motion vector and a list 1 motion vector.
  • the motion information is adaptively decoded according the coding mode of the motion information.
  • the coding mode of the motion information is determined by a skip flag and a merge flag. If the skip flag is equal to 1, the merge flag does not exist and the coding mode is a skip mode. If the skip flag is equal to 0 and the merge flag is equal to 1, the coding mode is a merge mode. If the skip flag and the merge flag are equal to 0, the coding mode is an AMVP mode.
  • a prediction block of the current block is generated using the motion information (S 320 ).
  • the prediction block is generated by copying a block of the reference picture specified by the motion vector. If the motion vector indicates a sub-pixel location, the prediction block is generated by interpolating the pixels of the reference picture.
  • the motion vector is given in quarter-pixel units.
  • the pixels labeled with L 0 , R 0 , R 1 , L 1 , A 0 and B 0 are integer position pixels of the reference picture and the pixels labeled with a L0 to r L0 at sub-pixel locations are fractional pixels to be interpolated using an interpolation filter which is selected based on the motion vector.
  • a pixel to be interpolated is located at a sub-pixel location a L0 , b L0 or c L0 , the pixel labeled with a L0 , b L0 or c L0 is generated by applying an interpolation filter to horizontally nearest integer position pixels. If a pixel to be interpolated is located at a sub-pixel location d L0 , h L0 or n L0 , the pixel labeled with d L0 , h L0 or n L0 is generated by applying an interpolation filter to vertically nearest integer position pixels.
  • the pixel labeled with e L0 , i L0 or p L0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘a’ within its label. If a pixel to be interpolated is located at a sub-pixel location g L0 , k L0 or r L0 , the pixel labeled with g L0 , k L0 or r L0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘c’ within its label.
  • the pixel labeled with f L0 , j L0 or q L0 is generated by applying an interpolation filter to vertically neighboring interpolated pixels each of which includes a character ‘c’ within its label.
  • the interpolation filter is determined based on the sub-pixel location of the pixel to be interpolated, or based on a prediction mode and a sub-pixel location of the pixel to be interpolated.
  • 6-tap symmetry filter may be used to interpolate pixels of half-pixel location H
  • 5-tap asymmetry filter may be used to interpolate pixels of quarter-pixel location FL or FR
  • 8-tap symmetry filter may be used for the half-pixel location H
  • 8-tap asymmetry filter may be used for the quarter-pixel location FL and FR.
  • the filter may be determined by only the sub-pixel location of the pixel to be interpolated.
  • 8-tap symmetry filter may be used to interpolate pixels of half-pixel locations and 7-tap asymmetry filter or 6-tap may be used to interpolate pixels of quarter-pixel locations.
  • same filter or another filter having smaller number of taps may be used to interpolate pixels of sub-pixel locations.
  • a residual block is generated (S 330 ).
  • the residual block is generated by the entropy decoding unit 210 , the inverse scanning unit 220 , the inverse quantization unit 230 and the inverse transform unit 240 of FIG. 12 .
  • a reconstructed block is generated using the prediction block and the residual block (S 340 ).
  • the prediction block has the same size of the prediction unit, and the residual block has the same size of the transform unit. Therefore, the residual signals and the prediction signals of same size are added to generate reconstructed signals.
  • FIG. 14 is a flow chart illustrating a method of deriving motion information in merge mode.
  • a merge index is extracted from a bit stream (S 410 ). If the merge index does not exist, the number of merge candidates is set to one.
  • Spatial merge candidates are derived (S 420 ).
  • the available spatial merge candidates are the same as describe in S 210 of FIG. 4 .
  • a temporal merge candidate is derived (S 430 ).
  • the temporal merge candidate includes a reference picture index and a motion vector of the temporal merge candidate.
  • the reference index and the motion vector of the temporal merge candidate are the same as described in S 220 of FIG. 4 .
  • a merge candidate list is constructed (S 440 ).
  • the merge list is the same as described in S 230 of FIG. 4 .
  • merge candidate list If the number of merge candidates listed in the merge candidate list is smaller than a predetermined number of the merge candidates, one or more merge candidates are generated (S 460 ).
  • the generated merge candidate is listed after the last available merge candidate.
  • the merge candidate is generated as the same method described in S 250 of FIG. 4 .
  • the merge candidate specified by the merge index is set as the motion information of the current block (S 470 ).
  • FIG. 15 is a flow chart illustrating a procedure of generating a residual block in inter prediction mode according to the present invention.
  • Quantized coefficient components are generated by the entropy decoding unit (S 510 ).
  • a quantized block is generated by inversely scanning the quantized coefficient components according to the diagonal scan (S 520 ).
  • the quantized coefficient components include the significant flags, the coefficient signs and the coefficients levels.
  • the significant flags, the coefficient signs and the coefficients levels are inversely scanned in the unit of subset using the diagonal scan to generate subsets, and the subsets are inversely scanned using the diagonal scan to generate the quantized block.
  • the predetermined size is equal to the size of the subset.
  • the subset is a 4 ⁇ 4 block including 16 transform coefficients.
  • the significant flags, the coefficient signs and the coefficient levels are inversely scanned in the reverse direction.
  • the subsets are also inversely scanned in the reverse direction.
  • the parameter indicating last non-zero coefficient position and the non-zero subset flags are extracted from the bit stream.
  • the number of encoded subsets is determined based on the parameter indicating last non-zero coefficient position.
  • the non-zero subset flags are used to determine whether the subset has at least one non-zero coefficient. If the non-zero subset flag is equal to 1, the subset is generated using the diagonal scan. The first subset and the last subset are generated using the inverse scan pattern.
  • the quantized block is inversely quantized using an inverse quantization matrix and a quantization parameter (S 530 ).
  • the MinQUSize indicates the minimum size of the quantization unit
  • the MaxCUSize indicates the size of LCU.
  • the parameter cu_qp_delta_enabled_info is extracted from a picture parameter set.
  • a differential quantization parameter of the current coding unit is derived.
  • the differential quantization parameter is included per quantization unit. Therefore, if the size of the current coding unit is equal to or larger than the minimum size of the quantization unit, the differential quantization parameter for the current coding unit is restored. If the differential quantization parameter does not exist, the differential quantization parameter is set to zero. If multiple coding units belong to a quantization unit, the first coding unit containing at least one non-zero coefficient in the decoding order contains the differential quantization unit.
  • a coded differential quantization parameter is arithmetically decoded to generate bin string indicating the absolute value of the differential quantization parameter and a bin indicating the sign of the differential quantization parameter.
  • the bin string may be a truncated unary code. If the absolute value of the differential quantization parameter is zero, the bin indicating the sign does not exist.
  • the differential quantization parameter is derived using the bin string indicating the absolute value and the bin indicating the sign.
  • a quantization parameter predictor of the current coding unit is derived.
  • the quantization parameter predictor is generated by using quantization parameters of neighboring coding units and quantization parameter of previous coding unit as follows.
  • a left quantization parameter, an above quantization parameter and a previous quantization parameter are sequentially retrieved in this order.
  • An average of the first two available quantization parameters retrieved in that order is set as the quantization parameter predictor when two or more quantization parameters are available, and when only one quantization parameter is available, the available quantization parameter is set as the quantization parameter predictor. That is, if the left and above quantization parameter are available, the average of the left and above quantization parameter is set as the quantization parameter predictor. If only one of the left and above quantization parameter is available, the average of the available quantization parameter and the previous quantization parameter is set as the quantization parameter predictor. If both of the left and above quantization parameter are unavailable, the previous quantization parameter is set as the quantization parameter predictor.
  • the quantization parameter predictor for the first coding unit in decoding order is derived and used for the other coding units.
  • the quantization parameter of the current coding unit is generated using the differential quantization parameter and the quantization parameter predictor.
  • a residual block is generated by inverse-transforming the inverse-quantized block (S 540 ).
  • One dimensional horizontal and vertical inverse DCT based-transforms are used.

Abstract

Provided is a method derives a reference picture index and a motion vector of a current prediction unit, generates a prediction block of the current prediction unit using the reference picture index and the motion vector, generating a residual block by inverse-scan, inverse-quantization and inverse transform, and generates reconstructed pixels using the prediction block and the residual block. Prediction pixels of the prediction block is generated using an interpolation filter selected based on the motion vector. Accordingly, the coding efficiency of the motion information is improved by including various merge candidates. Also, the computational complexity of an encoder and a decoder is reduced by selecting different filter according to location of the prediction pixels determined by the motion vector.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS
The present application is a continuation of U.S. patent application Ser. No. 14/349,979 filed on Apr. 4, 2014, which is a National Stage of International Patent Application No. PCT/CN2012/084018 filed on Nov. 2, 2012, which claims priority to Korean Patent Application No. 10-2011-0115348 filed on Nov. 7, 2011, the disclosures of which are hereby incorporated in their entirety by reference.
TECHNICAL FIELD
The present invention relates to a method of decoding video data, and more particularly, to a method of deriving motion information in merge mode by constructing a merge candidate list using spatial and temporal merge candidates and generating a prediction block using the motion information.
BACKGROUND ART
Methods for compressing video data include MPEG-2, MPEG-4 and H.264/MPEG-4 AVC. According to these methods, one picture is divided into macroblocks to encode an image, the respective macroblocks are encoded by generating a prediction block using inter prediction or intra prediction. The difference between an original block and the prediction block is transformed to generate a transformed block, and the transformed block is quantized using a quantization parameter and one of a plurality of predetermined quantization matrices. The quantized coefficient of the quantized block are scanned by a predetermined scan type and then entropy-coded. The quantization parameter is adjusted per macroblock and encoded using a previous quantization parameter.
In H.264/MPEG-4 AVC, motion estimation is used to eliminate temporal redundancy between consecutive pictures. To detect the temporal redundancy, one or more reference pictures are used to estimate motion of a current block, and motion compensation is performed to generate a prediction block using motion information. The motion information includes one or more reference picture indexes and one or more motion vectors.
According to the H.264/MPEG-4 AVC, only the motion vectors are predicted and encoded using neighboring motion vectors, and the reference picture indexes are encoded without neighboring reference picture indexes. Also, the computational complexity for generating a prediction block is high because the prediction block is interpolated using a long-tap filter.
However, if various sizes are used for inter prediction, the correlation between motion information of a current block and motion information of one or more neighboring block increases. The correlation between motion vector of a current block and motion vector of neighboring block within a reference picture becomes higher as the picture size becomes larger if motion of image is almost constant or slow. Accordingly, the conventional compression method described above decreases compression efficiency of motion information if the picture size is larger than that of high-definition picture and various sizes are allowed for motion estimation and motion compensation.
DISCLOSURE Technical Problem
The present invention is directed to a method of decoding video data by deriving motion information by constructing a merge candidate list using spatial merge candidates and temporal candidate and generating prediction block using a filter determined by the motion vector.
Technical Solution
One aspect of the present invention provides a method of decoding video data, comprising: deriving a reference picture index and a motion vector of a current prediction unit; generating a prediction block of the current prediction unit using the reference picture index and the motion vector; generating a quantized block by inverse-scanning quantized coefficient components; generating a transformed block by inverse-quantizing the quantized block using a quantization parameter; generating a residual block by inverse-transforming the transformed block; and generating a reconstructed pixels using the prediction block and the residual block. Prediction pixels of the prediction block is generated using an interpolation filter selected based on the motion vector.
Advantageous Effects
A method according to the present invention derives a reference picture index and a motion vector of a current prediction unit, generates a prediction block of the current prediction unit using the reference picture index and the motion vector, generating a residual block by inverse-scan, inverse-quantization and inverse transform, and generates reconstructed pixels using the prediction block and the residual block. Prediction pixels of the prediction block is generated using an interpolation filter selected based on the motion vector. Accordingly, the coding efficiency of the motion information is improved by including various merge candidates. Also, the computational complexity of an encoder and a decoder is reduced by selecting different filter according to location of the prediction pixels determined by the motion vector.
DESCRIPTION OF DRAWINGS
FIG. 1 is a block diagram of an image coding apparatus according to the present invention.
FIG. 2 is a flow chart illustrating a method of encoding video data in an inter prediction mode according to the present invention.
FIG. 3 is a conceptual diagram illustrating pixel positions indicated by a motion vector according to the present invention.
FIG. 4 is a flow chart illustrating a method of encoding motion information in a merge mode according to the present invention.
FIG. 5 is a conceptual diagram illustrating positions of spatial merge candidate blocks according to the present invention.
FIG. 6 is a conceptual diagram illustrating positions of spatial merge candidate blocks in an asymmetric partitioning mode according to the present invention.
FIG. 7 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
FIG. 8 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
FIG. 9 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
FIG. 10 is a conceptual diagram illustrating position of temporal merge candidate block according to the present invention.
FIG. 11 is a conceptual diagram illustrating a method of storing motion information according to the present invention.
FIG. 12 is a block diagram of an image decoding apparatus 200 according to the present invention.
FIG. 13 is a flow chart illustrating a method of decoding an image in inter prediction mode according to the present invention.
FIG. 14 is a flow chart illustrating a method of deriving motion information in merge mode.
FIG. 15 is a flow chart illustrating a procedure of generating a residual block in inter prediction mode according to the present invention.
MODE FOR INVENTION
Hereinafter, various embodiments of the present invention will be described in detail with reference to the accompanying drawings. However, the present invention is not limited to the exemplary embodiments disclosed below, but can be implemented in various types. Therefore, many other modifications and variations of the present invention are possible, and it is to be understood that within the scope of the disclosed concept, the present invention may be practiced otherwise than as has been specifically described.
An image encoding apparatus and an image decoding apparatus according to the present invention may be a user terminal such as a personal computer, a personal mobile terminal, a mobile multimedia player, a smartphone or a wireless communication terminal. The image encoding device and the image decoding device may be include a communication unit for communicating with various devices, a memory for storing various programs and data used to encode or decode images.
FIG. 1 is a block diagram of an image coding apparatus 100 according to the present invention.
Referring to FIG. 1, the image coding apparatus 100 according to the present invention includes a picture division unit 110, an intra prediction unit 120, an inter prediction unit 130, a transform unit 140, a quantization unit 150, a scanning unit 160, an entropy coding unit 170, an inverse quantization/transform unit 180, a post-processing unit 190 and a picture storing unit 195.
The picture division unit 110 divides a picture or a slice into plural largest coding units (LCUs), and divides each LCU into one or more coding units. The size of LCU may be 32×32, 64×64 or 128×128. The picture division unit 110 determines prediction mode and partitioning mode of each coding unit.
An LCU includes one or more coding units. The LCU has a recursive quad tree structure to specify a division structure of the LCU. Parameters for specifying the maximum size and the minimum size of the coding unit are included in a sequence parameter set. The division structure is specified by one or more split coding unit flags (split_cu_flags). The size of a coding unit is 2N×2N. If the size of the LCU is 64×64 and the size of a smallest coding unit (SCU) is 8×8, the size of the coding unit may be 64×64, 32×32, 16×16 or 8×8.
A coding unit includes one or more prediction units. In intra prediction, the size of the prediction unit is 2N×2N or N×N. In inter prediction, the size of the prediction unit is specified by the partitioning mode. The partitioning mode is one of 2N×2N, 2N×N, N×2N and N×N if the coding unit is partitioned symmetrically. The partitioning mode is one of 2N×nU, 2N×nD, nL×2N and nR×2N if the coding unit is partitioned asymmetrically. The partitioning modes are allowed based on the size of the coding unit to reduce complexity of hardware. If the coding unit has a minimum size, the asymmetric partitioning is not allowed. Also, if the coding unit has the minimum size, N×N partitioning mode may not be allowed.
A coding unit includes one or more transform units. The transform unit has a recursive quad tree structure to specify a division structure of the coding unit. The division structure is specified by one or more split transform unit flags (split_tu_flags). Parameters for specifying the maximum size and the minimum size of the luma transform unit are included in a sequence parameter set.
The intra prediction unit 120 determines an intra prediction mode of a current prediction unit and generates a prediction block using the intra prediction mode.
The inter prediction unit 130 determines motion information of a current prediction unit using one or more reference pictures stored in the picture storing unit 195, and generates a prediction block of the prediction unit. The motion information includes one or more reference picture indexes and one or more motion vectors.
The transform unit 140 transforms a residual block to generate a transformed block. The residual block has the same size of the transform unit. If the prediction unit is larger than the transform unit, the residual signals between the current block and the prediction block are partitioned into multiple residual blocks.
The quantization unit 150 determines a quantization parameter for quantizing the transformed block. The quantization parameter is a quantization step size. The quantization parameter is determined per quantization unit. The size of the quantization unit may vary and be one of allowable sizes of coding unit. If a size of the coding unit is equal to or larger than a minimum size of the quantization unit, the coding unit becomes the quantization unit. A plurality of coding units may be included in a quantization unit of minimum size. The minimum size of the quantization unit is determined per picture and a parameter for specifying the minimum size of the quantization unit is included in a picture parameter set.
The quantization unit 150 generates a quantization parameter predictor and generates a differential quantization parameter by subtracting the quantization parameter predictor from the quantization parameter. The differential quantization parameter is entropy-coded.
The quantization parameter predictor is generated by using quantization parameters of neighboring coding units and a quantization parameter of previous coding unit as follows.
A left quantization parameter, an above quantization parameter and a previous quantization parameter are sequentially retrieved in this order. An average of the first two available quantization parameters retrieved in that order is set as the quantization parameter predictor when two or more quantization parameters are available, and when only one quantization parameter is available, the available quantization parameter is set as the quantization parameter predictor. That is, if the left and above quantization parameters are available, an average of the left and above quantization parameters is set as the quantization parameter predictor. If only one of the left and above quantization parameters is available, an average of the available quantization parameter and the previous quantization parameters is set as the quantization parameter predictor. If both of the left and above quantization parameters are unavailable, the previous quantization parameter is set as the quantization parameter predictor. The average is rounded off.
The differential quantization parameter is converted into bins for the absolute value of the differential quantization parameter and a bin for indicating sign of the differential quantization parameter through a binarization process, and the bins are arithmetically coded. If the absolute value of the differential quantization parameter is 0, the bin for indicating sign may be omitted. Truncated unary is used for binarization of the absolute.
The quantization unit 150 quantizes the transformed block using a quantization matrix and the quantization parameter to generate a quantized block. The quantized block is provided to the inverse quantization/transform unit 180 and the scanning unit 160.
The scanning unit 160 determines applies a scan pattern to the quantized block.
In inter prediction, a diagonal scan is used as the scan pattern if CABAC is used for entropy coding. The quantized coefficients of the quantized block are split into coefficient components. The coefficient components are significant flags, coefficient signs and coefficient levels. The diagonal scan is applied to each of the coefficient components. The significant coefficient indicates whether the corresponding quantized coefficient is zero or not. The coefficient sign indicates a sign of non-zero quantized coefficient, and the coefficient level indicates an absolute value of non-zero quantized coefficient.
When the size of the transform unit is larger than a predetermined size, the quantized block is divided into multiple subsets and the diagonal scan is applied to each subset. Significant flags, coefficient signs and coefficients levels of each subset are scanned respectively according to the diagonal scan. The predetermined size is 4×4. The subset is a 4×4 block containing 16 transform coefficients.
The scan pattern for scanning the subsets is the same as the scan pattern for scanning the coefficient components. The significant flags, the coefficient signs and the coefficients levels of each subset are scanned in the reverse direction. The subsets are also scanned in the reverse direction.
A parameter indicating last non-zero coefficient position is encoded and transmitted to a decoding side. The parameter indicating last non-zero coefficient position specifies a position of last non-zero quantized coefficient within the quantized block. A non-zero subset flag is defined for each subset other than the first subset and the last subset and is transmitted to the decoding side. The first subset covers a DC coefficient. The last subset covers the last non-zero coefficient. The non-zero subset flag indicates whether the subset contains non-zero coefficients or not.
The entropy coding unit 170 entropy-codes the scanned component by the scanning unit 160, intra prediction information received from the intra prediction unit 120, motion information received from the inter prediction unit 130, and so on.
The inverse quantization/transform unit 180 inversely quantizes the quantized coefficients of the quantized block, and inversely transforms the inverse quantized block to generate residual signals.
The post-processing unit 190 performs a deblocking filtering process for removing blocking artifact generated in a reconstructed picture.
The picture storing unit 195 receives post-processed image from the post-processing unit 190, and stores the image in picture units. A picture may be a frame or a field.
FIG. 2 is a flow chart illustrating a method of encoding video data in an inter prediction mode according to the present invention.
Motion information of a current block is determined (S110). The current block is a prediction unit. A size of the current block is determined by a size and a partitioning mode of the coding unit.
The motion information varies according to a prediction type. If the prediction type is a uni-directional prediction, the motion information includes a reference index specifying a picture of a reference list 0, and a motion vector. If the prediction type is a bi-directional prediction, the motion information includes two reference indexes specifying a picture of a reference list 0 and a picture of a reference list 1, and a list 0 motion vector and a list 1 motion vector.
A prediction block of the current block is generated using the motion information (S120).
If the motion vector indicates an integer-pixel location, the prediction block is generated by copying a block of the reference picture specified by the motion vector. If the motion vector indicates a sub-pixel location, the prediction block is generated by interpolating the pixels of the reference picture. The motion vector is given in quarter-pixel units.
FIG. 3 is a conceptual diagram illustrating pixel positions indicated by a motion vector according to the present invention.
In FIG. 3, the pixels labeled with L0, R0, R1, L1, A0 and B0 are integer position pixels of the reference picture and the pixels labeled with aL0 to rL0 at sub-pixel locations are fractional pixels to be interpolated using an interpolation filter which is selected based on the motion vector.
If a pixel to be interpolated is located at a sub-pixel location aL0, bL0 or cL0, the pixel labeled with aL0, bL0 or cL0 is generated by applying an interpolation filter to horizontally nearest integer position pixels. If a pixel to be interpolated is located at a sub-pixel location dL0, hL0 or nL0, the pixel labeled with dL0, hL0 or nL0 is generated by applying an interpolation filter to vertically nearest integer position pixels. If a pixel to be interpolated is located at a sub-pixel location eL0, iL0 or pL0, the pixel labeled with eL0, iL0 or pL0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘a’ within its label. If a pixel to be interpolated is located at a sub-pixel location gL0, kL0 or rL0, the pixel labeled with gL0, kL0 or rL0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘c’ within its label. If a pixel to be interpolated is located at a sub-pixel location fL0, jL0 or qL0, the pixel labeled with fL0, jL0 or qL0 is generated by applying an interpolation filter to vertically neighboring interpolated pixels each of which includes a character ‘c’ within its label.
The interpolation filter is determined based on the sub-pixel location of the pixel to be interpolated, or based on a prediction mode and a sub-pixel location of the pixel to be interpolated.
Table 1 shows exemplary filters. The sub-pixel location H indicates a half-pixel location in interpolation direction. For example, the locations bL0, hL0, iL0, IL0, and kL0 correspond to the sub-pixel location H. The sub-pixel locations FL and FR indicate a quarter-pixel location in interpolation direction. For example, the locations aL0, dL0, eL0, fL0, and gL0 correspond to the sub-pixel location FL, and the locations cL0, nL0, pL0, qL0, and rL0 correspond to the sub-pixel location FR.
TABLE 1
Sub-Pixel
Prediction mode Location Filter coefficient
Uni-directional H {2, −8, 36, 36, −8, 2}
prediction FL {−3, 51, 20, −7, 2}
FR {2, −7, 20, 51, −3}
H {−1, 4, −11, 40, 40, −11, 4, −1}
Bi-directional FL {−1, 4, −10, 57, 19, −7, 3, −1}
prediction FR {−1, 3, −7, 19, 57, −10, 4, −1}
As shown in Table 1, in uni-directional prediction, 6-tap symmetry filter may be used to interpolate pixels of half-pixel location H, and 5-tap asymmetry filter may be used to interpolate pixels of quarter-pixel location FL or FR. In bi-directional prediction, 8-tap symmetry filter may be used for the half-pixel location H and 8-tap asymmetry filter may be used for the quarter-pixel location FL and FR.
Alternatively, the filter may be determined by only the sub-pixel location of the pixel to be interpolated. In uni-directional prediction, 8-tap symmetry filter may be used to interpolate pixels of half-pixel locations and 7-tap asymmetry filter or 6-tap asymmetry filter may be used to interpolate pixels of quarter-pixel locations. In bi-directional prediction, same filter or another filter having smaller number of taps may be used to interpolate pixels of sub-pixel locations.
A residual block is generated using the current block and the prediction block (S130). The residual block has the same size of the transform unit. If the prediction unit is larger than the transform unit, the residual signals between the current block and the prediction block are into multiple residual blocks.
The residual block is encoded (S140). The residual block is encoded by the transform unit 140, the quantization unit 150, the scanning unit 160 and the entropy coding unit 170 of FIG. 1.
The motion information is encoded (S150). The motion information may be encoded predictively using spatial candidates and a temporal candidate of the current block. The motion information is encoded in a skip mode, a merge mode or an AMVP mode. In the skip mode, the prediction unit has the size of coding unit and the motion information is encoded using the same method as that of the merge mode. In the merge mode, the motion information of the current prediction unit is equal to motion information of one candidate. In the AMVP mode, the motion vector of the motion information is predictively coded using one or more motion vector candidate.
FIG. 4 is a flow chart illustrating a method of encoding motion information in the merge mode according to the present invention.
Spatial merge candidates are derived (S210). FIG. 5 is a conceptual diagram illustrating positions of spatial merge candidate blocks according to the present invention.
As shown in FIG. 5, the merge candidate block is a left block (block A), an above block (block B), an above-right block (block C), a left-below block (block D) or an above-left block (block E) of the current block. The blocks are prediction blocks. The above-left block (block E) is set as merge candidate block when one or more of the blocks A, B, C and D are unavailable. The motion information of an available merge candidate block N is set as a spatial merge candidate N. N is A, B, C, D or E.
The spatial merge candidate may be set as unavailable according to the shape of the current block and the position of the current block. For example, if the coding unit is split into two prediction units (block P0 and block P1) using asymmetric partitioning, it is probable that the motion information of the block P0 is not equal to the motion information of the block P1. Therefore, if the current block is the asymmetric block P1, the block P0 is set as unavailable candidate block as shown in FIGS. 6 to 9.
FIG. 6 is a conceptual diagram illustrating positions of spatial merge candidate blocks in an asymmetric partitioning mode according to the present invention.
As shown in FIG. 6, a coding unit is partitioned into two asymmetric prediction blocks P0 and P1 and the partitioning mode is an nL×2N mode. The size of the block P0 is hN×2N and the size of the block P1 is (2−h)N×2N. The value of h is ½. The current block is the block P1. The blocks A, B, C, D and E are spatial merge candidate blocks. The block P0 is the spatial merge candidate block A.
In present invention, the spatial merge candidate A is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block B, C, D or E having the same motion information of the spatial merge candidate block A is set as unavailable.
FIG. 7 is another conceptual diagram illustrating positions of spatial merge candidate blocks in an asymmetric partitioning mode according to the present invention.
As shown in FIG. 7, a coding unit is partitioned into two asymmetric prediction blocks P0 and P1 and the partitioning mode is an nR×2N mode. The size of the block P0 is (2−h)N×2N and the size of the block P1 is hN×2N. The value of h is ½. The current block is the block P1. The blocks A, B, C, D and E are spatial merge candidate blocks. The block P0 is the spatial merge candidate block A.
In present invention, the spatial merge candidate A is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block B, C, D or E having the same motion information of the spatial merge candidate block A is set as unavailable.
FIG. 8 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
As shown in FIG. 8, a coding unit is partitioned into two asymmetric prediction blocks P0 and P1 and the partitioning mode is a 2N×nU mode. The size of the block P0 is 2N×hN and the size of the block P1 is 2N×(2−h)N. The value of h is ½. The current block is the block P1. The blocks A, B, C, D and E are spatial merge candidate blocks. The block P0 is the spatial merge candidate block B.
In present invention, the spatial merge candidate B is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block C, D or E having the same motion information of the spatial merge candidate block B is set as unavailable.
FIG. 9 is another conceptual diagram illustrating positions of spatial merge candidate blocks in another asymmetric partitioning mode according to the present invention.
As shown in FIG. 9, a coding unit is partitioned into two asymmetric prediction blocks P0 and P1 and the partitioning mode is a 2N×nD mode. The size of the block P0 is 2N×(2−h)N and the size of the block P1 is 2N×hN. The value of h is ½. The current block is the block P1. The blocks A, B, C, D and E are spatial merge candidate blocks. The block P0 is the spatial merge candidate block B.
In present invention, the spatial merge candidate B is set as unavailable not to be listed on the merge candidate list. Also, the spatial merge candidate block C, D or E having the same motion information of the spatial merge candidate block B is set as unavailable.
The spatial merge candidate may also be set as unavailable based on merge area. If the current block and the spatial merge candidate block belong to same merge area, the spatial merge candidate block is set as unavailable. The merge area is a unit area in which motion estimation is performed and information specifying the merge area is included in a bit stream.
A temporal merge candidate is derived (S220). The temporal merge candidate includes a reference picture index and a motion vector of the temporal merge candidate.
The reference picture index of the temporal merge candidate may be derived using one or more reference picture indexes of neighboring block. For example, one of the reference picture indexes of a left neighboring block, an above neighboring block and a corner neighboring block is set as the reference picture index of the temporal merge candidate. The corner neighboring block is one of an above-right neighboring block, a left-below neighboring block and an above-left neighboring block. Alternatively, the reference picture index of the temporal merge candidate may be set to zero to reduce the complexity.
The motion vector of the temporal merge candidate may be derived as follows.
First, a temporal merge candidate picture is determined. The temporal merge candidate picture includes a temporal merge candidate block. One temporal merge candidate picture is used within a slice. A reference picture index of the temporal merge candidate picture may be set to zero.
If the current slice is a P slice, one of the reference pictures of the reference picture list 0 is set as the temporal merge candidate picture. If the current slice is a B slice, one of the reference pictures of the reference picture lists 0 and 1 is set as the temporal merge candidate picture. A list indicator specifying whether the temporal merge candidate picture belongs to the reference picture lists 0 or 1 is included in a slice header if the current slice is a B slice. The reference picture index specifying the temporal merge candidate picture may be included in the slice header.
Next, the temporal merge candidate block is determined FIG. 10 is a conceptual diagram illustrating position of temporal merge candidate block according to the present invention. As shown in FIG. 10, a first candidate block may be a right-below corner block (block H) of the block C. The block C has same size and same location of the current block and is located within the temporal merge candidate picture. A second candidate block is a block covering an upper-left pixel of the center of the block C.
The temporal merge candidate block may be the first candidate block or the second candidate block. If the first candidate block is available, the first candidate block is set as the temporal merge candidate block. If the first candidate block is unavailable, the second candidate block is set as the temporal merge candidate block. If the second candidate block is unavailable, the temporal merge candidate block is set as unavailable.
The temporal merge candidate block is determined based on the position of the current block. For example, if the current block is adjacent to a lower LCU (that is, if the first candidate block belongs to a lower LCU), the first candidate block may be changed into a block within a current LCU or is set as unavailable.
Also, the first and second candidate blocks may be changed into another block based on each position of the candidate block within a motion vector storing unit. The motion vector storing unit is a basic unit storing motion information of reference pictures.
FIG. 11 is a conceptual diagram illustrating a method of storing motion information according to the present invention. As shown in FIG. 11, the motion storing unit may be a 16×16 block. The motion vector storing unit may be divided into sixteen 4×4 bocks. If the motion vector storing unit is a 16×16 block, the motion information is stored per the motion vector storing unit. If the motion vector storing unit includes multiple prediction units of reference picture, motion information of a predetermined prediction unit of the multiple prediction units is stored in memory to reduce amount of motion information to be stored in memory. The predetermined prediction unit may be a block covering one of the sixteen 4×4 blocks. The predetermined prediction unit may be a block covering a block C3, a block BR. Or the predetermined prediction unit may be a block covering a block UL.
Therefore, if the candidate block does not include the predetermined block, the candidate block is changed into a block including the predetermined block.
If the temporal merge candidate block is determined, the motion vector of the temporal merge candidate block is set as the motion vector of the temporal merge candidate.
A merge candidate list is constructed (S230). The available spatial candidates and the available temporal candidate are listed in a predetermined order. The spatial merge candidates are listed up to four in the order of A, B, C, D and E. The temporal merge candidate may be listed between B and C or after the spatial candidates.
It is determined whether one or more merge candidates are generated or not (S240). The determination is performed by comparing the number of merge candidates listed in the merge candidate list with a predetermined number of the merge candidates. The predetermined number may be determined per picture or slice.
If the number of merge candidates listed in the merge candidate list is smaller than a predetermined number of the merge candidates, one or more merge candidates are generated (S250). The generated merge candidate is listed after the last available merge candidate.
If the number of available merge candidates is equal to or greater than 2, one of two available merge candidates has list 0 motion information and the other has list 1 motion information, the merge candidate may be generated by combining the list 0 motion information and the list 1 motion information. Multiple merge candidates may be generated if there are multiple combinations.
One or more zero merge candidates may be added to the list. If the slice type is P, the zero merge candidate has only list 0 motion information. If the slice type is B, the zero merge candidate has list 0 motion information and list 1 motion information.
A merge predictor is selected among the merge candidates of the merge list, a merge index specifying the merge predictor is encoded (S260).
FIG. 12 is a block diagram of an image decoding apparatus 200 according to the present invention.
The image decoding apparatus 200 according to the present invention includes an entropy decoding unit 210, an inverse scanning unit 220, an inverse quantization unit 230, an inverse transform unit 240, an intra prediction unit 250, an inter prediction unit 260, a post-processing unit 270, a picture storing unit 280 and an adder 290.
The entropy decoding unit 210 extracts the intra prediction information, the inter prediction information and the quantized coefficient components from a received bit stream using a context-adaptive binary arithmetic decoding method.
The inverse scanning unit 220 applies an inverse scan pattern to the quantized coefficient components to generate quantized block. In inter prediction, the inverse scan pattern is a diagonal scan. The quantized coefficient components include the significant flags, the coefficient signs and the coefficients levels.
When the size of the transform unit is larger than the a predetermined size, the significant flags, the coefficient signs and the coefficients levels are inversely scanned in the unit of subset using the diagonal scan to generate subsets, and the subsets are inversely scanned using the diagonal scan to generate the quantized block. The predetermined size is equal to the size of the subset. The subset is a 4×4 block including 16 transform coefficients. The significant flags, the coefficient signs and the coefficient levels are inversely scanned in the reverse direction. The subsets are also inversely scanned in the reverse direction.
A parameter indicating last non-zero coefficient position and the non-zero subset flags are extracted from the bit stream. The number of encoded subsets is determined based on the parameter indicating last non-zero coefficient position. The non-zero subset flag is used to determine whether the corresponding subset has at least one non-zero coefficient. If the non-zero subset flag is equal to 1, the subset is generated using the diagonal scan. The first subset and the last subset are generated using the inverse scan pattern.
The inverse quantization unit 230 receives the differential quantization parameter from the entropy decoding unit 210 and generates the quantization parameter predictor to generate the quantization parameter of the coding unit. The operation of generating the quantization parameter predictor is the same as the operation of the quantization unit 150 of FIG. 1. Then, the quantization parameter of the current coding unit is generated by adding the differential quantization parameter and the quantization parameter predictor. If the differential quantization parameter for the current coding unit is not transmitted from an encoding side, the differential quantization parameter is set to zero.
The inverse quantization unit 230 inversely quantizes the quantized block.
The inverse transform unit 240 inversely transforms the inverse-quantized block to generate a residual block. An inverse transform matrix is adaptively determined according to the prediction mode and the size of the transform unit. The inverse transform matrix is a DCT-based integer transform matrix or a DST-based integer transform matrix. In inter prediction, the DCT-based integer transforms are used.
The intra prediction unit 250 derives an intra prediction mode of a current prediction unit using the received intra prediction information, and generates a prediction block according to the derived intra prediction mode.
The inter prediction unit 260 derives the motion information of the current prediction unit using the received inter prediction information, and generates a prediction block using the motion information.
The post-processing unit 270 operates the same as the post-processing unit 180 of FIG. 1.
The picture storing unit 280 receives post-processed image from the post-processing unit 270, and stores the image in picture units. A picture may be a frame or a field.
The adder 290 adds the restored residual block and a prediction block to generate a reconstructed block.
FIG. 13 is a flow chart illustrating a method of decoding an image in inter prediction mode according to the present invention.
Motion information of a current block is derived (S310). The current block is a prediction unit. A size of the current block is determined by the size of the coding unit and the partitioning mode.
The motion information varies according to a prediction type. If the prediction type is a uni-directional prediction, the motion information includes a reference index specifying a picture of a reference list 0, and a motion vector. If the prediction type is a bi-directional prediction, the motion information includes a reference index specifying a picture of a reference list 0, a reference index specifying a picture of a reference list 1, and a list 0 motion vector and a list 1 motion vector.
The motion information is adaptively decoded according the coding mode of the motion information. The coding mode of the motion information is determined by a skip flag and a merge flag. If the skip flag is equal to 1, the merge flag does not exist and the coding mode is a skip mode. If the skip flag is equal to 0 and the merge flag is equal to 1, the coding mode is a merge mode. If the skip flag and the merge flag are equal to 0, the coding mode is an AMVP mode.
A prediction block of the current block is generated using the motion information (S320).
If the motion vector indicates an integer-pixel location, the prediction block is generated by copying a block of the reference picture specified by the motion vector. If the motion vector indicates a sub-pixel location, the prediction block is generated by interpolating the pixels of the reference picture. The motion vector is given in quarter-pixel units.
As shown in FIG. 3, the pixels labeled with L0, R0, R1, L1, A0 and B0 are integer position pixels of the reference picture and the pixels labeled with aL0 to rL0 at sub-pixel locations are fractional pixels to be interpolated using an interpolation filter which is selected based on the motion vector.
If a pixel to be interpolated is located at a sub-pixel location aL0, bL0 or cL0, the pixel labeled with aL0, bL0 or cL0 is generated by applying an interpolation filter to horizontally nearest integer position pixels. If a pixel to be interpolated is located at a sub-pixel location dL0, hL0 or nL0, the pixel labeled with dL0, hL0 or nL0 is generated by applying an interpolation filter to vertically nearest integer position pixels. If a pixel to be interpolated is located at a sub-pixel location eL0, iL0 or pL0, the pixel labeled with eL0, iL0 or pL0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘a’ within its label. If a pixel to be interpolated is located at a sub-pixel location gL0, kL0 or rL0, the pixel labeled with gL0, kL0 or rL0 is generated by applying an interpolation filter to vertically nearest interpolated pixels each of which includes a character ‘c’ within its label. If a pixel to be interpolated is located at a sub-pixel location fL0, jL0 or qL0, the pixel labeled with fL0, jL0 or qL0 is generated by applying an interpolation filter to vertically neighboring interpolated pixels each of which includes a character ‘c’ within its label.
The interpolation filter is determined based on the sub-pixel location of the pixel to be interpolated, or based on a prediction mode and a sub-pixel location of the pixel to be interpolated.
As shown in Table 1, in uni-directional prediction, 6-tap symmetry filter may be used to interpolate pixels of half-pixel location H, and 5-tap asymmetry filter may be used to interpolate pixels of quarter-pixel location FL or FR. In bi-directional prediction, 8-tap symmetry filter may be used for the half-pixel location H and 8-tap asymmetry filter may be used for the quarter-pixel location FL and FR.
Alternatively, the filter may be determined by only the sub-pixel location of the pixel to be interpolated. In uni-directional prediction, 8-tap symmetry filter may be used to interpolate pixels of half-pixel locations and 7-tap asymmetry filter or 6-tap may be used to interpolate pixels of quarter-pixel locations. In bi-directional prediction, same filter or another filter having smaller number of taps may be used to interpolate pixels of sub-pixel locations.
A residual block is generated (S330). The residual block is generated by the entropy decoding unit 210, the inverse scanning unit 220, the inverse quantization unit 230 and the inverse transform unit 240 of FIG. 12.
A reconstructed block is generated using the prediction block and the residual block (S340).
The prediction block has the same size of the prediction unit, and the residual block has the same size of the transform unit. Therefore, the residual signals and the prediction signals of same size are added to generate reconstructed signals.
FIG. 14 is a flow chart illustrating a method of deriving motion information in merge mode.
A merge index is extracted from a bit stream (S410). If the merge index does not exist, the number of merge candidates is set to one.
Spatial merge candidates are derived (S420). The available spatial merge candidates are the same as describe in S210 of FIG. 4.
A temporal merge candidate is derived (S430). The temporal merge candidate includes a reference picture index and a motion vector of the temporal merge candidate. The reference index and the motion vector of the temporal merge candidate are the same as described in S220 of FIG. 4.
A merge candidate list is constructed (S440). The merge list is the same as described in S230 of FIG. 4.
It is determined whether one or more merge candidates are generated or not (S450). The determination is performed by comparing the number of merge candidates listed in the merge candidate list with a predetermined number of the merge candidates. The predetermined number is determined per picture or slice.
If the number of merge candidates listed in the merge candidate list is smaller than a predetermined number of the merge candidates, one or more merge candidates are generated (S460). The generated merge candidate is listed after the last available merge candidate. The merge candidate is generated as the same method described in S250 of FIG. 4.
The merge candidate specified by the merge index is set as the motion information of the current block (S470).
FIG. 15 is a flow chart illustrating a procedure of generating a residual block in inter prediction mode according to the present invention.
Quantized coefficient components are generated by the entropy decoding unit (S510).
A quantized block is generated by inversely scanning the quantized coefficient components according to the diagonal scan (S520). The quantized coefficient components include the significant flags, the coefficient signs and the coefficients levels.
When the size of the transform unit is larger than the a predetermined size, the significant flags, the coefficient signs and the coefficients levels are inversely scanned in the unit of subset using the diagonal scan to generate subsets, and the subsets are inversely scanned using the diagonal scan to generate the quantized block. The predetermined size is equal to the size of the subset. The subset is a 4×4 block including 16 transform coefficients. The significant flags, the coefficient signs and the coefficient levels are inversely scanned in the reverse direction. The subsets are also inversely scanned in the reverse direction.
The parameter indicating last non-zero coefficient position and the non-zero subset flags are extracted from the bit stream. The number of encoded subsets is determined based on the parameter indicating last non-zero coefficient position. The non-zero subset flags are used to determine whether the subset has at least one non-zero coefficient. If the non-zero subset flag is equal to 1, the subset is generated using the diagonal scan. The first subset and the last subset are generated using the inverse scan pattern.
The quantized block is inversely quantized using an inverse quantization matrix and a quantization parameter (S530).
A minimum size of quantization unit is determined A parameter cu_qp_delta_enabled_info specifying the minimum size is extracted from a bit stream, and the minimum size of the quantization unit is determined by the following equation.
Log 2(MinQUSize)=Log 2(MaxCUSize)−cu_qp_delta_enabled_info
The MinQUSize indicates the minimum size of the quantization unit, the MaxCUSize indicates the size of LCU. The parameter cu_qp_delta_enabled_info is extracted from a picture parameter set.
A differential quantization parameter of the current coding unit is derived. The differential quantization parameter is included per quantization unit. Therefore, if the size of the current coding unit is equal to or larger than the minimum size of the quantization unit, the differential quantization parameter for the current coding unit is restored. If the differential quantization parameter does not exist, the differential quantization parameter is set to zero. If multiple coding units belong to a quantization unit, the first coding unit containing at least one non-zero coefficient in the decoding order contains the differential quantization unit.
A coded differential quantization parameter is arithmetically decoded to generate bin string indicating the absolute value of the differential quantization parameter and a bin indicating the sign of the differential quantization parameter. The bin string may be a truncated unary code. If the absolute value of the differential quantization parameter is zero, the bin indicating the sign does not exist. The differential quantization parameter is derived using the bin string indicating the absolute value and the bin indicating the sign.
A quantization parameter predictor of the current coding unit is derived. The quantization parameter predictor is generated by using quantization parameters of neighboring coding units and quantization parameter of previous coding unit as follows.
A left quantization parameter, an above quantization parameter and a previous quantization parameter are sequentially retrieved in this order. An average of the first two available quantization parameters retrieved in that order is set as the quantization parameter predictor when two or more quantization parameters are available, and when only one quantization parameter is available, the available quantization parameter is set as the quantization parameter predictor. That is, if the left and above quantization parameter are available, the average of the left and above quantization parameter is set as the quantization parameter predictor. If only one of the left and above quantization parameter is available, the average of the available quantization parameter and the previous quantization parameter is set as the quantization parameter predictor. If both of the left and above quantization parameter are unavailable, the previous quantization parameter is set as the quantization parameter predictor.
If multiple coding units belong to a quantization unit of minimum size, the quantization parameter predictor for the first coding unit in decoding order is derived and used for the other coding units.
The quantization parameter of the current coding unit is generated using the differential quantization parameter and the quantization parameter predictor.
A residual block is generated by inverse-transforming the inverse-quantized block (S540). One dimensional horizontal and vertical inverse DCT based-transforms are used.
While the invention has been shown and described with reference to certain exemplary embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (8)

The invention claimed is:
1. A method of decoding video data in uni-directional prediction, the method comprising:
deriving a reference picture index and a motion vector of a current prediction unit;
generating a prediction block of the current prediction unit using the reference picture index and the motion vector;
generating a quantized block by inverse-scanning quantized coefficient components;
generating a transformed block by inverse-quantizing the quantized block using a quantization parameter;
generating a residual block by inverse-transforming the transformed block; and
generating a reconstructed pixels using the prediction block and the residual block,
wherein prediction pixels of the prediction block are generated using an interpolation filter selected based on the motion vector, the interpolation filter is a 7-tap asymmetry filter if the motion vector indicates a quarter pixel position, and the interpolation filter is a 8-tap filter if the motion vector indicates a half pixel position, and
wherein the quantization parameter is generated using a quantization parameter predictor and a differential quantization parameter, and the quantization parameter predictor is generated by averaging two quantization parameters of a left quantization parameter, an above quantization parameter and a previous quantization parameter if two or more quantization parameters are available.
2. The method of claim 1, wherein if only one of the left quantization parameter and the above quantization parameter is available, the quantization parameter predictor is an average of the previous quantization parameter and the available one of the left quantization parameter and the above quantization parameter.
3. The method of claim 1, wherein the quantization parameter is derived per a quantization unit, and a size of the quantization unit is one of allowable sizes of a coding unit.
4. The method of claim 1, wherein a number of taps of the interpolation filter is determined by the prediction pixel position indicated by the motion vector.
5. The method of claim 1, wherein the reference picture index and the motion vector of the current prediction unit are a reference picture index and a motion vector of a spatial or temporal merge candidate specified by a merge index, and
if the current block is a second prediction unit partitioned by asymmetric partitioning, a spatial merge candidate corresponding to a first prediction unit partitioned by the asymmetric partitioning is set as unavailable.
6. The method of claim 5, wherein if the size of the current prediction unit is (3/2)N×2N, a left spatial merge candidate is set as unavailable.
7. The method of claim 5, wherein a motion vector of the temporal merge candidate is a motion vector of a temporal merge candidate block within a temporal merge candidate picture, and a position of the temporal merge candidate block is determined depending on a position of the current block within an LCU (largest coding unit).
8. The method of claim 1, wherein if both of the left quantization parameter and the above quantization parameter are unavailable, the quantization parameter predictor is set as the previous quantization parameter.
US14/618,833 2011-11-07 2015-02-10 Method of decoding video data Active US9351012B2 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
US14/618,833 US9351012B2 (en) 2011-11-07 2015-02-10 Method of decoding video data
US14/692,680 US9648343B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,690 US9641860B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,679 US9615106B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,691 US9635384B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US15/481,954 US10212449B2 (en) 2011-11-07 2017-04-07 Method of encoding video data
US16/242,546 US10873757B2 (en) 2011-11-07 2019-01-08 Method of encoding video data

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
KR1020110115348A KR20130050149A (en) 2011-11-07 2011-11-07 Method for generating prediction block in inter prediction mode
KR10-2011-0115348 2011-11-07
PCT/CN2012/084018 WO2013067903A1 (en) 2011-11-07 2012-11-02 Method of decoding video data
US201414349979A 2014-04-04 2014-04-04
US14/618,833 US9351012B2 (en) 2011-11-07 2015-02-10 Method of decoding video data

Related Parent Applications (2)

Application Number Title Priority Date Filing Date
US14/349,979 Continuation US8982957B2 (en) 2011-11-07 2012-11-02 Method of decoding video data
PCT/CN2012/084018 Continuation WO2013067903A1 (en) 2011-11-07 2012-11-02 Method of decoding video data

Related Child Applications (4)

Application Number Title Priority Date Filing Date
US14/692,679 Continuation US9615106B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,691 Continuation US9635384B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,680 Continuation US9648343B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,690 Continuation US9641860B2 (en) 2011-11-07 2015-04-21 Method of decoding video data

Publications (2)

Publication Number Publication Date
US20150156510A1 US20150156510A1 (en) 2015-06-04
US9351012B2 true US9351012B2 (en) 2016-05-24

Family

ID=48288520

Family Applications (8)

Application Number Title Priority Date Filing Date
US14/349,979 Active US8982957B2 (en) 2011-11-07 2012-11-02 Method of decoding video data
US14/618,833 Active US9351012B2 (en) 2011-11-07 2015-02-10 Method of decoding video data
US14/692,691 Active US9635384B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,690 Active US9641860B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,680 Expired - Fee Related US9648343B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,679 Active US9615106B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US15/481,954 Active US10212449B2 (en) 2011-11-07 2017-04-07 Method of encoding video data
US16/242,546 Active US10873757B2 (en) 2011-11-07 2019-01-08 Method of encoding video data

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US14/349,979 Active US8982957B2 (en) 2011-11-07 2012-11-02 Method of decoding video data

Family Applications After (6)

Application Number Title Priority Date Filing Date
US14/692,691 Active US9635384B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,690 Active US9641860B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,680 Expired - Fee Related US9648343B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US14/692,679 Active US9615106B2 (en) 2011-11-07 2015-04-21 Method of decoding video data
US15/481,954 Active US10212449B2 (en) 2011-11-07 2017-04-07 Method of encoding video data
US16/242,546 Active US10873757B2 (en) 2011-11-07 2019-01-08 Method of encoding video data

Country Status (15)

Country Link
US (8) US8982957B2 (en)
EP (5) EP3934248A1 (en)
JP (6) JP5827412B2 (en)
KR (4) KR20130050149A (en)
CN (7) CN104869402B (en)
AU (5) AU2012334553B2 (en)
BR (5) BR122015027425B1 (en)
CA (5) CA2849029C (en)
HK (6) HK1199588A1 (en)
IL (5) IL231707A (en)
MX (5) MX347162B (en)
PH (6) PH12015500844B1 (en)
RU (5) RU2621972C2 (en)
SG (5) SG10201503443YA (en)
WO (1) WO2013067903A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10819978B2 (en) * 2016-01-11 2020-10-27 Samsung Electronics Co., Ltd. Image encoding method and apparatus, and image decoding method and apparatus

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10397599B2 (en) * 2010-12-17 2019-08-27 Electronics And Telecommunications Research Institute Method and apparatus for inter prediction using motion vector candidate based on temporal motion prediction
RS58193B1 (en) * 2011-06-28 2019-03-29 Samsung Electronics Co Ltd Method for decoding using an interpolation filter
KR20130050149A (en) 2011-11-07 2013-05-15 오수미 Method for generating prediction block in inter prediction mode
JP5900308B2 (en) * 2011-12-16 2016-04-06 株式会社Jvcケンウッド Moving picture coding apparatus, moving picture coding method, and moving picture coding program
FR3032583B1 (en) * 2015-02-06 2018-03-02 Orange METHOD OF ENCODING DIGITAL IMAGE, DECODING METHOD, DEVICES, AND COMPUTER PROGRAMS
RU2684193C1 (en) * 2015-05-21 2019-04-04 Хуавэй Текнолоджиз Ко., Лтд. Device and method for motion compensation in video content
JP6535744B2 (en) * 2015-08-20 2019-06-26 日本放送協会 Image coding apparatus, image decoding apparatus, and programs therefor
WO2017176092A1 (en) * 2016-04-08 2017-10-12 한국전자통신연구원 Method and device for inducing motion prediction information
US10602176B2 (en) 2016-04-15 2020-03-24 Google Llc Coding interpolation filter type
WO2018008906A1 (en) 2016-07-05 2018-01-11 주식회사 케이티 Method and apparatus for processing video signal
US10721489B2 (en) * 2016-09-06 2020-07-21 Qualcomm Incorporated Geometry-based priority for the construction of candidate lists
US10341659B2 (en) * 2016-10-05 2019-07-02 Qualcomm Incorporated Systems and methods of switching interpolation filters
CN110024384A (en) 2016-10-06 2019-07-16 Lg电子株式会社 Method and apparatus for the method based on inter-frame forecast mode processing video
US10623746B2 (en) * 2017-12-07 2020-04-14 Tencent America LLC Method and apparatus for video coding
TW202015409A (en) * 2018-06-29 2020-04-16 財團法人工業技術研究院 Video data decoding method, video data decoder, video data encoding method and video data encoder
RU2768375C1 (en) * 2018-12-28 2022-03-24 ДжейВиСиКЕНВУД Корпорейшн Dynamic image decoding device, a dynamic image decoding method, a dynamic image decoding program, a dynamic image encoding device, a dynamic image encoding method and a dynamic image encoding program
CN112584176B (en) * 2018-12-28 2022-05-31 杭州海康威视数字技术股份有限公司 Coding and decoding method and equipment thereof
KR20230157529A (en) * 2019-04-01 2023-11-16 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 Using interpolation filters for history based motion vector prediction
KR102635319B1 (en) 2019-08-20 2024-02-07 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 Selective use of alternative interpolation filters in video processing
WO2023028965A1 (en) * 2021-09-02 2023-03-09 Nvidia Corporation Hardware codec accelerators for high-performance video encoding
WO2023028964A1 (en) 2021-09-02 2023-03-09 Nvidia Corporation Parallel processing of video frames during video encoding
CN117255205A (en) * 2022-06-16 2023-12-19 北京三星通信技术研究有限公司 Video encoding and decoding method and corresponding equipment

Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4901145A (en) * 1987-06-09 1990-02-13 Sony Corporation Motion vector estimation in television images
US20040008784A1 (en) 2002-06-17 2004-01-15 Yoshihiro Kikuchi Video encoding/decoding method and apparatus
US20050207495A1 (en) * 2004-03-10 2005-09-22 Jayaram Ramasastry Methods and apparatuses for compressing digital image data with motion prediction
US20060294171A1 (en) 2005-06-24 2006-12-28 Frank Bossen Method and apparatus for video encoding and decoding using adaptive interpolation
US20070081587A1 (en) 2005-09-27 2007-04-12 Raveendran Vijayalakshmi R Content driven transcoder that orchestrates multimedia transcoding using content information
US20070217507A1 (en) 2006-03-15 2007-09-20 Fujitsu Limited Video coding apparatus
US20070274385A1 (en) 2006-05-26 2007-11-29 Zhongli He Method of increasing coding efficiency and reducing power consumption by on-line scene change detection while encoding inter-frame
US7352905B2 (en) * 2003-09-07 2008-04-01 Microsoft Corporation Chroma motion vector derivation
US20080137732A1 (en) * 2005-09-20 2008-06-12 Mitsubishi Electric Corporation Image encoding method and image decoding method, image encoder and image decoder, and image encoded bit stream and recording medium
US20080240247A1 (en) * 2007-03-29 2008-10-02 Samsung Electronics Co., Ltd. Method of encoding and decoding motion model parameters and video encoding and decoding method and apparatus using motion model parameters
US20090067503A1 (en) * 2006-01-07 2009-03-12 Electronics And Telecommunications Research Institute Method and apparatus for video data encoding and decoding
US20090080804A1 (en) * 2007-09-21 2009-03-26 Hitachi, Ltd. Method for transmitting and receiving image, receiving device, and image storage device
US20090220005A1 (en) 2008-03-03 2009-09-03 Samsung Electronics Co., Ltd. Method and apparatus for encoding and decoding image by using multiple reference-based motion prediction
US20100086049A1 (en) * 2008-10-03 2010-04-08 Qualcomm Incorporated Video coding using transforms bigger than 4x4 and 8x8
US20100135389A1 (en) 2007-06-26 2010-06-03 Akiyuki Tanizawa Method and apparatus for image encoding and image decoding
US20110206125A1 (en) * 2010-02-19 2011-08-25 Quallcomm Incorporated Adaptive motion resolution for video coding
US20120082215A1 (en) * 2010-09-30 2012-04-05 Vivienne Sze Simplified Binary Arithmetic Coding Engine
US20120163448A1 (en) * 2010-12-22 2012-06-28 Qualcomm Incorporated Coding the position of a last significant coefficient of a video block in video coding
US20120195379A1 (en) * 2009-08-06 2012-08-02 Samsung Electronics Co., Ltd. Method and apparatus for encoding images, and method and apparatus for decoding encoded images
US8254455B2 (en) * 2007-06-30 2012-08-28 Microsoft Corporation Computing collocated macroblock information for direct mode macroblocks
US8265144B2 (en) * 2007-06-30 2012-09-11 Microsoft Corporation Innovations in video decoder implementations
US20130033612A1 (en) * 2011-08-01 2013-02-07 Microsoft Corporation Reduced latency video stabilization
US20140105299A1 (en) * 2012-09-30 2014-04-17 Qualcomm Incorporated Performing residual prediction in video coding

Family Cites Families (86)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5339108A (en) * 1992-04-09 1994-08-16 Ampex Corporation Ordering and formatting coded image data and reconstructing partial images from the data
US5867602A (en) * 1994-09-21 1999-02-02 Ricoh Corporation Reversible wavelet transform and embedded codestream manipulation
US5881176A (en) * 1994-09-21 1999-03-09 Ricoh Corporation Compression and decompression with wavelet style and binary style including quantization by device-dependent parser
US6009236A (en) * 1994-09-26 1999-12-28 Mitsubishi Denki Kabushiki Kaisha Digital video signal record and playback device and method for giving priority to a center of an I frame
US5982935A (en) * 1997-04-11 1999-11-09 National Semiconductor Corporation Method and apparatus for computing MPEG video reconstructed DCT coefficients
US6208692B1 (en) * 1997-12-31 2001-03-27 Sarnoff Corporation Apparatus and method for performing scalable hierarchical motion estimation
US6639942B1 (en) * 1999-10-21 2003-10-28 Toshiba America Electronic Components, Inc. Method and apparatus for estimating and controlling the number of bits
US7663695B2 (en) * 2000-05-05 2010-02-16 Stmicroelectronics S.R.L. Method and system for de-interlacing digital images, and computer program product therefor
US6696993B2 (en) * 2001-03-23 2004-02-24 Nokia Corporation Variable length coding
US6735254B2 (en) * 2001-06-29 2004-05-11 Qualcomm, Inc. DCT compression using Golomb-Rice coding
US8243803B2 (en) * 2001-11-30 2012-08-14 Ntt Docomo, Inc. Moving picture coding apparatus, moving picture decoding apparatus, moving picture coding method, moving picture decoding method, program, and computer-readable recording medium containing the program
CN101448162B (en) * 2001-12-17 2013-01-02 微软公司 Method for processing video image
US7620109B2 (en) * 2002-04-10 2009-11-17 Microsoft Corporation Sub-pixel interpolation in motion estimation and compensation
US7305034B2 (en) * 2002-04-10 2007-12-04 Microsoft Corporation Rounding control for multi-stage interpolation
KR100973216B1 (en) * 2002-04-23 2010-07-30 노키아 코포레이션 Method and device for indicating quantizer parameters in a video coding system
JP4724351B2 (en) * 2002-07-15 2011-07-13 三菱電機株式会社 Image encoding apparatus, image encoding method, image decoding apparatus, image decoding method, and communication apparatus
US7227901B2 (en) * 2002-11-21 2007-06-05 Ub Video Inc. Low-complexity deblocking filter
US7609763B2 (en) * 2003-07-18 2009-10-27 Microsoft Corporation Advanced bi-directional predictive coding of video frames
NO319629B1 (en) * 2003-11-28 2005-09-05 Tandberg Telecom As Procedure for correcting interpolated pixel values
US7599435B2 (en) * 2004-01-30 2009-10-06 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Video frame encoding and decoding
US7894530B2 (en) * 2004-05-07 2011-02-22 Broadcom Corporation Method and system for dynamic selection of transform size in a video decoder based on signal content
US8823821B2 (en) * 2004-12-17 2014-09-02 Mitsubishi Electric Research Laboratories, Inc. Method and system for processing multiview videos for view synthesis using motion vector predictor list
JP4074868B2 (en) * 2004-12-22 2008-04-16 株式会社東芝 Image coding control method and apparatus
US7583844B2 (en) * 2005-03-11 2009-09-01 Nokia Corporation Method, device, and system for processing of still images in the compressed domain
KR20080044874A (en) * 2005-08-15 2008-05-21 노키아 코포레이션 Method and apparatus for sub-pixel interpolation for updating operation in video coding
KR100977101B1 (en) * 2005-11-30 2010-08-23 가부시끼가이샤 도시바 Image encoding/image decoding method and image encoding/image decoding apparatus
US8265151B1 (en) * 2005-12-14 2012-09-11 Ambarella Taiwan Ltd. Mode decision using approximate 1/2 pel interpolation
BRPI0621340A2 (en) * 2006-02-13 2011-12-06 Toshiba Kk Toshiba Corp video encoding / decoding method and apparatus and program
CN101411200B (en) * 2006-04-03 2011-08-10 英国电讯有限公司 Method of video signal coding
US20070274396A1 (en) * 2006-05-26 2007-11-29 Ximin Zhang Complexity adaptive skip mode estimation for video encoding
WO2007139266A1 (en) * 2006-06-01 2007-12-06 Electronics And Telecommunications Research Institute Method and apparatus for video coding on pixel-wise prediction
US8422555B2 (en) * 2006-07-11 2013-04-16 Nokia Corporation Scalable video coding
KR101526914B1 (en) * 2006-08-02 2015-06-08 톰슨 라이센싱 Methods and apparatus for adaptive geometric partitioning for video decoding
US20080170611A1 (en) * 2007-01-17 2008-07-17 Srikrishna Ramaswamy Configurable functional multi-processing architecture for video processing
US8238432B2 (en) * 2007-03-05 2012-08-07 Nec Corportion Weighted prediction information calculation method, apparatus, and program, and video coding method, apparatus, and program
US8107571B2 (en) * 2007-03-20 2012-01-31 Microsoft Corporation Parameterized filters and signaling techniques
KR20090115176A (en) * 2007-04-16 2009-11-04 가부시끼가이샤 도시바 Image encoding and image decoding method and device
US8934542B2 (en) * 2007-06-29 2015-01-13 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Scalable video coding supporting pixel value refinement scalability
US8938005B2 (en) * 2007-11-05 2015-01-20 Canon Kabushiki Kaisha Image encoding apparatus, method of controlling the same, and computer program
US8885726B2 (en) * 2007-12-04 2014-11-11 Vixs Systems, Inc. Neighbor management for use in entropy encoding and methods for use therewith
US8542730B2 (en) * 2008-02-22 2013-09-24 Qualcomm, Incorporated Fast macroblock delta QP decision
US9077971B2 (en) * 2008-04-10 2015-07-07 Qualcomm Incorporated Interpolation-like filtering of integer-pixel positions in video coding
KR101549823B1 (en) * 2008-09-02 2015-09-04 삼성전자주식회사 Method and apparatus for encoding/decoding image using adaptive binarization
EP2161936A1 (en) * 2008-09-04 2010-03-10 Panasonic Corporation Locally adaptive filters for video coding controlled by local correlation data
US8724697B2 (en) * 2008-09-26 2014-05-13 Qualcomm Incorporated Locating motion vectors for video data units
US20100166073A1 (en) * 2008-12-31 2010-07-01 Advanced Micro Devices, Inc. Multiple-Candidate Motion Estimation With Advanced Spatial Filtering of Differential Motion Vectors
TWI387314B (en) * 2009-03-10 2013-02-21 Univ Nat Central Image processing apparatus and method thereof
EP2237557A1 (en) * 2009-04-03 2010-10-06 Panasonic Corporation Coding for filter coefficients
KR101557504B1 (en) * 2009-04-13 2015-10-07 삼성전자주식회사 Method for transmitting adapted channel condition apparatus using the method and providing system
US20110002391A1 (en) * 2009-06-11 2011-01-06 Motorola, Inc. Digital image compression by resolution-adaptive macroblock coding
KR101452859B1 (en) * 2009-08-13 2014-10-23 삼성전자주식회사 Method and apparatus for encoding and decoding motion vector
JPWO2011046008A1 (en) * 2009-10-16 2013-03-04 シャープ株式会社 Moving picture coding apparatus and moving picture decoding apparatus
MY162149A (en) * 2010-04-23 2017-05-24 M&K Holdings Inc Apparatus for encoding an image
US20120075436A1 (en) * 2010-09-24 2012-03-29 Qualcomm Incorporated Coding stereo video data
US8787443B2 (en) * 2010-10-05 2014-07-22 Microsoft Corporation Content adaptive deblocking during video encoding and decoding
US10327008B2 (en) * 2010-10-13 2019-06-18 Qualcomm Incorporated Adaptive motion vector resolution signaling for video coding
US8755438B2 (en) * 2010-11-29 2014-06-17 Ecole De Technologie Superieure Method and system for selectively performing multiple video transcoding operations
US9288496B2 (en) * 2010-12-03 2016-03-15 Qualcomm Incorporated Video coding using function-based scan order for transform coefficients
US9172972B2 (en) * 2011-01-05 2015-10-27 Qualcomm Incorporated Low complexity interpolation filtering with adaptive tap size
US9008176B2 (en) * 2011-01-22 2015-04-14 Qualcomm Incorporated Combined reference picture list construction for video coding
US9008181B2 (en) * 2011-01-24 2015-04-14 Qualcomm Incorporated Single reference picture list utilization for interprediction video coding
US9930366B2 (en) * 2011-01-28 2018-03-27 Qualcomm Incorporated Pixel level adaptive intra-smoothing
US10171813B2 (en) * 2011-02-24 2019-01-01 Qualcomm Incorporated Hierarchy of motion prediction video blocks
JP5982734B2 (en) * 2011-03-11 2016-08-31 ソニー株式会社 Image processing apparatus and method
US9143795B2 (en) * 2011-04-11 2015-09-22 Texas Instruments Incorporated Parallel motion estimation in video coding
US9143799B2 (en) * 2011-05-27 2015-09-22 Cisco Technology, Inc. Method, apparatus and computer program product for image motion prediction
US9313494B2 (en) * 2011-06-20 2016-04-12 Qualcomm Incorporated Parallelization friendly merge candidates for video coding
US9942573B2 (en) * 2011-06-22 2018-04-10 Texas Instruments Incorporated Systems and methods for reducing blocking artifacts
US10536701B2 (en) * 2011-07-01 2020-01-14 Qualcomm Incorporated Video coding using adaptive motion vector resolution
US9756360B2 (en) * 2011-07-19 2017-09-05 Qualcomm Incorporated Coefficient scanning in video coding
US9699456B2 (en) * 2011-07-20 2017-07-04 Qualcomm Incorporated Buffering prediction data in video coding
US10070152B2 (en) * 2011-08-24 2018-09-04 Texas Instruments Incorporated Sample adaptive offset (SAO) parameter signaling
US9344743B2 (en) * 2011-08-24 2016-05-17 Texas Instruments Incorporated Flexible region based sample adaptive offset (SAO) and adaptive loop filter (ALF)
US20130083844A1 (en) * 2011-09-30 2013-04-04 In Suk Chong Coefficient coding for sample adaptive offset and adaptive loop filter
US9083983B2 (en) * 2011-10-04 2015-07-14 Qualcomm Incorporated Motion vector predictor candidate clipping removal for video coding
US9762899B2 (en) * 2011-10-04 2017-09-12 Texas Instruments Incorporated Virtual memory access bandwidth verification (VMBV) in video coding
US9699457B2 (en) * 2011-10-11 2017-07-04 Qualcomm Incorporated Most probable transform for intra prediction coding
US9357235B2 (en) * 2011-10-13 2016-05-31 Qualcomm Incorporated Sample adaptive offset merged with adaptive loop filter in video coding
US20130101033A1 (en) * 2011-10-14 2013-04-25 Qualcomm Incorporated Coding non-symmetric distributions of data
US8915706B2 (en) 2011-10-18 2014-12-23 General Electric Company Transition nozzle
ES2927471T3 (en) * 2011-10-24 2022-11-07 Gensquare Llc Image decoding apparatus
KR20130050149A (en) 2011-11-07 2013-05-15 오수미 Method for generating prediction block in inter prediction mode
US10129540B2 (en) * 2012-04-10 2018-11-13 Texas Instruments Incorporated Reduced complexity coefficient transmission for adaptive loop filtering (ALF) in video coding
US9420280B2 (en) * 2012-06-08 2016-08-16 Qualcomm Incorporated Adaptive upsampling filters
US10136143B2 (en) * 2012-12-07 2018-11-20 Qualcomm Incorporated Advanced residual prediction in scalable and multi-view video coding
US10462480B2 (en) * 2014-12-31 2019-10-29 Microsoft Technology Licensing, Llc Computationally efficient motion estimation

Patent Citations (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4901145A (en) * 1987-06-09 1990-02-13 Sony Corporation Motion vector estimation in television images
US20040008784A1 (en) 2002-06-17 2004-01-15 Yoshihiro Kikuchi Video encoding/decoding method and apparatus
US7352905B2 (en) * 2003-09-07 2008-04-01 Microsoft Corporation Chroma motion vector derivation
US7606311B2 (en) * 2003-09-07 2009-10-20 Microsoft Corporation Macroblock information signaling for interlaced frames
US20050207495A1 (en) * 2004-03-10 2005-09-22 Jayaram Ramasastry Methods and apparatuses for compressing digital image data with motion prediction
US20060294171A1 (en) 2005-06-24 2006-12-28 Frank Bossen Method and apparatus for video encoding and decoding using adaptive interpolation
US20080137732A1 (en) * 2005-09-20 2008-06-12 Mitsubishi Electric Corporation Image encoding method and image decoding method, image encoder and image decoder, and image encoded bit stream and recording medium
US20070081587A1 (en) 2005-09-27 2007-04-12 Raveendran Vijayalakshmi R Content driven transcoder that orchestrates multimedia transcoding using content information
US20090067503A1 (en) * 2006-01-07 2009-03-12 Electronics And Telecommunications Research Institute Method and apparatus for video data encoding and decoding
US20070217507A1 (en) 2006-03-15 2007-09-20 Fujitsu Limited Video coding apparatus
US20070274385A1 (en) 2006-05-26 2007-11-29 Zhongli He Method of increasing coding efficiency and reducing power consumption by on-line scene change detection while encoding inter-frame
US20080240247A1 (en) * 2007-03-29 2008-10-02 Samsung Electronics Co., Ltd. Method of encoding and decoding motion model parameters and video encoding and decoding method and apparatus using motion model parameters
US20100135389A1 (en) 2007-06-26 2010-06-03 Akiyuki Tanizawa Method and apparatus for image encoding and image decoding
US8254455B2 (en) * 2007-06-30 2012-08-28 Microsoft Corporation Computing collocated macroblock information for direct mode macroblocks
US8265144B2 (en) * 2007-06-30 2012-09-11 Microsoft Corporation Innovations in video decoder implementations
US20090080804A1 (en) * 2007-09-21 2009-03-26 Hitachi, Ltd. Method for transmitting and receiving image, receiving device, and image storage device
US20090220005A1 (en) 2008-03-03 2009-09-03 Samsung Electronics Co., Ltd. Method and apparatus for encoding and decoding image by using multiple reference-based motion prediction
US20100086049A1 (en) * 2008-10-03 2010-04-08 Qualcomm Incorporated Video coding using transforms bigger than 4x4 and 8x8
US20120195379A1 (en) * 2009-08-06 2012-08-02 Samsung Electronics Co., Ltd. Method and apparatus for encoding images, and method and apparatus for decoding encoded images
US20110206125A1 (en) * 2010-02-19 2011-08-25 Quallcomm Incorporated Adaptive motion resolution for video coding
US20120082215A1 (en) * 2010-09-30 2012-04-05 Vivienne Sze Simplified Binary Arithmetic Coding Engine
US20120163448A1 (en) * 2010-12-22 2012-06-28 Qualcomm Incorporated Coding the position of a last significant coefficient of a video block in video coding
US20130033612A1 (en) * 2011-08-01 2013-02-07 Microsoft Corporation Reduced latency video stabilization
US20140105299A1 (en) * 2012-09-30 2014-04-17 Qualcomm Incorporated Performing residual prediction in video coding

Non-Patent Citations (9)

* Cited by examiner, † Cited by third party
Title
Alexander Alshin et al., "CE3: DCT derived interpolation falter test by Samsung", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting, Jul. 14-22, 2011, pp. 2-11, JCTVC-F247.
Bin Li et al., "Redundancy reduction in CBF and Merging coding", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 3rd Meeting, Oct. 7-15, 2010, pp. 1-8, JCTVC-C277.
Bross et al., "High Efficiency Video Coding (HEVC) Text Specification Draft 6", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, JCTVC-H1003, 7th Meeting, Geneva, CH, Nov. 21-30, 2011, 275 pages.
Hirofumi Aoki et al., "CE4 Subtest 2: QP prediction based on intra/inter prediction (test 2.4.b)", JCTVC-F103, Jul. 14-22, 2011, pp. 1-19.
Hirofumi Aoki et al., "CE4 Subtest 2: Spatial QP prediction: combination of test 2.3.g. 2.3.f and 2.3.e", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting, Jul. 14-22, 2011, pp. 2-11, JCTVC-F661.
International Search Report for PCT/CN2012/084018, filed Nov. 2, 2012.
Kenji Kondo et al., "Improvement of delta-QP Coding", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting, Jul. 1422, 2011, pp. 2-9, JCTVC-F422r1.
Masaaki Kobayashi et al., "CE4 Subtest 2: Delta QP prediction results of test 2.2.b and 2.3.f", JCTVC-F300, Jul. 14-22, 2011, pp. 1-8.
McCann et al., "HM3: High Efficiency Video Coding (HEVC) Test Model 3 Encoder Description", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, JCTVC-E602, 5th Meeting: Geneva, CH, Mar. 6-23, 2011, 34 pages.

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10819978B2 (en) * 2016-01-11 2020-10-27 Samsung Electronics Co., Ltd. Image encoding method and apparatus, and image decoding method and apparatus

Also Published As

Publication number Publication date
EP3930325A3 (en) 2022-03-09
IL239728B (en) 2019-07-31
CA2931745C (en) 2019-05-21
JP2014534753A (en) 2014-12-18
CN107517382B (en) 2020-07-10
AU2015249104B2 (en) 2017-08-03
US8982957B2 (en) 2015-03-17
JP6345815B2 (en) 2018-06-20
CA2931709C (en) 2019-05-21
CA2849029A1 (en) 2013-05-16
SG11201400667QA (en) 2014-04-28
AU2015249103A1 (en) 2015-11-12
RU2621972C2 (en) 2017-06-08
CA2931709A1 (en) 2013-05-16
BR122015027404B1 (en) 2022-06-28
CA2931745A1 (en) 2013-05-16
AU2012334553A1 (en) 2014-04-17
JP6074475B2 (en) 2017-02-01
EP3926951A1 (en) 2021-12-22
BR122015027404A2 (en) 2019-08-27
IL239726A0 (en) 2015-08-31
CN104869400A (en) 2015-08-26
RU2621966C1 (en) 2017-06-08
HK1199588A1 (en) 2015-07-03
AU2015249102A1 (en) 2015-11-12
JP6076438B2 (en) 2017-02-08
AU2015249105B2 (en) 2017-08-03
US20150156510A1 (en) 2015-06-04
CN104883568A (en) 2015-09-02
IL231707A (en) 2016-10-31
HK1214444A1 (en) 2016-07-22
AU2015249103B2 (en) 2017-08-03
SG10201503443YA (en) 2015-06-29
AU2015249102B2 (en) 2017-08-03
US20140269926A1 (en) 2014-09-18
KR20140074949A (en) 2014-06-18
EP2752007A1 (en) 2014-07-09
US20150229950A1 (en) 2015-08-13
CN104012094A (en) 2014-08-27
IL239725A0 (en) 2015-08-31
US20190141349A1 (en) 2019-05-09
PH12015500839A1 (en) 2016-08-15
PH12015500841A1 (en) 2016-08-15
JP6074477B2 (en) 2017-02-01
RU2015131333A (en) 2015-11-27
HK1214442A1 (en) 2016-07-22
US20150229951A1 (en) 2015-08-13
EP3934248A1 (en) 2022-01-05
CA2849029C (en) 2016-08-09
EP3930326A1 (en) 2021-12-29
CN104012094B (en) 2017-11-10
US9635384B2 (en) 2017-04-25
HK1214701A1 (en) 2016-07-29
AU2015249104A1 (en) 2015-11-12
BR112014007593B1 (en) 2022-06-21
CN104869402A (en) 2015-08-26
CA3092392C (en) 2022-04-12
CA3092392A1 (en) 2013-05-16
US20150229952A1 (en) 2015-08-13
IL239727B (en) 2019-02-28
BR122015027425A2 (en) 2019-08-27
EP3930325A1 (en) 2021-12-29
RU2589866C2 (en) 2016-07-10
US10873757B2 (en) 2020-12-22
CA3039421A1 (en) 2013-05-16
PH12015500843B1 (en) 2016-08-15
CN104967847B (en) 2018-04-13
CA3039421C (en) 2020-10-27
US9648343B2 (en) 2017-05-09
JP5827412B2 (en) 2015-12-02
IL239727A0 (en) 2015-08-31
JP2017085646A (en) 2017-05-18
SG10201503439UA (en) 2015-06-29
AU2012334553B2 (en) 2015-07-30
US20170214934A1 (en) 2017-07-27
CN107517382A (en) 2017-12-26
PH12015500843A1 (en) 2016-08-15
EP2752007A4 (en) 2015-06-17
MX339984B (en) 2016-06-20
CN104869401A (en) 2015-08-26
KR20140077919A (en) 2014-06-24
PH12015500844A1 (en) 2016-08-15
RU2014113082A (en) 2015-12-20
BR122015027402B8 (en) 2022-10-04
WO2013067903A1 (en) 2013-05-16
IL231707A0 (en) 2014-05-28
SG10201503444WA (en) 2015-06-29
CN104883568B (en) 2018-04-17
PH12015500844B1 (en) 2016-08-15
CN104869402B (en) 2017-10-24
PH12017502131A1 (en) 2018-07-02
KR20140082702A (en) 2014-07-02
JP6074476B2 (en) 2017-02-01
MX347162B (en) 2017-04-17
PH12017502132B1 (en) 2018-07-02
RU2621967C1 (en) 2017-06-08
RU2621970C1 (en) 2017-06-08
CN104869401B (en) 2018-03-23
HK1214703A1 (en) 2016-07-29
US10212449B2 (en) 2019-02-19
US9615106B2 (en) 2017-04-04
CN104869400B (en) 2018-03-27
BR122015027425B1 (en) 2023-01-10
BR122015027402B1 (en) 2022-06-28
KR20130050149A (en) 2013-05-15
CN104967847A (en) 2015-10-07
BR122015027404B8 (en) 2022-10-04
MX347163B (en) 2017-04-17
BR122015027402A2 (en) 2019-08-27
IL239728A0 (en) 2015-08-31
BR122015027425A8 (en) 2022-10-04
MX2014003962A (en) 2014-08-01
US9641860B2 (en) 2017-05-02
HK1214443A1 (en) 2016-07-22
BR112014007593A2 (en) 2017-04-11
AU2015249105A1 (en) 2015-11-12
MX356738B (en) 2018-06-12
JP2016028518A (en) 2016-02-25
JP2016028516A (en) 2016-02-25
PH12017502132A1 (en) 2018-07-02
PH12015500839B1 (en) 2016-08-15
JP2016028517A (en) 2016-02-25
PH12017502131B1 (en) 2018-07-02
PH12015500841B1 (en) 2016-08-15
IL239725A (en) 2017-07-31
BR122015027407B8 (en) 2022-10-04
US20150229953A1 (en) 2015-08-13
JP2016028519A (en) 2016-02-25
BR122015027407A2 (en) 2019-08-27
SG10201503437RA (en) 2015-06-29
BR122015027407B1 (en) 2022-06-28

Similar Documents

Publication Publication Date Title
US10873757B2 (en) Method of encoding video data
US10931949B2 (en) Method of deriving motion information
US11889065B2 (en) Method of decoding motion vector
US10362312B2 (en) Method of constructing merge list

Legal Events

Date Code Title Description
STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

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

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 4

AS Assignment

Owner name: GENSQUARE LLC, KOREA, REPUBLIC OF

Free format text: NUNC PRO TUNC ASSIGNMENT;ASSIGNOR:INFOBRIDGE PTE. LTD.;REEL/FRAME:061299/0844

Effective date: 20220823

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 8