IP Library Granted Patent US 12,328,453
Granted Patent B2
US 12,328,453 · App. 18/425,034 · Granted Jun 10, 2025

Coding of a spatial sampling of a two-dimensional information signal using sub-division

Inventors: Heiner Kirchhoffer (Berlin, DE); Martin Winken (Berlin, DE); Philipp Helle (Berlin, DE); Detlev Marpe (Berlin, DE); Heiko Schwarz (Berlin, DE); Thomas Wiegand (Berlin, DE)
Assignee: Dolby Video Compression, LLC
H04N19/96H04N19/17H04N19/176H04N19/1883H04N19/46H04N19/52H04N19/53H04N19/59H04N19/593H04N19/61
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,328,453
App. No.
18/425,034
Granted
Jun 10, 2025
Kind
B2
Abstract

Coding schemes for coding a spatially sampled information signal using subdivision and coding scheme for coding a sub-division or a multi tree structure are described, wherein representative embodiments relate to picture and/or video coding applications.

Claims (94)

1. A decoder for decoding a coded signaling of a multi-tree structure, the coded signaling comprising an indication of a highest hierarchy level and a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node, the decoder being configured to:

decode the indication of the highest hierarchy level from a data stream; and

sequentially decode, in a depth-first or breadth-first traversal order, the sequence of flags from the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

wherein:

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the decoder is configured to sequentially entropy-decode the flags using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

2. The decoder according to claim 1 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block according to which the tree root block is recursively multi-partitioned into leaf blocks, wherein each flag specifies whether an area of the tree root block corresponding to the node with which the respective flag is associated, is multi-partitioned, the decoder being configured to sequentially entropy-decode the flags.

3. The decoder according to claim 1 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture of a video which is coded into the data stream in a manner accompanied with depth information.

4. The decoder according to claim 1 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

5. The decoder according to claim 1 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the decoder is configured to decode the different color planes of the picture independently.

6. A method for decoding a coded signaling of a multi-tree structure, the coded signaling comprising an indication of a highest hierarchy level and a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node, the method comprising:

decoding the indication of the highest hierarchy level from a data stream; and

sequentially decoding, in a depth-first or breadth-first traversal order, the sequence of flags from the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

wherein:

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the flags are sequentially entropy-decoded using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

7. The method according to claim 6 , wherein the picture is accompanied with depth information.

8. The method according to claim 6 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

9. The method according to claim 6 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the method comprises decoding the different color planes of the picture independently.

10. An encoder for generating a coded signaling of a multi-tree structure, the coded signaling comprising an indication of a highest hierarchy level and a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node, the encoder being configured to:

encode the indication of the highest hierarchy level from a data stream; and

sequentially encode, in a depth-first or breadth-first traversal order, the sequence of flags from the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

wherein:

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the encoder is configured to sequentially entropy-encode the flags using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

11. The encoder according to claim 10 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture of a video which is coded into the data stream in a manner accompanied with depth information.

12. The encoder according to claim 10 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

13. The encoder according to claim 10 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the encoder is configured to encode the different color planes of the picture independently.

14. A method for generating a coded signaling of a multi-tree structure, the coded signaling comprising an indication of a highest hierarchy level and a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node, the method comprising:

encoding the indication of the highest hierarchy level from a data stream; and

sequentially encoding, in a depth-first or breadth-first traversal order, the sequence of flags from the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

wherein:

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the flags are sequentially entropy-encoded using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

15. The method according to claim 14 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture of a video which is coded into the data stream in a manner accompanied with depth information.

16. The method according to claim 14 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

17. The method according to claim 14 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the method comprises encoding the different color planes of the picture independently.

18. A method for decoding a data stream, wherein the method comprises:

decoding a data stream into which a signaling of a multi-tree structure is coded, the data stream comprising:

an indication of a highest hierarchy level, and

a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node,

wherein:

the sequence of flags is sequentially encoded, in a depth-first or breadth-first traversal order, into the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the flags are sequentially entropy-encoded using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

19. The method according to claim 18 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture of a video which is coded into the data stream in a manner accompanied with depth information.

20. The method according to claim 18 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

21. The method according to claim 18 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the different color planes of the picture are decoded independently.

22. A method for decoding a data stream, wherein the method comprises:

decoding a data stream into which a signaling of a multi-tree structure is coded,

wherein the coded signaling comprises an indication of a highest hierarchy level and a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node, wherein the coded signaling is generated by:

encoding the indication of the highest hierarchy level from a data stream, and

sequentially encoding, in a depth-first or breadth-first traversal order, the sequence of flags from the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

wherein:

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the flags are sequentially entropy-encoded using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

23. A method for transmitting information on a multi-tree structure, comprising:

transmitting, on a transmission medium, a data stream into which a signaling of the multi-tree structure is coded, the data stream comprising:

an indication of a highest hierarchy level, and

a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node,

wherein:

the sequence of flags is sequentially encoded, in a depth-first or breadth-first traversal order, into the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the flags are sequentially entropy-encoded using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

24. The method according to claim 23 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture of a video which is coded into the data stream in a manner accompanied with depth information.

25. The method according to claim 23 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

26. The method according to claim 23 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the different color planes of the picture are decoded independently.

27. A method for storing information on a multi-tree structure, comprising

storing, on a digital storage medium, a data stream into which a signaling of the multi-tree structure is coded, the data stream comprising:

an indication of a highest hierarchy level, and

a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node,

wherein:

the sequence of flags is sequentially encoded, in a depth-first or breadth-first traversal order, into the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,

the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,

the tree root block is rectangular,

the flags are sequentially entropy-encoded using probability estimation contexts,

the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.

28. The method according to claim 27 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture of a video which is coded into the data stream in a manner accompanied with depth information.

29. The method according to claim 27 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in a manner comprising an array of luma samples along with two arrays of chroma samples, wherein a scaling factor for a spatial resolution of the arrays of chroma samples relative to the array of luma samples in the horizontal direction differs from a scaling factor for a spatial resolution in the vertical direction.

30. The method according to claim 27 , wherein the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture coded into the data stream in different color planes corresponding to different color components, and the different color planes of the picture are decoded independently.

Assignments (2)
CHANGE OF NAME Recorded Jan 30, 2026
From: GE VIDEO COMPRESSION, LLC
To: DOLBY VIDEO COMPRESSION, LLC
Reel/Frame 074536/0781 →
CHANGE OF NAME Recorded Nov 26, 2024
From: GE VIDEO COMPRESSION, LLC
To: DOLBY VIDEO COMPRESSION, LLC
Reel/Frame 069450/0772 →
Priority Claims (2)
EP 10159819 · Apr 13, 2010 · regional
WO PCT/EP2010/054843 · Apr 13, 2010 · international
Continuity (11)
Continuation 18359798 · Jul 26, 2023
Continuation 18052718 · Nov 4, 2022
Continuation 17211013 · Mar 24, 2021
Continuation 16855266 · Apr 22, 2020
Continuation 16561427 · Sep 5, 2019
Continuation 16155281 · Oct 9, 2018
Continuation 15413852 · Jan 24, 2017
Continuation 15195407 · Jun 28, 2016
Continuation 13649251 · Oct 11, 2012
Continuation PCTEP2011055534 · Apr 8, 2011
Related Publication 20240267569A1 · Aug 8, 2024
References Cited (400)
US 4980764A · Henot · 1990 [cited by applicant]
US 5603012A · Sotheran · 1997 [cited by applicant]
US 5724537A · Jones · 1998 [cited by applicant]
US 5809270A · Robbins · 1998 [cited by applicant]
US 6005981A · Ng · 1999 [cited by applicant]
US 6057884A · Chen · 2000 [cited by applicant]
US 6067574A · Tzeng · 2000 [cited by applicant]
US 6202178B1 · Spruyt · 2001 [cited by applicant]
US 6269175B1 · Hanna · 2001 [cited by applicant]
US 6269192B1 · Sodagar et al. · 2001 [cited by applicant]
US 6408097B1 · Kondo · 2002 [cited by applicant]
US 7254533B1 · Jabri · 2007 [cited by applicant]
US 9591335B2 · Kirchhoffer · 2017 [cited by applicant]
US 9596488B2 · Kirchhoffer · 2017 [cited by applicant]
US 10248966B2 · Helle et al. · 2019 [cited by applicant]
US 10460344B2 · Helle et al. · 2019 [cited by applicant]
US 10621614B2 · Helle et al. · 2020 [cited by applicant]
US 10672028B2 · Helle et al. · 2020 [cited by applicant]
US 10681390B2 · Kirchhoffer · 2020 [cited by applicant]
US 10687086B2 · Kirchhoffer · 2020 [cited by applicant]
US 10708628B2 · Kirchhoffer et al. · 2020 [cited by applicant]
US 10719850B2 · Helle et al. · 2020 [cited by applicant]
US 10748183B2 · Helle et al. · 2020 [cited by applicant]
US 10764608B2 · Kirchhoffer · 2020 [cited by applicant]
US 10771822B2 · Kirchhoffer · 2020 [cited by applicant]
US 10803483B2 · Helle et al. · 2020 [cited by applicant]
US 10803485B2 · Helle et al. · 2020 [cited by applicant]
US 10855990B2 · Winken et al. · 2020 [cited by applicant]
US 11037194B2 · Helle et al. · 2021 [cited by applicant]
US 11087355B2 · Helle et al. · 2021 [cited by applicant]
US 11736738B2 · Kirchhoffer · 2023 [cited by examiner]
US 20010004404A1 · Itokawa · 2001 [cited by applicant]
US 20010039487A1 · Hammersley · 2001 [cited by applicant]
US 20020009233A1 · Pesquet-Popescu · 2002 [cited by applicant]
US 20020064231A1 · Felts · 2002 [cited by applicant]
US 20020106019A1 · Chaddha · 2002 [cited by applicant]
US 20020181745A1 · Ho · 2002 [cited by applicant]
US 20030021485A1 · Raveendran et al. · 2003 [cited by applicant]
US 20030076881A1 · Akiyoshi · 2003 [cited by applicant]
US 20030123545A1 · Prakash · 2003 [cited by applicant]
US 20030156682A1 · Wise · 2003 [cited by applicant]
US 20030179940A1 · Lin et al. · 2003 [cited by applicant]
US 20030198290A1 · Millin · 2003 [cited by applicant]
US 20030202596A1 · Lainema et al. · 2003 [cited by applicant]
US 20040062445A1 · Kim · 2004 [cited by applicant]
US 20040028049A1 · Wan · 2004 [cited by applicant]
US 20040028282A1 · Kato · 2004 [cited by applicant]
US 20040047418A1 · Tourapis et al. · 2004 [cited by applicant]
US 20040061883A1 · Kanatsu · 2004 [cited by applicant]
US 20040131269A1 · Kobayashi · 2004 [cited by applicant]
US 20040184662A1 · Kravec et al. · 2004 [cited by applicant]
US 20040194008A1 · Garudadri et al. · 2004 [cited by applicant]
US 20040213469A1 · Apostolopoulos et al. · 2004 [cited by applicant]
US 20040234143A1 · Hagai · 2004 [cited by applicant]
US 20050013370A1 · Kim · 2005 [cited by applicant]
US 20050013376A1 · Dattani et al. · 2005 [cited by applicant]
US 20050018770A1 · Adolp · 2005 [cited by applicant]
US 20050114093A1 · Cha · 2005 [cited by applicant]
US 20050114298A1 · Fan et al. · 2005 [cited by applicant]
US 20050123042A1 · Park · 2005 [cited by applicant]
US 20050129122A1 · Booth · 2005 [cited by examiner]
US 20050200630A1 · Evans · 2005 [cited by applicant]
US 20050213655A1 · Thoreau et al. · 2005 [cited by applicant]
US 20050286759A1 · Zitnick, III et al. · 2005 [cited by applicant]
US 20060002474A1 · Au · 2006 [cited by applicant]
US 20060013308A1 · Kim · 2006 [cited by applicant]
US 20060083309A1 · Schwarz · 2006 [cited by applicant]
US 20060089832A1 · Ojanpera · 2006 [cited by applicant]
US 20060120448A1 · Han et al. · 2006 [cited by applicant]
US 20060120454A1 · Park · 2006 [cited by applicant]
US 20060126962A1 · Sun · 2006 [cited by applicant]
US 20060153295A1 · Wang · 2006 [cited by applicant]
US 20060153300A1 · Wang et al. · 2006 [cited by applicant]
US 20060198444A1 · Wada · 2006 [cited by applicant]
US 20060203911A1 · Zhou · 2006 [cited by applicant]
US 20060209959A1 · Sun · 2006 [cited by applicant]
US 20060233251A1 · Kim · 2006 [cited by applicant]
US 20060233254A1 · Lee · 2006 [cited by applicant]
US 20060233262A1 · Ridge et al. · 2006 [cited by applicant]
US 20060262216A1 · Zhai · 2006 [cited by applicant]
US 20060268988A1 · Sun et al. · 2006 [cited by applicant]
US 20070005795A1 · Gonzalez · 2007 [cited by applicant]
US 20070018994A1 · Sekine · 2007 [cited by applicant]
US 20070036215A1 · Pan et al. · 2007 [cited by applicant]
US 20070053441A1 · Wang et al. · 2007 [cited by applicant]
US 20070063877A1 · Shmunk et al. · 2007 [cited by applicant]
US 20070074266A1 · Raveendran et al. · 2007 [cited by applicant]
US 20070086516A1 · Lee et al. · 2007 [cited by applicant]
US 20070110153A1 · Cho et al. · 2007 [cited by applicant]
US 20070115154A1 · Park et al. · 2007 [cited by applicant]
US 20070160133A1 · Bao et al. · 2007 [cited by applicant]
US 20070177667A1 · Subramania · 2007 [cited by applicant]
US 20070223582A1 · Borer et al. · 2007 [cited by applicant]
US 20070230574A1 · Valente · 2007 [cited by applicant]
US 20070237224A1 · Krishnan · 2007 [cited by applicant]
US 20070248274A1 · Govindaswamy et al. · 2007 [cited by applicant]
US 20080069203A1 · Karczewicz et al. · 2008 [cited by applicant]
US 20080086545A1 · Fatt et al. · 2008 [cited by applicant]
US 20080089417A1 · Bac · 2008 [cited by applicant]
US 20080095238A1 · Wu · 2008 [cited by applicant]
US 20080127597A1 · Puchniak · 2008 [cited by applicant]
US 20080165855A1 · Wang · 2008 [cited by applicant]
US 20080170793A1 · Yamada et al. · 2008 [cited by applicant]
US 20080247657A1 · Kalevo et al. · 2008 [cited by applicant]
US 20080267291A1 · Vieron et al. · 2008 [cited by applicant]
US 20080298694A1 · Kim et al. · 2008 [cited by applicant]
US 20080310504A1 · Ye et al. · 2008 [cited by applicant]
US 20090003441A1 · Sekiguchi · 2009 [cited by examiner]
US 20090003448A1 · Sekiguchi et al. · 2009 [cited by applicant]
US 20090003457A1 · Lu et al. · 2009 [cited by applicant]
US 20090003717A1 · Sekiguchi et al. · 2009 [cited by applicant]
US 20090028245A1 · Vieron et al. · 2009 [cited by applicant]
US 20090028427A1 · Yamada et al. · 2009 [cited by applicant]
US 20090037791A1 · Pavlov et al. · 2009 [cited by applicant]
US 20090055749A1 · Chatterjee et al. · 2009 [cited by applicant]
US 20090079876A1 · Takeshima et al. · 2009 [cited by applicant]
US 20090080521A1 · Marpe · 2009 [cited by applicant]
US 20090080535A1 · Yin · 2009 [cited by applicant]
US 20090080536A1 · Lee et al. · 2009 [cited by applicant]
US 20090092188A1 · Lee et al. · 2009 [cited by applicant]
US 20090096643A1 · Chang · 2009 [cited by applicant]
US 20090103602A1 · Xiong et al. · 2009 [cited by applicant]
US 20090116759A1 · Suzuki et al. · 2009 [cited by applicant]
US 20090129465A1 · Lai et al. · 2009 [cited by applicant]
US 20090147850A1 · Pandit · 2009 [cited by applicant]
US 20090147866A1 · She et al. · 2009 [cited by applicant]
US 20090152357A1 · Lei et al. · 2009 [cited by applicant]
US 20090154567A1 · Lei et al. · 2009 [cited by applicant]
US 20090165041A1 · Penberthy et al. · 2009 [cited by applicant]
US 20090175333A1 · Hsiang · 2009 [cited by applicant]
US 20090180552A1 · Visharam et al. · 2009 [cited by applicant]
US 20090196342A1 · Divorra Escoda et al. · 2009 [cited by applicant]
US 20090196517A1 · Divorra Escoda et al. · 2009 [cited by applicant]
US 20090225846A1 · Francois et al. · 2009 [cited by applicant]
US 20090238279A1 · Tu et al. · 2009 [cited by applicant]
US 20090273706A1 · Tu · 2009 [cited by applicant]
US 20090296017A1 · Itoh · 2009 [cited by applicant]
US 20090304090A1 · Cordara et al. · 2009 [cited by applicant]
US 20100027624A1 · Yu · 2010 [cited by applicant]
US 20100034260A1 · Shimizu et al. · 2010 [cited by applicant]
US 20100034265A1 · Kim et al. · 2010 [cited by applicant]
US 20100046626A1 · Tu · 2010 [cited by applicant]
US 20100061450A1 · Sato et al. · 2010 [cited by applicant]
US 20100086029A1 · Chen · 2010 [cited by applicant]
US 20100086031A1 · Chen · 2010 [cited by applicant]
US 20100086032A1 · Chen · 2010 [cited by examiner]
US 20100124273A1 · Divorra Escoda et al. · 2010 [cited by applicant]
US 20100135387A1 · Divorra Escoda et al. · 2010 [cited by applicant]
US 20100150394A1 · Bloom · 2010 [cited by applicant]
US 20100158110A1 · Pandit et al. · 2010 [cited by applicant]
US 20100165077A1 · Yin · 2010 [cited by applicant]
US 20100202512A1 · Chi · 2010 [cited by applicant]
US 20100208818A1 · Yin et al. · 2010 [cited by applicant]
US 20100208827A1 · Divorra Escoda et al. · 2010 [cited by applicant]
US 20100220469A1 · Ivey · 2010 [cited by applicant]
US 20100226569A1 · Mokrushin · 2010 [cited by applicant]
US 20100254463A1 · Wahadaniah et al. · 2010 [cited by applicant]
US 20100284466A1 · Pandit et al. · 2010 [cited by applicant]
US 20100290527A1 · Park · 2010 [cited by applicant]
US 20100299454A1 · Lyashevsky · 2010 [cited by applicant]
US 20110019096A1 · Lee · 2011 [cited by applicant]
US 20110038422A1 · Cheon · 2011 [cited by examiner]
US 20110110428A1 · Chang et al. · 2011 [cited by applicant]
US 20110122225A1 · Kim et al. · 2011 [cited by applicant]
US 20110142133A1 · Takahashi et al. · 2011 [cited by applicant]
US 20110170595A1 · Shi · 2011 [cited by applicant]
US 20110170608A1 · Shi et al. · 2011 [cited by applicant]
US 20110243233A1 · Alshina · 2011 [cited by applicant]
US 20110243249A1 · Lee · 2011 [cited by applicant]
US 20110249743A1 · Zhao et al. · 2011 [cited by applicant]
US 20110299788A1 · Suzuki et al. · 2011 [cited by applicant]
US 20120147957A1 · Alshina · 2012 [cited by applicant]
US 20120170648A1 · Chen · 2012 [cited by applicant]
US 20120177106A1 · Divorra Escoda et al. · 2012 [cited by applicant]
US 20130034157A1 · Helle · 2013 [cited by applicant]
US 20130034171A1 · Winken · 2013 [cited by applicant]
US 20130039422A1 · Kirchhoffer · 2013 [cited by applicant]
US 20130039423A1 · Helle · 2013 [cited by applicant]
US 20130121415A1 · Wahadaniah et al. · 2013 [cited by applicant]
US 20130279577A1 · Schwarz · 2013 [cited by applicant]
US 20130287116A1 · Helle · 2013 [cited by applicant]
US 20140003522A1 · Park et al. · 2014 [cited by applicant]
US 20140112387A1 · Ye et al. · 2014 [cited by applicant]
US 20150016525A1 · Alshin et al. · 2015 [cited by applicant]
US 20150201200A1 · Cheong et al. · 2015 [cited by applicant]
US 20150229957A1 · Zhao et al. · 2015 [cited by applicant]
US 20160029035A1 · Nguyen et al. · 2016 [cited by applicant]
US 20170197579A1 · Helle et al. · 2017 [cited by applicant]
US 20180007379A1 · Park · 2018 [cited by applicant]
US 20180218397A1 · Helle · 2018 [cited by applicant]
US 20190087857A1 · Helle et al. · 2019 [cited by applicant]
US 20190089962A1 · Winken et al. · 2019 [cited by applicant]
US 20190089992A1 · Kirchhoffer · 2019 [cited by applicant]
US 20190164188A1 · Helle et al. · 2019 [cited by applicant]
US 20200074503A1 · Helle et al. · 2020 [cited by applicant]
US 20210029365A1 · Winken et al. · 2021 [cited by applicant]
US 20210385500A1 · Zhang et al. · 2021 [cited by applicant]
US 20220103867A1 · Wang · 2022 [cited by applicant]
AU 2007205337 · 2010 [cited by applicant]
CA 2732532A1 · 2007 [cited by applicant]
CN 1168054A · 1997 [cited by applicant]
CN 1418436A · 2003 [cited by applicant]
CN 1418437A · 2003 [cited by applicant]
CN 1549206A · 2004 [cited by applicant]
CN 1549988A · 2004 [cited by applicant]
CN 1551636A · 2004 [cited by applicant]
CN 1581977 · 2005 [cited by applicant]
CN 1595990A · 2005 [cited by applicant]
CN 1637782A · 2005 [cited by applicant]
CN 1672177A · 2005 [cited by applicant]
CN 1691087A · 2005 [cited by applicant]
CN 1717047A · 2006 [cited by applicant]
CN 1728833A · 2006 [cited by applicant]
CN 1766990A · 2006 [cited by applicant]
CN 1780278A · 2006 [cited by applicant]
CN 1795680A · 2006 [cited by applicant]
CN 1812579A · 2006 [cited by applicant]
CN 1882093A · 2006 [cited by applicant]
CN 197647A · 2007 [cited by applicant]
CN 1917647A · 2007 [cited by applicant]
CN 1933600A · 2007 [cited by applicant]
CN 1957617A · 2007 [cited by applicant]
CN 1960491A · 2007 [cited by applicant]
CN 1976458A · 2007 [cited by applicant]
CN 101001374A · 2007 [cited by applicant]
CN 101018333A · 2007 [cited by applicant]
CN 101047733A · 2007 [cited by applicant]
CN 101068362A · 2007 [cited by applicant]
CN 101068366A · 2007 [cited by applicant]
CN 101073265A · 2007 [cited by applicant]
CN 10110611A · 2008 [cited by applicant]
CN 101119493A · 2008 [cited by applicant]
CN 101120584A · 2008 [cited by applicant]
CN 101124589A · 2008 [cited by applicant]
CN 101127899A · 2008 [cited by applicant]
CN 101189641A · 2008 [cited by applicant]
CN 101189876A · 2008 [cited by applicant]
CN 101199121A · 2008 [cited by applicant]
CN 101204092A · 2008 [cited by applicant]
CN 101213840A · 2008 [cited by applicant]
CN 101213842A · 2008 [cited by applicant]
CN 101222644A · 2008 [cited by applicant]
CN 101325714A · 2008 [cited by applicant]
CN 101366283A · 2009 [cited by applicant]
CN 101385350A · 2009 [cited by applicant]
CN 101385351 · 2009 [cited by applicant]
CN 101395922A · 2009 [cited by applicant]
CN 101404774A · 2009 [cited by applicant]
CN 101406056A · 2009 [cited by applicant]
CN 101416149A · 2009 [cited by applicant]
CN 101416399A · 2009 [cited by applicant]
CN 101459847A · 2009 [cited by applicant]
CN 101493890A · 2009 [cited by applicant]
CN 101494782A · 2009 [cited by applicant]
CN 101502119A · 2009 [cited by applicant]
CN 101502120 · 2009 [cited by applicant]
CN 101507280 · 2009 [cited by applicant]
CN 101507280A · 2009 [cited by applicant]
CN 101510865A · 2009 [cited by applicant]
CN 100545870C · 2009 [cited by applicant]
CN 101617538A · 2009 [cited by applicant]
CN 101676744A · 2010 [cited by applicant]
CN 101682763 · 2010 [cited by applicant]
CN 101682769 · 2010 [cited by applicant]
CN 101682770 · 2010 [cited by applicant]
CN 101321283B · 2010 [cited by applicant]
CN 101854550A · 2010 [cited by applicant]
CN 101889449A · 2010 [cited by applicant]
CN 102939750A · 2013 [cited by applicant]
CN 1589022A · 2015 [cited by applicant]
CN 105915924B · 2016 [cited by applicant]
CN 103733622B · 2017 [cited by applicant]
CN 106028045B · 2019 [cited by applicant]
CN 105915922B · 2019 [cited by applicant]
CN 106231331B · 2019 [cited by applicant]
EP 1158773A2 · 2001 [cited by applicant]
EP 1507415 · 2005 [cited by applicant]
EP 1696674A2 · 2006 [cited by applicant]
EP 1806931A · 2007 [cited by applicant]
EP 2086239A2 · 2009 [cited by applicant]
EP 2485490 · 2012 [cited by applicant]
EP 2545710 · 2013 [cited by applicant]
EP 2559245B1 · 2015 [cited by applicant]
EP 3261344A1 · 2017 [cited by applicant]
EP 3461130A1 · 2019 [cited by applicant]
FR 2633468A1 · 1989 [cited by applicant]
JP 09507347A · 1997 [cited by applicant]
JP 2000350207A · 2000 [cited by applicant]
JP 2004129260 · 2004 [cited by applicant]
JP 2004135252A · 2004 [cited by applicant]
JP 2005039842 · 2005 [cited by applicant]
JP 2005039841 · 2005 [cited by applicant]
JP 2007503784A · 2007 [cited by applicant]
JP 2008537402 · 2008 [cited by applicant]
JP 2008259171A · 2008 [cited by applicant]
JP 2008311781A · 2008 [cited by applicant]
JP 2009010943A · 2009 [cited by applicant]
JP 2010502102 · 2010 [cited by applicant]
JP 2010502102A · 2010 [cited by applicant]
JP 2010045853A · 2010 [cited by applicant]
JP 2010081465A · 2010 [cited by applicant]
JP 2011509631 · 2011 [cited by applicant]
JP 2011526770 · 2011 [cited by applicant]
JP 2012504910 · 2012 [cited by applicant]
JP 2013509080 · 2013 [cited by applicant]
KR 20030068606A · 2003 [cited by applicant]
KR 1020060079051A · 2006 [cited by applicant]
KR 20090057225A · 2009 [cited by applicant]
KR 1020090057225A · 2009 [cited by applicant]
KR 1020110017783A · 2011 [cited by applicant]
KR 1020110135471A · 2011 [cited by applicant]
KR 1020130007654A · 2013 [cited by applicant]
KR 1020130020690A · 2013 [cited by applicant]
KR 1020140071A · 2014 [cited by applicant]
KR 102013009A · 2015 [cited by applicant]
KR 102013002750A · 2015 [cited by applicant]
KR 1020130084314A · 2015 [cited by applicant]
TW I311870A · 2005 [cited by applicant]
TW 200723886A · 2007 [cited by applicant]
TW 200907860A · 2009 [cited by applicant]
TW 200910977A · 2009 [cited by applicant]
TW 200913726A · 2009 [cited by applicant]
TW 200949824A · 2009 [cited by applicant]
TW 200952461A · 2009 [cited by applicant]
WO 9514349A1 · 1995 [cited by applicant]
WO 9715146A1 · 1997 [cited by applicant]
WO 9717797 · 1997 [cited by applicant]
WO 03034743A1 · 2003 [cited by applicant]
WO 2004086302A1 · 2004 [cited by applicant]
WO 2005041420 · 2005 [cited by applicant]
WO 2008071542 · 2005 [cited by applicant]
WO 2007047736A2 · 2007 [cited by applicant]
WO 2008030067A1 · 2008 [cited by applicant]
WO 2008027192 · 2008 [cited by applicant]
WO 2008127597A2 · 2008 [cited by applicant]
WO 2008127072A1 · 2008 [cited by applicant]
WO 2008128898 · 2008 [cited by applicant]
WO 2008156548 · 2008 [cited by applicant]
WO 2008156548A · 2008 [cited by applicant]
WO 2009001864A1 · 2008 [cited by applicant]
WO 2009041843A1 · 2009 [cited by applicant]
WO 2009051719 · 2009 [cited by applicant]
WO 2009092454 · 2009 [cited by applicant]
WO 2009092458 · 2009 [cited by applicant]
WO 2010002214A2 · 2010 [cited by applicant]
WO 2010039731A2 · 2010 [cited by applicant]
WO 2010039733A2 · 2010 [cited by applicant]
WO 2011049396 · 2011 [cited by applicant]
WO 2011128365A1 · 2011 [cited by applicant]
Bozinovic N., et al., “Modeling Motion for Spatial Scalability”, Acoustics, Speech and Signal Processing, 2006, ICASSP 2006 Proceedings, 2006 IEEE International Conference on Toulouse, France May 14-19, 2006, pp. 299-II… [cited by applicant]
Decision to Grant Patent, dated Apr. 28, 2015, issued in corresponding Japanese Patent Application No. 2013-504257, with English translation, 6 pages. [cited by applicant]
Decision to Grant a Patent, dated Oct. 13, 2015, issued in corresponding Japanese Patent Application No. 2014-096318, with Englis translation, 6 pages. [cited by applicant]
Decision to Grant dated Nov. 2, 2015, from corresponding Korean Patent Application No. 10-2012-7029512, 2 pages. [cited by applicant]
Decision to Grant dated Nov. 2, 2015, from corresponding Korean Patent Application No. 10-2014-7014050, 2 pages. [cited by applicant]
Decision to Grant a Patent, dated Nov. 10, 2015, issued in corresponding Japanese Patent Application No. 2013-504211, with English translation, 6 pages. [cited by applicant]
Decision to Grant Nov. 25, 2015, in corresponding Korean Patent Application No. 10-2014-7027407, with English translation, 8 pages. [cited by applicant]
Decision to Grant dated Oct. 20, 2015, with English translation, from corresponding Japanese Application No. 2013-504130, 8 pages. [cited by applicant]
Deforni, Raffaele et al., “On The Benefits of Leaf Merging in Quad-Tree Motion Models”, IEEE, Apr. 20, 2010. [cited by applicant]
Extended European Search Report dated Jan. 28, 2016, 12 pages. [cited by applicant]
Extended European Search Report dated Oct. 27, 2015 from corresponding European Patent Application No. 15174132.9, 11 pages. [cited by applicant]
Final Rejection mailed Jan. 29, 2016 in parallel U.S. Appl. No. 13/369,251, 29 pages. [cited by applicant]
Grewatsch S., et al., “Shang of Motion Vectors in 3D Video Coding”, Proc. of the 2004 Int. Conf. on Image Processing (ICIP '04), Oct. 27, 2004, vol. 5, p. 3271-3274, ISBN: 0-7803-8554-3, 4 pages. [cited by applicant]
Hirowitz, et al., “Picture Segmentation by a Tree Traversal Algorithm”, Journal of the Association of Computing Machinery, vol. 23, No. 2, Jan. 1976, 22 pages. [cited by applicant]
Hsiang et al., “Embedded Image Coding Using Zeroblocks of Sbubband/Wavelet Coefficients and Context Modeling”, Proceeding Int'l Symposium on Circuits and Systems(ISCAS), Geneva, May 2000, 111-662-111-665. [cited by applicant]
Kamolrat, B., et al., “3D Motion Estimation for Dept Image Coding in 3D Video Coding”, IEEE Transaction on Consumer Electronics, May 2009, vol. 55, No. 2, p. 824-830, ISSN: 0098-3063, 7 pages. [cited by applicant]
Kim J.W., et al., “Video Coding with R-D Constrained Hierarchical Variable Block Size (VBS) Motion Estimation”, Journal of Visual Communication and Image Representation, Academic Press, Inc., US, vol. 9, No. 3, Jan. 1, … [cited by applicant]
Kim Jaeil, et al., “Enlarging MB size for High Fidelity Video Coding Beyond HD”, ITU-Telecommunication Standardization Sector Study Group 16 Question 6 Video Coding Experts Group, 36th Meeting: San Diego, USA, Dec. 2008… [cited by applicant]
Kim, Yong-Hwan, et al., “Efficient RGB Video Coding Using Adaptive Inter-Plane Residual Prediction”, Digest of Technical Papers of IEEE Int. Conf. on Consumer Electronics 2008 (ICCE 2008), Jan. 13, 2008, p. 1-2, ISBN: 9… [cited by applicant]
Kimata, Hideaki, “The standardization trend about the three-dimensional picture-MPEG standardization of 3 dimension and a multiaspect picture”, Technical report of the institute of Image and Information and Television E… [cited by applicant]
Lange, R et al., “Extended Inter-Layer Motion Vectors Prediction in Scalable Video Coding-Case Study and Improvement Proposal”, ISO/IED JTC1 SC291WG11 Coding of Moving Pictures and Audio. Bangkok, Thailand., Jan. 2006, … [cited by applicant]
Marpe D., et al., “Context-based adaptive binary arithmetric coding in the H.264/AVC video compression standard”, IEEE Transaction on Circuits and Systems for Video Technology, vol. 13, No. 7, Jul. 1, 2003, pp. 620-636,… [cited by applicant]
Merkle P., et al., “The effects of multiview depth video compression on multiview rendering”, Signal Processing: Image Communication, Jan. 2009, vol. 24, No. 1-2, p. 73-88, ISSN: 0923-5965 [online][search on Apr. 17, 20… [cited by applicant]
Merkle, Philipp, et al., “Mutli-View Plus Depth Represenatation and Coding”, Image Processing, 2007, ICIP 2007, IEEE International Conference on, IEEE, PI, Sep. 1, 2007, XP031157713, 4 pages. [cited by applicant]
Office Action dated Dec. 17, 2015, in Parrallel Taiwanese Patent Application No. 103137606, with English translation, 10 pages. [cited by applicant]
Office Action dated Jan. 5, 2016, in parallel Japanese Patent Application No. 2015-061416, with English translation, 9 pages. [cited by applicant]
Office Action dated May 13, 2015 issued in parallel U.S. Appl. No. 13/649,233, 20 pages. [cited by applicant]
Office Action dated Oct. 30, 2015, with English translation, from corresponding Taiwanese Patent Application No. 100112640, 14 pages. [cited by applicant]
Office Action issued in parallel Taiwanese Patent Application No. 104123545, dated Nov. 26, 2015, 7 pages. [cited by applicant]
Office Action issued in parallel U.S. Appl. No. 13/649,233 dated Dec. 22, 2015, 23 pages. [cited by applicant]
Office Action, dated May 31, 2016, in parallel Korean Patent Application No. 10-2012-7029634, with English translation, 15 pages. [cited by applicant]
Oh, Han, et al., “H.264-Based Depth Map Sequence Coding Using Motion Information of corresponding Tecture Video”, Proceedings of the PSIVT 2006, 2006, p. 898-907, [online], [search on Jun. 25, 2014], Internet, URL, http… [cited by applicant]
Quadtree-based adaptive loop filter, Toshiba Corporation; Telecommunication Standardization Sector; Jan. 2009. [cited by applicant]
Result of Consultation dated Nov. 12, 2015, from corresponding European Patent Application No. 11 714 653.0 4 pages. [cited by applicant]
Richardson, I.E.G., “H.264 and MPEG-4 Video Compression, video coding for next-generation multimedia, passage”, Jan. 1, 2003, H.264 and MPEG-4 Video Compression: Video Coding for Next Generation Multimedia, Hoboken, NJ:… [cited by applicant]
Richardson, I.E.G., “H264/MPEG-4, Part 10, White Paper-Prediction of Intra Macroblocks”, Internet Citation, Apr. 30, 2003, XP002281494, URL: http://www.vcodex.com/h264.html/h264_intraped.pdf, retrieved May 24, 2004, 6 p… [cited by applicant]
Santillana-Rivero, “Hierarchical Motion-Based Image Segmentation Applied to HDTV”, Proceedings of the Int'l Workshop on Signal Processing of HDTV; Amsterdam, Feb.-Mar. 1988, pp. 367-374. [cited by applicant]
Schwarz, H et al., “Tree-Structured Macroblock Partition”, ITU-Telecommunication Standardization Sector Study Group 16-Video Coding Experts Group (VCEG) 15th Meeting, Pattaya, Thailand., Dec. 2001, 1-6. [cited by applicant]
Sekiguchi S et al., “Results of CE on Seperate Prediciton Modes for 4:4:4 Coding (CE9)”, Joint Video Team (JVT) VCEG (Isoniec JTC1/SC291WG11 and SG16 0.6) 18th Meet Bang kok, TH., Jan. 2006, 28 Pages. [cited by applicant]
Sullivan, G et al. “New Standardized Extensions of MPEG4-A VC/H.264 for Professional-Quality Video Applications”, IEEE. ICIP 2007., Sep. 1, 2007, 4 Pages. [cited by applicant]
Text of ISO/IEC 14496 10 FCD Advanced Video Coding, 61, MPEG Meeting, Jul. 22-26, 2002, Klagenfurt, (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11, No. N4920, Aug. 11, 2002, XP030012343, ISSN: 0000-0365, 208 pag… [cited by applicant]
Extended European Search Report issued Aug. 23, 2016 in European Application 16173177.3. [cited by applicant]
Joeljung et al: Competition-Based Scheme for Motion Vector Selection and Coding, 29, VCEG Meeting; 77, MPEG Meeting: Jul. 17, 2006 Jul. 17, 2006; Klagenfurt, AT; (Video Coding Experts Group of ITU-T SG.16), No. VCEG-AC0… [cited by applicant]
Yang W et al: Efficient Motion Vector Coding Algorithms Based on Adaptive Template Matching 39. VCEG Meeting; Jan. 16, 2010-Jan. 22, 2010; Kyoto; (Video Coding Expertsgroup of ITU-T SG.16) URL: http://wftp3.itu.int/av.a… [cited by applicant]
Non-Final Office Action issued in parallel U.S. Appl. No. 13/649,233 dated May 13, 2016, 20 pages. [cited by applicant]
Office Action dated Feb. 24, 2016 in parallel U.S. Appl. No. 13/649,291, 24 pages. [cited by applicant]
Office Action dated Sep. 13, 2016 in parallel U.S. Appl. No. 13/649,251, 37 pages. [cited by applicant]
Office Action dated Sep. 14, 2016 in parallel U.S. Appl. No. 13/649,291, 46 pages. [cited by applicant]
Office Action issued Sep. 23, 2016 in U.S. Appl. No. 13/650,635. [cited by applicant]
Office Action mailed Nov. 3, 2016 in U.S. Appl. No. 15/197,189. [cited by applicant]
Notice of Allowance mailed Oct. 28, 2016 in U.S. Appl. No. 15/195,067. [cited by applicant]