IP Library Granted Patent US 12,574,512
Granted Patent B2
US 12,574,512 · App. 19/292,714 · Granted Mar 10, 2026

Image encoding method/device, image decoding method/device, and recording medium in which bitstream is stored

Inventors: Joo Hee Moon (Seoul, KR); Sung Won Lim (Seoul, KR); Dong Jae Won (Goyang-si, KR)
Assignee: Industry Academy Cooperation Foundation of Sejong University
H04N19/119H04N19/105H04N19/176H04N19/192H04N19/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 12,574,512
App. No.
19/292,714
Granted
Mar 10, 2026
Kind
B2
Abstract

The present invention provides an image encoding method and an image decoding method. The image encoding method of the present invention comprises: a first dividing step of dividing a current image into a plurality of blocks; and a second dividing step of dividing, into a plurality of sub blocks, a block, which is to be divided and includes a boundary of the current image, among the plurality of blocks, wherein the second dividing step is recursively performed by setting a sub block including the boundary of the current images as the block to be divided, until the sub block including the boundary of the current image does not exist among the sub blocks.

Claims (32)

1 . An image decoding method comprising:

performing a first partitioning on a current image into a plurality of blocks; and

performing a second partitioning on a target block into a plurality of sub-blocks,

wherein the second partitioning uses a quad-tree partitioning or binary-tree partitioning, and

wherein the current image includes a padded area,

wherein the padded area is constructed by horizontal copying of adjacent pixels in the padded area,

wherein the second partitioning uses a quad-tree partitioning or binary-tree partitioning based on a predetermined condition,

wherein the predetermined condition is determined by comparing at least one of a size of a block capable of quad-tree partitioning and a size of a block capable of binary-tree partitioning with a size of the target block,

wherein a number of sub-blocks is either 2 or 4,

wherein, when the second partitioning uses the quad-tree partitioning, a number of sub-blocks is 4, and when the second partitioning uses the binary-tree partitioning, the number of sub-blocks is 2.

2 . An image encoding method comprising:

performing a first partitioning on a current image into a plurality of blocks; and

performing a second partitioning on a target block into a plurality of sub-blocks,

wherein the second partitioning uses a quad-tree partitioning or binary-tree partitioning, and

wherein the current image includes a padded area,

wherein the padded area is constructed by horizontal copying of adjacent pixels in the padded area,

wherein the second partitioning uses a quad-tree partitioning or binary-tree partitioning based on a predetermined condition,

wherein the predetermined condition is determined by comparing at least one of a size of a block capable of quad-tree partitioning and a size of a block capable of binary-tree partitioning with a size of the target block,

wherein a number of sub-blocks is either 2 or 4,

wherein, when the second partitioning uses the quad-tree partitioning, a number of sub-blocks is 4, and when the second partitioning uses the binary-tree partitioning, the number of sub-blocks is 2.

3 . A transmitting method, comprising:

transmitting a bitstream generated by an image encoding method,

wherein the image encoding method comprises:

performing a first partitioning on a current image into a plurality of blocks; and

performing a second partitioning on a target block into a plurality of sub-blocks,

wherein the second partitioning uses a quad-tree partitioning or binary-tree partitioning, and

wherein the current image includes a padded area,

wherein the padded area is constructed by horizontal copying of adjacent pixels in the padded area,

wherein the second partitioning uses a quad-tree partitioning or binary-tree partitioning based on a predetermined condition,

wherein the predetermined condition is determined by comparing at least one of a size of a block capable of quad-tree partitioning and a size of a block capable of binary-tree partitioning with a size of the target block,

wherein a number of sub-blocks is either 2 or 4,

wherein, when the second partitioning uses the quad-tree partitioning, a number of sub-blocks is 4, and when the second partitioning uses the binary-tree partitioning, the number of sub-blocks is 2.

Priority Claims (4)
KR 10-2016-0133754 · Oct 14, 2016 · national
KR 10-2016-0133757 · Oct 14, 2016 · national
KR 10-2017-0127939 · Sep 29, 2017 · national
KR 10-2017-0127942 · Sep 29, 2017 · national
Continuity (6)
Continuation 19187903 · Apr 23, 2025
Continuation 18907441 · Oct 4, 2024
Continuation 17818650 · Aug 9, 2022
Continuation 17328273 · May 24, 2021
Continuation 16341792
Related Publication 20250365412A1 · Nov 27, 2025
References Cited (54)
US 8687654B1 · Lundin · 2014 [cited by examiner]
US 20120257677A1 · Bankoski et al. · 2012 [cited by applicant]
US 20130034159A1 · Siekmann · 2013 [cited by examiner]
US 20130114707A1 · Seregin et al. · 2013 [cited by applicant]
US 20130287116A1 · Helle · 2013 [cited by examiner]
US 20150358640A1 · Hendry · 2015 [cited by examiner]
US 20160165241A1 · Park et al. · 2016 [cited by applicant]
US 20170142442A1 · Tsukuba · 2017 [cited by examiner]
CN 1929611A · 2007 [cited by applicant]
CN 102754442A · 2012 [cited by applicant]
CN 102857764A · 2013 [cited by applicant]
CN 103081470A · 2013 [cited by applicant]
CN 103168470A · 2013 [cited by applicant]
CN 103238333A · 2013 [cited by applicant]
CN 103299642A · 2013 [cited by applicant]
CN 103380622A · 2013 [cited by applicant]
CN 103563386A · 2014 [cited by applicant]
CN 103782600A · 2014 [cited by applicant]
CN 103891283A · 2014 [cited by applicant]
CN 103988506A · 2014 [cited by applicant]
CN 104137549A · 2014 [cited by applicant]
CN 104284194A · 2015 [cited by applicant]
CN 104602005A · 2015 [cited by applicant]
CN 104813667A · 2015 [cited by applicant]
CN 105847814A · 2016 [cited by applicant]
EP 2605518A1 · 2013 [cited by applicant]
JP WO2012120661A1 · 2014 [cited by applicant]
JP 2015159531A · 2015 [cited by applicant]
KR 1020110047697A · 2011 [cited by applicant]
KR 1020130002242A · 2013 [cited by applicant]
KR 1020130006690A · 2013 [cited by applicant]
KR 1020130045807A · 2013 [cited by applicant]
KR 1020130067280A · 2013 [cited by applicant]
KR 1020140124434A · 2014 [cited by applicant]
KR 1020140139459A · 2014 [cited by applicant]
KR 1020150024910A · 2015 [cited by applicant]
KR 1020150056811A · 2015 [cited by applicant]
KR 1020150123177A · 2015 [cited by applicant]
KR 1020150141164A · 2015 [cited by applicant]
KR 1020160051343A · 2016 [cited by applicant]
KR 1020160099727A · 2016 [cited by applicant]
WO 2010032941A2 · 2010 [cited by applicant]
WO 2011004986A2 · 2011 [cited by applicant]
WO WO2011013580A1 · 2011 [cited by applicant]
WO WO2011128365A1 · 2011 [cited by applicant]
WO 2012094921A1 · 2012 [cited by applicant]
WO 2013077659A1 · 2013 [cited by applicant]
WO 2013081365A1 · 2013 [cited by applicant]
WO WO2014078068A1 · 2014 [cited by applicant]
WO 2015199040A1 · 2015 [cited by applicant]
WO 2016091161A1 · 2016 [cited by applicant]
WO 2016148438A2 · 2016 [cited by applicant]
International Search Report issued on Jan. 23, 2018 in corresponding International Application No. PCT/KR2017/011213 (9 pages in English, 9 pages in Korean). [cited by applicant]
Huang, Han, et al. “EE2. 1: Quadtree plus binary tree structure integration with JEM tools.” [cited by applicant]