Encoding/decoding method and apparatus using a tree structure

Patent metadata

Field	Value
Publication number	US-9787997-B2
Application number	US-201514609096-A
Country	US
Kind code	B2
Filing date	Jan 29, 2015
Priority date	Dec 10, 2009
Publication date	Oct 10, 2017
Grant date	Oct 10, 2017

Abstract

A method for reconstructing information on transform coefficients of a current block by a tree structure, includes: decoding a bitstream to reconstruct information on a size of the current block and information on a minimum subblock size; determining the size of the current block based on the information on the size of the current block; determining the minimum subblock size based on the information on the minimum subblock size; and reconstructing the information on transform coefficients of each of one or more subblocks by dividing the current block in the determined size into the one or more subblocks by the tree structure, wherein the current block is divided into the subblocks which are not smaller than the minimum subblock size.

First claim

What is claimed is:

1. A method performed by a decoding apparatus for reconstructing information on transform coefficients of a current block by a tree structure, the method comprising:
decoding a bitstream to reconstruct information on a size of the current block, information on a minimum subblock size and information on a difference between the minimum subblock size and a maximum subblock size;
determining the size of the current block based on the information on the size of the current block;
determining the minimum subblock size using the information on the minimum subblock size, and determining the maximum subblock size using the information on the minimum subblock size and the information on the difference; and
reconstructing the information on transform coefficients of each of one or more subblocks by dividing the current block of the determined size into the one or more subblocks by the tree structure, wherein the current block is divided by the tree structure into the subblocks which are not smaller than the minimum subblock size and are not larger than the maximum subblock size.

2. The method of claim 1 , wherein the current block corresponds to an uppermost layer of the tree structure.

3. The method of claim 1 , wherein the information on the minimum subblock size and the information on the difference between the minimum subblock size and the maximum subblock size are values of a log scale.

4. The method of claim 3 , wherein the information on the minimum subblock size is an encoded value of log 2 (A/4) where A denotes the minimum subblock size, and
the information on the difference between the minimum subblock size and the maximum subblock size is an encoded value of log 2 (B/A) where B denotes the maximum subblock size.

5. The method of claim 1 , wherein the reconstructing of the information on transform coefficients of each of one or more subblocks comprises:
determining whether or not each node of the tree structure is divided into nodes of a lower layer, based on a partition flag included in the bitstream; and
reconstructing the information on transform coefficients of a subblock corresponding to a node which is not further divided.

6. The method of claim 5 , wherein, when a node is divided into nodes of a lower layer, a block corresponding to the node is divided into four equal-sized blocks corresponding to the nodes of the lower layer.

7. The method of claim 5 , wherein the reconstructiing of the information on transform coefficients of the subblock comprises:
reconstructing coded block information indicating whether or not at least one non-zero transform coefficient exists within the subblock; and
reconstructing transform coefficients of the subblock when the coded block information indicates that the at least one non-zero transform coefficient exists within the subblock.

8. The method of claim 5 , wherein, when a block corresponding to a node has the minimum subblock size, the partition flag indicating whether the node is divided is not included in the bitstream.

9. The method of claim 1 , wherein the information on the minimum subblock size and the information on the difference between the minimum subblock size and the maximum subblock size are included in sequence information of the bitstream.

Assignees

• Sk Telecom Co Ltd

Inventors

• Kim Sunyeon
• Lim Jeongyeon
• Choi Jaehoon
• Lee Gyumin
• Moon Joohee
• Lee Yunglyul
• Kim Haekwang
• Jeon Byeungwoo
• Han Jongki
• Kim Dongwon

Classifications

• H04N19/146

  Data rate or code amount at the encoder output · CPC title

• H04N19/105

  Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction · CPC title

• H04N19/60

  using transform coding · CPC title

• H04N19/00

  Methods or arrangements for coding, decoding, compressing or decompressing digital video signals · CPC title

• H04N19/463

  by compressing encoding parameters before transmission · CPC title