IP Library › Granted Patent US 12,250,405
Granted Patent B2
US 12,250,405 · App. 18/442,089 · Granted Mar 11, 2025

Method and apparatus of encoding/decoding image data based on tree structure-based block division

Inventor: Ki Baek Kim (Seoul, KR)
Assignee: B1 INSTITUTE OF IMAGE TECHNOLOGY, INC.
H04N19/597G06T3/16H04N13/139H04N13/161H04N19/70H04N2013/0085
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 12,250,405
App. No.
18/442,089
Granted
Mar 11, 2025
Kind
B2
Abstract

Disclosed are methods and apparatuses for image data encoding/decoding. A method of decoding an image includes receiving a bitstream in which the image is encoded; obtaining index information for specifying a block division type of a current block in the image; and determining the block division type of the current block from a candidate group pre-defined in the decoding apparatus. The candidate group includes a plurality of candidate division types, including at least one of a non-division, a first quad-division, a second quad-division, a binary-division or a triple-division. The method also includes dividing the current block into a plurality of sub-blocks; and decoding each of the sub-blocks with reference to syntax information obtained from the bitstream.

Claims (41)

1. A method of decoding an image with a decoding apparatus, comprising:

receiving a bitstream in which the image is encoded;

obtaining, from the bitstream, a single index for specifying a block division type of a current block in the image;

determining, based on the single index, the block division type of the current block from a candidate group pre-defined in the decoding apparatus,

wherein the single index is used to select one candidate division types among a plurality of candidate division types included in the candidate group,

wherein the plurality of candidate division types include a non-division, a first quad-division, a second quad-division, a binary-division and a triple-division,

wherein the first quad-division is representative of dividing, based on one horizontal line and one vertical line, one coding block into four coding blocks, the second quad-division is representative of dividing, based on three horizontal lines or three vertical lines, one coding block into four coding blocks, the binary-division is representative of dividing one coding block into two coding blocks, and the triple-division is representative of dividing one coding block into three coding blocks,

wherein the binary-division includes a horizontal binary-division and a vertical binary-division, and

wherein the bitstream includes at least one among a first flag specifying whether to perform the horizontal binary-division and a second flag specifying whether to perform the vertical binary-division, the first flag being different from the second flag;

dividing, based on the determined block division type, the current block into a plurality of sub-blocks; and

decoding each of the sub-blocks with reference to syntax information obtained from the bitstream,

wherein two coding blocks among the three coding blocks obtained by the triple-division have the same size each other and the remaining coding block among the three coding blocks has a size different from the size of the two coding blocks, and

wherein the four coding blocks obtained by the first quad-divisional have the same size each other.

2. The method of claim 1 , wherein the current block is set equal to a largest coding block or is set a block resulting from dividing the largest coding block,

wherein a size of the largest coding block is variably determined based on information on the largest coding block,

wherein the information on the largest coding block is signaled from the bitstream.

3. The method of claim 2 , wherein the size of the largest coding block is set equal to 128×128 or 64×64 according to the information on the largest coding block.

4. The method of claim 1 , wherein a number of the candidate division types available for the current block is different dependent on at least one of a size of the current block or a shape of the current block.

5. A method of encoding an image with an encoding apparatus, comprising:

determining a block division type of a current block in the image from a candidate group pre-defined in the encoding apparatus;

encoding single index for specifying the determined block division type of the current block;

encoding each of sub-blocks resulting from dividing the current block based on the determined block division type,

wherein the single index is used to select one candidate division types among a plurality of candidate division types included in the candidate group,

wherein the plurality of candidate division types include a non-division, a first quad-division, a second quad-division, a binary-division and a triple-division,

wherein the first quad-division is representative of dividing, based on one horizontal line and one vertical line, one coding block into four coding blocks, the second quad-division is representative of dividing, based on three horizontal lines or three vertical lines, one coding block into four coding blocks, the binary-division is representative of dividing one coding block into two coding blocks, and the triple-division is representative of dividing one coding block into three coding blocks,

wherein the binary-division includes a horizontal binary-division and a vertical binary-division,

wherein two coding blocks among the three coding blocks obtained by the triple-division have the same size each other and the remaining coding block among the three coding blocks has a size different from the size of the two coding blocks, and

wherein the four coding blocks obtained by the first quad-divisional have the same size each other; and

encoding at least one among a first flag specifying whether to perform the horizontal binary-division and a second flag specifying whether to perform the vertical binary-division, the first flag being different from the second flag.

6. A method of transmitting a bitstream comprising:

determining a block division type of a current block in the image from a candidate group pre-defined in the encoding apparatus;

encoding single index for specifying the determined block division type of the current block;

encoding each of sub-blocks resulting from dividing the current block based on the determined block division type to generate the bitstream;

transmitting the bitstream,

wherein the single index is used to select one candidate division types among a plurality of candidate division types included in the candidate group,

wherein the plurality of candidate division types include a non-division, a first quad-division, a second quad-division, a binary-division and a triple-division,

wherein the first quad-division is representative of dividing, based on one horizontal line and one vertical line, one coding block into four coding blocks, the second quad-division is representative of dividing, based on three horizontal lines or three vertical lines, one coding block into four coding blocks, the binary-division is representative of dividing one coding block into two coding blocks, and the triple-division is representative of dividing one coding block into three coding blocks,

wherein the binary-division includes a horizontal binary-division and a vertical binary-division,

wherein two coding blocks among the three coding blocks obtained by the triple-division have the same size each other and the remaining coding block among the three coding blocks has a size different from the size of the two coding blocks, and

wherein the four coding blocks obtained by the first quad-divisional have the same size each other; and

encoding at least one among a first flag specifying whether to perform the horizontal binary-division and a second flag specifying whether to perform the vertical binary-division, the first flag being different from the second flag.

Priority Claims (3)
KR 10-20216-0127890 · Oct 4, 2016 · national
KR 10-2016-0129389 · Oct 6, 2016 · national
KR 10-2017-0090619 · Jul 17, 2017 · national
Continuity (7)
Continuation 18356858 · Jul 21, 2023
Continuation 18095665 · Jan 11, 2023
Continuation 17580053 · Jan 20, 2022
Continuation 17027189 · Sep 21, 2020
Continuation 16375748 · Apr 4, 2019
Continuation PCTKR2017011152 · Oct 10, 2017
Related Publication 20240187647A1 · Jun 6, 2024
References Cited (45)
US 7292722B2 · Lelescu et al. · 2007 [cited by applicant]
US 7623682B2 · Park et al. · 2009 [cited by applicant]
US 10148974B2 · Yamamoto · 2018 [cited by examiner]
US 10979727B2 · Hannuksela et al. · 2021 [cited by applicant]
US 11212496B2 · Xiu et al. · 2021 [cited by applicant]
US 20040081238A1 · Parhy · 2004 [cited by applicant]
US 20060034529A1 · Park et al. · 2006 [cited by applicant]
US 20100086051A1 · Park et al. · 2010 [cited by applicant]
US 20100086052A1 · Park et al. · 2010 [cited by applicant]
US 20130128971A1 · Guo · 2013 [cited by examiner]
US 20140126645A1 · Lim · 2014 [cited by examiner]
US 20160328824A1 · Kim et al. · 2016 [cited by applicant]
US 20170084073A1 · Pio et al. · 2017 [cited by applicant]
US 20170208336A1 · Li · 2017 [cited by examiner]
US 20170272782A1 · Li · 2017 [cited by examiner]
US 20170332107A1 · Abbas et al. · 2017 [cited by applicant]
US 20170339391A1 · Zhou et al. · 2017 [cited by applicant]
US 20170345136A1 · Van der Auwera et al. · 2017 [cited by applicant]
US 20170353737A1 · Lin et al. · 2017 [cited by applicant]
US 20180040164A1 · Newman et al. · 2018 [cited by applicant]
US 20180084257A1 · Abbas · 2018 [cited by applicant]
US 20180103242A1 · Budagavi et al. · 2018 [cited by applicant]
US 20180124398A1 · Park et al. · 2018 [cited by applicant]
US 20180130175A1 · Lin et al. · 2018 [cited by applicant]
US 20180164593A1 · Van der Auwera et al. · 2018 [cited by applicant]
US 20180176596A1 · Jeong · 2018 [cited by examiner]
US 20180199072A1 · Li · 2018 [cited by examiner]
US 20180278936A1 · Hendry et al. · 2018 [cited by applicant]
US 20180336705A1 · Lewis et al. · 2018 [cited by applicant]
US 20190012839A1 · Wang · 2019 [cited by applicant]
US 20190215532A1 · He et al. · 2019 [cited by applicant]
US 20190342550A1 · Lim · 2019 [cited by examiner]
KR 1020060050350A · 2006 [cited by applicant]
KR 1020070103347A · 2007 [cited by applicant]
KR 1020090046815A · 2009 [cited by applicant]
KR 1020150068299A · 2015 [cited by applicant]
KR 1020160032909A · 2016 [cited by applicant]
KR 1020160097182A · 2016 [cited by applicant]
WO WO2016175550A1 · 2016 [cited by applicant]
International Search Report for PCT/KR2017/011152, dated Feb. 6, 2018, (9 pages). [cited by applicant]
J. Chen, et al. Algorithm Description of Joint Exploration Test Model 7(JEM 7). JVET of ITU-T and ISO/IEC. Ver.1, Aug. 19, 2017, (pp. 1-44). [cited by applicant]
X. Li, et al. “Multi-Type-Tree. JVET of ITU-T and ISO/IEC. JVET-D0117” Ver. 3, Oct. 20, 2016, (pp. 1-3). [cited by applicant]
Non-Final Office Action, Mailed Mar. 24, 2020 for corresponding U.S. Appl. No. 16/375,748 (8 Pages). [cited by applicant]
Korean office action issued Feb. 11, 2021 for KR application No. 10-2020-7014808 (applicant: B1 Institute of Image Technology, Inc.), (5 pages in Korean). [cited by applicant]
Yuan et al. “CE2: Non-Square Quad tree Transform for symmetric and asymmetric motion partition”, [cited by applicant]