IP Library › Granted Patent US 9,357,220
Granted Patent B2
US 9,357,220 · App. 14/603,892 · Granted May 31, 2016

Encoding / decoding method and apparatus using a tree structure

Inventors: Sunyeon Kim (Seoul, KR); Jeongyeon Lim (Seongnam-si, KR); Jaehoon Choi (Seongnam-si, KR); Gyumin Lee (Seongnam-si, KR); Joohee Moon (Seoul, KR); Yunglyul Lee (Seoul, KR); Haekwang Kim (Seoul, KR); Byeungwoo Jeon (Seongnam-si, KR); Jongki Han (Seoul, KR); Dongwon Kim (Seoul, KR)
Assignee: SK TELECOM CO., LTD.
H04N19/176H04N19/00H04N19/105H04N19/119H04N19/146H04N19/44H04N19/46H04N19/463H04N19/60H04N19/61H04N19/85H04N19/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,357,220
App. No.
14/603,892
Granted
May 31, 2016
Kind
B2
Abstract

The present disclosure provides an encoding/decoding method using a tree structure. The encoding method for encoding image information includes: grouping predetermined areas having the image information into a plurality of groups, and generating a node value of each layer up to an uppermost layer by determining a minimum value or a maximum value of information to be encoded within grouped areas as information on the grouped areas; and encoding a difference value between the node value of each layer and a node value of an upper layer or a difference value between the node value of each layer and a value determined based on a preset criterion. Accordingly, the encoding efficiency and in turn the video compression efficiency are improved by using the tree structure in the encoding of various pieces of image information and the decoding of the resultant encoded data.

Claims (14)

1. A decoding method performed by a video decoding apparatus for reconstructing image information divided by a tree structure from a bitstream, comprising:

decoding the bitstream to reconstruct additional information, including first information on a minimum block size and second information on a difference between the minimum block size and a maximum block size, wherein the maximum block size is identified based on the first information on the minimum block size and the second information on the difference; and

reconstructing a partition flag indicating whether or not each block, starting from a block corresponding to an uppermost layer of the tree structure, is divided into blocks of a lower layer, the block corresponding to the uppermost layer having the maximum block size identified based on the first and second information, and reconstructing image information of a block which is not further divided.

2. The decoding method of claim 1 , wherein, when the partition flag indicates that a block of an upper layer is divided into blocks of a lower layer, the block of the upper layer is divided into four equal-sized blocks.

3. The decoding method of claim 1 , wherein the partition flag indicating whether a block having the minimum block size is divided is not included in the bitstream.

4. The decoding method of claim 1 , wherein the additional information is included as a sequence information.

5. The decoding method of claim 1 , wherein the image information includes prediction information and information on residuals needed for reconstructing pixels of the block which is not further divided.

6. A decoding apparatus for reconstructing image information divided by a tree structure from a bitstream, comprising:

an additional information decoder configured to decode the bitstream to reconstruct additional information, including first information on a minimum block size and second information on a difference between the minimum block size and a maximum block size, wherein the additional information decoder identifies the maximum block size based on the first information on the minimum block size and the second information on the difference; and

a tree decoder configured to reconstruct a partition flag indicating whether or not each block, starting from a block corresponding to an uppermost layer of the tree structure, is divided into blocks of a lower layer, the block corresponding to the uppermost layer having the maximum block size identified based on the first and second information, and reconstruct image information of a block which is not further divided.

7. The decoding apparatus of claim 6 , wherein, when the partition flag indicates that a block of an upper layer is divided into blocks of a lower layer, the block of the upper layer is divided into four equal-sized blocks.

8. The decoding method of claim 6 , wherein the partition flag indicating whether a block having the minimum block size is divided is not included in the bitstream.

9. The decoding apparatus of claim 6 , wherein the additional information is included as a sequence information.

10. The decoding apparatus of claim 6 , wherein the image information includes prediction information and information on residuals needed for reconstructing pixels of the block which is not further divided.

Assignments (2)
CORRECTIVE ASSIGNMENT TO CORRECT THE RECEIVING PARTY DATA PREVIOUSLY RECORDED AT REEL: 034800 FRAME: 0467. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT . Recorded May 9, 2016
From: KIM, SUNYEON; LIM, JEONGYEON; CHOI, JAEHOON; LEE, GYUMIN; MOON, JOOHEE; LEE, YUNGLYUL; KIM, HAEKWANG; JEON, BYEUNGWOO; HAN, JONGKI; KIM, DONGWON
To: SK TELECOM CO., LTD.
Reel/Frame 038644/0309 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 23, 2015
From: KIM, SUNYEON; LIM, JEONGYEON; CHOI, JAEHOON; LEE, GYUMIN; MOON, JOOHEE; LEE, YUNGLYUL; KIM, HAEKWANG; JEON, BYEUNGWOO; HAN, JONGKI; KIM, DONGWON
To: SK TELECOM. CO., LTD.
Reel/Frame 034800/0467 →
Priority Claims (2)
KR 10-2009-0122500 · Dec 10, 2009 · national
KR 10-2010-0126315 · Dec 10, 2010 · national
Continuity (2)
Continuation 13514537
Related Publication 20150201221A1 · Jul 16, 2015