IP Library Granted Patent US 12,634,486
Granted Patent B2
US 12,634,486 · App. 18/930,537 · Granted May 19, 2026

Picture coding supporting block partitioning and block merging

Inventors: Philipp Helle (Berlin, DE); Heiko Schwarz (Panketal, DE); Detlev Marpe (Berlin, DE); Thomas Wiegand (Berlin, DE); Simon Oudin (Berlin, DE); Benjamin Bross (Berlin, DE)
Assignee: Dolby Video Compression, LLC
H04N19/176H04N19/119H04N19/147H04N19/196H04N19/46H04N19/61H04N19/70H04N19/93
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,634,486
App. No.
18/930,537
Granted
May 19, 2026
Kind
B2
Abstract

A further coding efficiency increase may be achieved if for a current block of a picture, for which the bit stream signals one of supported partitioning patterns, a reversal of the partitioning by block merging is avoided. In particular, if the signaled one of the supported partitioning patterns specifies a subdivision of the block into two or more further blocks, a removal of certain coding parameter candidates for all further blocks, except a first further block of the further blocks in a coding order, is performed. Particularly, those coding parameter candidates are removed from the set of coding parameter candidates for the respective further block, the coding parameters of which are the same as coding parameters associated with any of the further blocks which, when being merged with the respective further block, would result in one of the supported partitioning pattern. This avoids redundancy between partitioning coding and merging coding.

Claims (48)

1 . A decoder configured to decode a bitstream signaling one of supported partitioning patterns for a current block of a picture, wherein:

if the signaled one of the supported partitioning patterns specifies a subdivision of the current block into a plurality of sub-blocks, the decoder is configured to:

determine coding parameter candidates for a current sub-block of the plurality of sub-blocks,

check whether a total number of the determined coding parameter candidates is equal to a predetermined number of coding parameter candidates needed to complete a set of coding parameter candidates for the current sub-block, and

based on an indication from the check that the total number of the determined coding parameter candidates is not equal to the predetermined number of coding parameter candidates, provide one or more ancillary coding parameter candidates including a zero motion vector parameter to the set of coding parameter candidates to complete the set, wherein:

the current sub-block is not a first sub-block of the plurality of sub-blocks in a coding order, and

a coding parameter candidate associated with any candidate sub-block is excluded from the set of coding parameter candidates for the current sub-block if the candidate sub-block, when being merged with the current sub-block, results in one of the supported partitioning patterns.

2 . The decoder according to claim 1 , wherein the one or more ancillary coding parameter candidates include parameters of neighboring partitions of temporally neighboring and previously coded pictures.

3 . The decoder according to claim 1 , wherein the one or more ancillary coding parameter candidates include a combined coding parameter candidate obtained by combination of coding parameters associated with previously decoded blocks neighboring the current sub-block.

4 . The decoder according to claim 1 , wherein the decoder is configured to, depending on a total quantity of coding parameter candidates in the set of coding parameter candidates being greater than one, decode a syntax element from the bitstream specifying which of the predetermined number of coding parameter candidates is to be used for merging.

5 . The decoder according to claim 1 , wherein the picture has associated therewith a depth map as additional information.

6 . The decoder according to claim 1 , wherein the picture includes sample arrays related to different planes of the picture.

7 . The decoder according to claim 6 , wherein the different planes of the picture are coded independently from each other.

8 . An encoder configured to encode a picture into a bitstream, the encoder being configured to:

signal, within the bitstream, one of supported partitioning patterns for a current block of the picture; and

if the signaled one of the supported partitioning patterns specifies a subdivision of the current block into a plurality of sub-blocks,

determine coding parameter candidates for a current sub-block of the plurality of sub-blocks,

check whether a total number of the determined coding parameter candidates is equal to a predetermined number of coding parameter candidates needed to complete a set of coding parameter candidates for the current sub-block, and

based on an indication from the check that the total number of the determined coding parameter candidates is not equal to the predetermined number of coding parameter candidates, provide one or more ancillary coding parameter candidates including a zero motion vector parameter to the set of coding parameter candidates to complete the set, wherein:

the current sub-block is not a first sub-block of the plurality of sub-blocks in a coding order, and

a coding parameter candidate associated with any candidate sub-block is excluded from the set of coding parameter candidates for the current sub-block if the candidate sub-block, when being merged with the current sub-block, results in one of the supported partitioning patterns.

9 . The encoder according to claim 8 , wherein the one or more ancillary coding parameter candidates include parameters of neighboring partitions of temporally neighboring and previously coded pictures.

10 . The encoder according to claim 8 , wherein the one or more ancillary coding parameter candidates include a combined coding parameter candidate obtained by combination of coding parameters associated with previously decoded blocks neighboring the current sub-block.

11 . The encoder according to claim 8 , wherein the picture has associated therewith a depth map as additional information.

12 . The encoder according to claim 8 , wherein the picture includes sample arrays related to different planes of the picture.

13 . The encoder according to claim 12 , wherein the different planes of the picture are coded independently from each other.

14 . The encoder according to claim 8 , wherein the encoder is configured to derive at least one coding parameter candidate of the set based on a combination of coding parameters of two previously coded blocks.

15 . A method for decoding a data stream, comprising:

obtaining, in the data stream, data signaling one of supported partitioning patterns for a current block of a picture;

determining that the signaled one of the supported partitioning patterns specifies a subdivision of the current block into a plurality of sub-blocks;

determining coding parameter candidates for a current sub-block of the plurality of sub-blocks;

checking whether a total number of the determined coding parameter candidates is equal to a predetermined number of coding parameter candidates needed to complete a set of coding parameter candidates for the current sub-block; and

based on an indication from the check that the total number of the determined coding parameter candidates is not equal to the predetermined number of coding parameter candidates, providing one or more ancillary coding parameter candidates including a zero motion vector parameter to the set of coding parameter candidates to complete the set, wherein:

the current sub-block is not a first sub-block of the plurality of sub-blocks in a coding order, and

a coding parameter candidate associated with any candidate sub-block is excluded from the set of coding parameter candidates for the current sub-block if the candidate sub-block, when being merged with the current sub-block, results in one of the supported partitioning patterns.

16 . The method according to claim 15 , wherein the one or more ancillary coding parameter candidates include parameters of neighboring partitions of temporally neighboring and previously coded pictures.

17 . The method according to claim 15 , wherein the one or more ancillary coding parameter candidates include a combined coding parameter candidate obtained by combination of coding parameters associated with previously decoded blocks neighboring the current sub-block.

18 . The method according to claim 15 , wherein the picture has associated therewith a depth map as additional information.

19 . The method according to claim 15 , wherein the picture includes sample arrays related to different planes of the picture, wherein the different planes are coded independently from each other.

20 . A method for encoding a picture into a data stream, comprising:

signaling, within the data stream, one of supported partitioning patterns for a current block of the picture; and

if the signaled one of the supported partitioning patterns specifies a subdivision of the current block into a plurality of sub-blocks,

determining coding parameter candidates for a current sub-block of the plurality of sub-blocks,

checking whether a total number of the determined coding parameter candidates is equal to a predetermined number of coding parameter candidates needed to complete a set of coding parameter candidates for the current sub-block, and

based on an indication from the check that the total number of the determined coding parameter candidates is not equal to the predetermined number of coding parameter candidates, providing one or more ancillary coding parameter candidates including a zero motion vector parameter to the set of coding parameter candidates to complete the set, wherein:

the current sub-block is not a first sub-block of the plurality of sub-blocks in a coding order, and

a coding parameter candidate associated with any candidate sub-block is excluded from the set of coding parameter candidates for the current sub-block if the candidate sub-block, when being merged with the current sub-block, results in one of the supported partitioning patterns.

21 . A method, comprising storing, on a digital storage medium, a data stream into which a picture is encoded by a method according to claim 20 .

Assignments (1)
CHANGE OF NAME Recorded Nov 26, 2024
From: GE VIDEO COMPRESSION, LLC
To: DOLBY VIDEO COMPRESSION, LLC
Reel/Frame 069451/0262 →
Continuity (8)
Continuation 18460432 · Sep 1, 2023
Continuation 17330197 · May 25, 2021
Continuation 17038777 · Sep 30, 2020
Continuation 16846579 · Apr 13, 2020
Continuation 13857506 · Apr 5, 2013
Continuation PCTEP2011067647 · Oct 10, 2011
Provisional Application 61391473 · Oct 8, 2010
Related Publication 20250126278A1 · Apr 17, 2025
References Cited (45)
US 5225904A · Golin et al. · 1993 [cited by applicant]
US 7529302B2 · Mukerjee et al. · 2009 [cited by applicant]
US 7606311B2 · Hsu et al. · 2009 [cited by applicant]
US 7899119B2 · Thoreau et al. · 2011 [cited by applicant]
US 20080165855A1 · Wang et al. · 2008 [cited by applicant]
US 20090080788A1 · Lynch et al. · 2009 [cited by applicant]
US 20090154546A1 · Liu · 2009 [cited by applicant]
US 20110194613A1 · Chen · 2011 [cited by applicant]
US 20130148737A1 · Tourapis et al. · 2013 [cited by applicant]
US 20200128259A1 · Helle et al. · 2020 [cited by applicant]
CN 1801946A · 2006 [cited by applicant]
CN 1874509A · 2006 [cited by applicant]
CN 1998152A · 2007 [cited by applicant]
CN 101017573A · 2007 [cited by applicant]
CN 1756363A · 2008 [cited by applicant]
CN 101222635A · 2008 [cited by applicant]
CN 101223780A · 2008 [cited by applicant]
CN 101282478A · 2008 [cited by applicant]
CN 101375608A · 2009 [cited by applicant]
CN 101409831A · 2009 [cited by applicant]
CN 1016827694 · 2010 [cited by applicant]
CN 101765010A · 2010 [cited by applicant]
JP WO03026315 · 2003 [cited by applicant]
JP 2004040785A · 2004 [cited by applicant]
JP 2010524397A · 2010 [cited by applicant]
JP 2015200777A · 2016 [cited by applicant]
JP 2018082466A · 2018 [cited by applicant]
WO 2004080084A1 · 2004 [cited by applicant]
WO 2006058921A · 2006 [cited by applicant]
WO 2006058921A1 · 2006 [cited by applicant]
WO 2008127597A2 · 2008 [cited by applicant]
WO 2009091383A2 · 2009 [cited by applicant]
Takeshi Chujoh et al., “Description of video coding technology proposal by TOSHIBA”, Joint Collaborative Team on Video Coding (JCT-VC), Apr. 15, 2010, [JCTVC-A 117r1] (version 1), pp. 4-6, 1st Meeting: Dresden, DE, Apr.… [cited by applicant]
Benjamin Bross et al., “WD4: Working Draft 4 of High-Efficiency Video Coding”, Joint Collaborative Team on Video Coding (JCTNC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 6th Meeting: Torino, IT, Jul. 14-22, 2011. [cited by applicant]
Feng Lu et al., “Bit-Depth Scalable Coding Using a Perfect Picture and Adaptive Neighboring Filter”, Tsinghua Science and Technology, ISSN 1007-0214, 04/18, vol. 14, No. 5, Oct. 2009, pp. 570-574. [cited by applicant]
Shuo Yao et al., “A Hardward Implementation for Full-search Motion Estimation of AVS with Search Center Prediction”, IEEE Transaction on Consumer Electronics, vol. 52, No. 4, Nov. 2006, pp. 1356-1361. [cited by applicant]
Li et al., “Redundancy Reduction of CBF and Merge Coding,” Joint Collaborative Team on Video Coding (ICT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Oct. 7-15, 2010, 8 pages. [cited by applicant]
Test Model Under Consideration, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Jul. 21-28, 2010, 152 pages. [cited by applicant]
Wiegand et al., “WD3: Working Draft 3 of High-Efficiency Video Coding,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Mar. 16-23, 2011, 160 pages. [cited by applicant]
Lim, “Extended Merging Scheme Using Motion-Hypothesis Inter Prediction,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Jul. 21-28, 2010, pp. 1-7. [cited by applicant]
Chen et al. MVP index parsing with fixed number of candidates, Joint Collaborative Team on Video Coding (JCT-VG) of ITU-T SG16 WP3 and ISO/IEC JTC/SC29/WG11 JTC1/SC29/WG11 6th Meeting: Torino, IT, Jul. 14-22, 2011, Jul.… [cited by applicant]
T. Sugio et al., Parsing Robustness for Merge/AMVP, Joint Collaborative Team on Video Coding JCT-VC of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/SG11 6th Meeting: Torino, IT, Jul. 14-22, 2011, Jul. 14, 2011 JCTVC-F470. [cited by applicant]
Raffaele De Forni et al., “On the Benefits of Leaf Merging in Quad-Tree Motion Models”, University of Padova, Italy, University of New South Wales, Sydney, Australia, IEEE, ICIP-2005, Sep. 11, 2005, 4 pgs. [cited by applicant]
Benjamin Bross et al., WD4: Working Draft 4 of High Efficiency Video Coding, Joint Collaborative Team on Video Coding (JCT-VC) 6th Meeting: Torino, JCTVC-F803-v3.zip, Sep. 8, 2011, JCTVC-F803_d1.doc. [cited by applicant]
Martin Winken et al:,, Video coding technology proposal by Fraunhofer HHI, 1. JCT-VC Meeting; Apr. 15-23, 2010; Dresden: (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-TSG. 16); URL: http://… [cited by applicant]