IP Library › Granted Patent US 12,652,414
Granted Patent B2
US 12,652,414 · App. 18/804,950 · Granted Jun 9, 2026

Method and apparatus for coding video using merging candidate list according to block division

Inventors: Yong Jo Ahn (Seoul, KR); Ho Chan Ryu (Seoul, KR)
Assignee: Koninklijke Philips N.V.
H04N19/577H04N19/593H04N19/124H04N19/619H04N19/82H04N19/91H04N19/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,652,414
App. No.
18/804,950
Granted
Jun 9, 2026
Kind
B2
Abstract

The present invention relates to block merging according to block split among video coding techniques, and a method and an apparatus for coding and decoding a video, in which in generating and modifying a block merging list, spatial merging candidate blocks of the block merging list are changed according to a split type and order of a current coding unit.

Claims (32)

1 . An image decoding method performed by an image decoding apparatus, comprising:

splitting a first coding block into a plurality of second coding blocks based on a tree-based split structure, wherein the tree-based split structure includes a binary split and a triple split;

splitting a second coding block into two sub-regions based on block split type information;

determining motion information of a current sub-region among the two sub-regions from one of a plurality of merging candidates; and

generating a prediction signal of the current sub-region based on the motion information,

wherein the plurality of merge candidates includes a spatial neighboring merging candidate,

wherein the spatial neighboring merging candidate includes at least one of a left merging candidate, a bottom-left merging candidate, a top-left merging candidate, a top neighboring merging candidate, or a top-right merging candidate,

wherein when the plurality of merging candidates includes the left merging candidate, the bottom-left merging candidate, the top merging candidate, and the top-right merging candidate, the top-left merging candidate is not added to the plurality of merging candidates, and

wherein when the second coding block is split into the two sub-regions in horizontal direction based on the block split type information and the current sub-region is one of the two sub-regions, a number of the merging candidates available for motion compensation of the current sub-region among the two sub-regions is less than a number of merging candidates available for motion compensation of the other one of the two sub-regions.

2 . The image decoding method of claim 1 , wherein the binary split is a block split of splitting one coding block into two coding blocks based on one split line.

3 . The method of claim 1 , wherein the triple split is a block split of splitting one coding block into three coding blocks based on two split lines.

4 . The method of claim 3 ,

wherein one of the three coding blocks has a size greater than a size of the other two of the three coding blocks, and

wherein the other two of the three coding blocks have the same size.

5 . An image encoding method performed by an image encoding apparatus, comprising:

splitting a first coding block into a plurality of second coding blocks based on a tree-based split structure, wherein the tree-based split structure includes a binary split and a triple split;

splitting the second coding block into two sub-regions; and

generating a prediction signal of a current sub-region among the two sub-regions based on motion information of the current sub-region,

wherein the motion information of the current sub-region is determined from one of a plurality of merging candidates,

wherein the plurality of merge candidates includes a spatial neighboring merging candidate,

wherein the spatial neighboring merge candidate includes at least one of a left merging candidate, a bottom-left merging candidate, a top-left merging candidate, a top merging candidate, or a top-right merging candidate,

wherein when the plurality of merging candidates includes the left merging candidate, the bottom-left merging candidate, the top merging candidate, and the top-right merging candidate, the top-left merging candidate is not added to the plurality of merging candidates, and

wherein when the second coding block is split into the two sub-regions in horizontal direction and the current sub-region is one of the two sub-regions, a number of the merging candidates available for motion compensation of the current sub-region among the two sub-regions is less than a number of merging candidates available for motion compensation of the other one of the two sub-regions.

6 . A transmitting method of a bitstream generated by an image encoding method, wherein the image encoding method comprises:

splitting a first coding block into a plurality of second coding blocks based on a tree-based split structure, wherein the tree-based split structure includes a binary split and a triple split;

splitting the second coding block into two sub-regions; and

generating a prediction signal of a current sub-region among the two sub-regions based on motion information of the current sub-region,

wherein the motion information of the current sub-region is determined from one of a plurality of merging candidates,

wherein the plurality of merge candidates includes a spatial neighboring merging candidate,

wherein the spatial neighboring merge candidate includes at least one of a left merging candidate, a bottom-left merging candidate, a top-left merging candidate, a top neighboring block, or a top-right merging candidate,

wherein when the plurality of merging candidates includes the left merging candidate, the bottom-left merging candidate, the top merging candidate, and the top-right merging candidate, the top-left merging candidate is not added to the plurality of merging candidates, and

wherein when the second coding block is split into the two sub-regions in horizontal direction and the current sub-region is one of the two sub-regions, a number of the merging candidates available for motion compensation of the current sub-region among the two sub-regions is less than a number of merging candidates available for motion compensation of the other one of the two sub-regions.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 29, 2025
From: INTELLECTUAL DISCOVERY CO., LTD.
To: KONINKLIJKE PHILIPS N.V.
Reel/Frame 070048/0685 →
Priority Claims (2)
KR 10-2017-0119362 · Sep 18, 2017 · national
KR 10-2017-0126753 · Sep 29, 2017 · national
Continuity (4)
Continuation 18304084 · Apr 20, 2023
Continuation 17345118 · Jun 11, 2021
Continuation 16647665
Related Publication 20240414368A1 · Dec 12, 2024
References Cited (33)
US 5274718A · Leonardi · 1993 [cited by examiner]
US 9161036B2 · Sugio et al. · 2015 [cited by applicant]
US 9712840B2 · Sugio et al. · 2017 [cited by applicant]
US 9888253B2 · Sugio et al. · 2018 [cited by applicant]
US 20130003850A1 · Sugio et al. · 2013 [cited by applicant]
US 20130039423A1 · Helle et al. · 2013 [cited by applicant]
US 20130107962A1 · Sim et al. · 2013 [cited by applicant]
US 20130114717A1 · Zheng et al. · 2013 [cited by applicant]
US 20130287116A1 · Helle et al. · 2013 [cited by applicant]
US 20140211857A1 · Sugio et al. · 2014 [cited by applicant]
US 20140241435A1 · Park et al. · 2014 [cited by applicant]
US 20140294087A1 · Oh et al. · 2014 [cited by applicant]
US 20140341284A1 · Kim · 2014 [cited by examiner]
US 20150036748A1 · Sugio et al. · 2015 [cited by applicant]
US 20150222904A1 · Zhou · 2015 [cited by applicant]
US 20150271489A1 · Sugio et al. · 2015 [cited by applicant]
US 20170208336A1 · Li et al. · 2017 [cited by applicant]
US 20170280150A1 · Sugio et al. · 2017 [cited by applicant]
US 20180020241A1 · Li · 2018 [cited by examiner]
US 20180124416A1 · Sugio et al. · 2018 [cited by applicant]
US 20180281726A1 · Murakami et al. · 2018 [cited by applicant]
US 20180316934A1 · Nam et al. · 2018 [cited by applicant]
US 20190200010A1 · Kim · 2019 [cited by examiner]
US 20200322602A1 · Huang et al. · 2020 [cited by applicant]
US 20210006805A1 · Urban et al. · 2021 [cited by applicant]
KR 1020130048122A · 2013 [cited by applicant]
KR 1020140043730A · 2014 [cited by applicant]
KR 1020140085434A · 2014 [cited by applicant]
KR 1020140092876A · 2014 [cited by applicant]
KR 1020150065845A · 2015 [cited by applicant]
Helle et al.. Block Merging for Quadtree-Based Partitioning in HEVC, Dec. 2012, IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, pp. 1720-1731 (Year: 2012). [cited by applicant]
International Search Report issue on Jan. 4, 2019 in counterpart International Patent Application No. PCT/KR2018/010951 (3 pages in English and 3 pages in Korean). [cited by applicant]
R. Leonardi and H. Chen, Tree based motion compensated video coding, Proceedings of 1st International Conference on Image Processing, Austin, TX, USA, 1994, pp. 438-442 vol. 2, doi: 10.1109/ICIP. 1994.413608 (Year: 1994… [cited by applicant]