IP Library Granted Patent US 9,503,736
Granted Patent B2
US 9,503,736 · App. 14/299,896 · Granted Nov 22, 2016

Method and apparatus for encoding video by using block merging, and method and apparatus for decoding video by using block merging

Inventors: Tammy Lee (Seoul, KR); Woo-jin Han (Suwon-si, KR); Il-koo Kim (Osan-si, KR); Sun-il Lee (Yongin-si, KR)
Assignee: SAMSUNG ELECTRONICS CO., LTD.
H04N19/137H04N19/103H04N19/105H04N19/139H04N19/14H04N19/159H04N19/174H04N19/176H04N19/196H04N19/30H04N19/33H04N19/463H04N19/52H04N19/56H04N19/70H04N19/96
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,503,736
App. No.
14/299,896
Granted
Nov 22, 2016
Kind
B2
Abstract

Provided are a method and apparatus for encoding a video by using block merging and a method and apparatus for decoding a video by using block merging. The method of encoding includes: determining an encoding mode indicating a current data unit for encoding of a picture and an encoding method including prediction encoding performed for the current data unit; determining an occurrence of merging with at least one neighboring data unit based on at least one of the encoding mode and a prediction mode; and determining prediction mode information, merging related information, and prediction related information, and determining encoding information of the data unit including the prediction mode information, the merging related information, and the prediction related information.

Claims (19)

1. A method of decoding a video, the method comprising:

obtaining, from a bitstream, split information for a coding unit;

when the split information indicates a non-split for the coding unit, obtaining, from the bitstream, a skip flag for the coding unit which indicates whether a prediction mode for the coding unit is a skip mode;

when the skip flag indicates the skip mode, obtaining, from the bitstream, a merge index indicating one block among a candidate block group and determining a motion vector of the coding unit based on a motion vector of the one block indicated by the merge index; and

when the skip flag indicates a non-skip mode, obtaining, from the bitstream, a partition type and merge information of a partition,

wherein:

the candidate block group includes three or more blocks among neighboring blocks of the coding unit,

the neighboring blocks comprising:

a left-lower block located on a left side of a leftmost block among lower blocks directly below a lower border of a prediction unit in the coding unit, the left-lower block being located below a lowermost block among left blocks adjacent to a left border of the prediction unit,

a left-upper block located on a left side of a leftmost block among upper blocks directly above an upper border of the prediction unit, the left-upper block being located above an uppermost block among the left blocks adjacent to the left border of the prediction unit, and

a right-upper block located on a right side of a rightmost block among the upper blocks directly above the upper border of the prediction unit;

when the partition type is obtained from the bitstream, one or more partitions, including the partition, are determined from the coding unit based on the partition type,

the merge information of the partition indicates whether the partition among the one or more partitions is decoded in a merge mode,

when the split information indicates a split for a current depth, the coding unit of the current depth is split into four rectangular coding units of a lower depth, independently from neighboring coding units, and

when the split information indicates a non-split of the current depth,

the one or more partitions are obtained from the coding unit of the current depth while the skip flag indicates a non-skip mode, and

one or more transformation units are obtained from the coding unit of the current depth.

2. The method of claim 1 , wherein the merge candidate group comprises data units that are merging candidates with a current data unit in regions neighboring the current data unit based on merging index information; and

one data unit is determined to be merged with the current data unit from among the data units in the determined merge candidate group.

Priority Claims (1)
KR 10-2011-0006486 · Jan 21, 2011 · national
Continuity (4)
Continuation 13178862 · Jul 8, 2011
Provisional Application 61367952 · Jul 27, 2010
Provisional Application 61362829 · Jul 9, 2010
Related Publication 20140286431A1 · Sep 25, 2014