IP Library › Granted Patent US 12,249,107
Granted Patent B2
US 12,249,107 · App. 18/201,013 · Granted Mar 11, 2025

Method and apparatus for encoding and decoding three-dimensional scenes in and from a data stream

Inventors: Julien Fleureau (Cesson-Sevigne, FR); Renaud Dore (Cesson-Sevigne, FR); Franck Thudor (Cesson-Sevigne, FR)
Assignee: InterDigital VC Holdings, Inc.
G06T9/001G06T3/40G06T17/20H04L65/70H04L65/75
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,249,107
App. No.
18/201,013
Granted
Mar 11, 2025
Kind
B2
Abstract

Methods and devices are provided to encode and decode a data stream carrying data representative of a three-dimensional scene, the data stream comprising color pictures packed in a color image; depth pictures packed in a depth image; and a set of patch data items comprising de-projection data; data for retrieving a color picture in the color image and geometry data. Two types of geometry data are possible. The first type of data describes how to retrieve a depth picture in the depth image. The second type of data comprises an identifier of a parametric function and a list of parameter values for the identified parametric function.

Claims (54)

1. A method comprising:

obtaining from a data stream:

a color patch atlas packing color pictures;

a depth patch atlas packing depth pictures corresponding to color patches of a given geometry type; and

metadata comprising, for each color patch of the color patch atlas:

de-projection data;

a color data comprising a description of a location of a color picture in the color image; and

an information indicating whether the color picture is of the given geometry type; and

if the information indicates that the color picture is of the given geometry type, a description of a location of a depth picture in the depth patch atlas; and

if the information indicates that the color picture is not of the given geometry type, a constant depth value; and

for each color patch of the given geometry type:

using de-projection data for de-projecting pixels of the color picture described by the color data at a depth value determined according to pixels of the corresponding depth patch in the depth atlas; and

for each other color patch:

using de-projection data for de-projecting pixels of the color picture described by the color data at the constant depth value in the associated metadata.

2. The method of claim 1 , wherein a color data further comprises a description of at least one of a size or of a shape of at least one color patch in the color patch atlas.

3. The method of claim 1 , wherein the data stream comprises a sequence of color patch atlases, a sequence of depth patch atlases and associated metadata, each depth patch atlas and related metadata being associated with a color patch atlas, wherein the color patch atlases are structured by temporal information.

4. A method comprising:

obtaining a set of color patches, and, for each color patch, an information indicating whether the color patch is of a given geometry type, and if so, an associated depth patch, and if not, an associated constant depth value;

generating a color patch atlas by packing the color patches in a color patch atlas and generating a color data comprising a description of a location of each color patch as packed in the color patch atlas;

generating a depth patch atlas by packing depth patches associated with color patches of the given geometry type and generating first metadata comprising a description of a location of the depth patch in the depth patch atlas; and generating second metadata comprising the associated constant depth value for other color patches; and

encoding in a data stream:

the generated color patch atlas;

the generated depth patch atlas; and

for each color patch, the information indicating whether the color picture is of the given geometry type, and, if so the first metadata, and if not, the second metadata.

5. The method of claim 4 , wherein a color data further comprises a description of at least one of a size or of a shape of at least one color patch in the color patch atlas.

6. The method of claim 4 , wherein the data stream comprises a sequence of color patch atlases, a sequence of depth patch atlases and associated metadata, each depth patch atlas and related metadata being associated with a color patch atlas, wherein the color patch atlases are structured by temporal information.

7. A device comprising electronic circuitry adapted for:

obtaining from a data stream:

a color patch atlas packing color pictures;

a depth patch atlas packing depth pictures corresponding to color patches of a given geometry type; and

metadata comprising, for each color patch of the color patch atlas:

de-projection data;

a color data comprising a description of a location of a color picture in the color image; and

an information indicating whether the color picture is of the given geometry type; and

if the information indicates that the color picture is of the given geometry type, a description of a location of a depth picture in the depth patch atlas; and

if the information indicates that the color picture is not of the given geometry type, a constant depth value; and

for each color patch of the given geometry type:

using de-projection data for de-projecting pixels of the color picture described by the color data at a depth value determined according to pixels of the corresponding depth patch in the depth atlas; and

for each other color patch:

using de-projection data for de-projecting pixels of the color picture described by the color data at the constant depth value in the associated metadata.

8. The device of claim 7 , wherein a color data further comprises a description of at least one of a size or of a shape of at least one color patch in the color patch atlas.

9. The device of claim 7 , wherein the data stream comprises a sequence of color patch atlases, a sequence of depth patch atlases and associated metadata, each depth patch atlas and related metadata being associated with a color patch atlas, wherein the color patch atlases are structured by temporal information.

10. A device comprising electronic circuitry adapted for:

obtaining a set of color patches, and, for each color patch, an information indicating whether the color patch is of a given geometry type, and if so, an associated depth patch, and if not, an associated constant depth value;

generating a color patch atlas by packing the color patches in a color patch atlas and generating a color data comprising a description of a location of each color patch as packed in the color patch atlas;

generating a depth patch atlas by packing depth patches associated with color patches of the given geometry type and generating first metadata comprising a description of a location of the depth patch in the depth patch atlas; and generating second metadata comprising the associated constant depth value for other color patches; and

encoding in a data stream:

the generated color patch atlas;

the generated depth patch atlas; and

for each color patch, the information indicating whether the color picture is of the given geometry type, and, if so the first metadata, and if not, the second metadata.

11. The device of claim 10 , wherein a color data further comprises a description of at least one of a size or of a shape of at least one color patch in the color patch atlas.

12. The device of claim 10 , wherein the data stream comprises a sequence of color patch atlases, a sequence of depth patch atlases and associated metadata, each depth patch atlas and related metadata being associated with a color patch atlas, wherein the color patch atlases are structured by temporal information.

13. A non-transitory computer readable medium having stored instructions which, when executed by one or more processors, cause the one or more processors to carry out the method of claim 1 .

14. A non-transitory computer readable medium having stored instructions which, when executed by one or more processors, cause the one or more processors to carry out the method of claim 4 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 11, 2023
From: FLEUREAU, JULIEN; DORE, RENAUD; THUDOR, FRANCK
To: INTERDIGITAL VC HOLDINGS, INC.
Reel/Frame 065532/0878 →
Priority Claims (1)
EP 18305043 · Jan 19, 2018 · regional
Continuity (2)
Continuation 16962393
Related Publication 20230351641A1 · Nov 2, 2023
References Cited (39)
US 5379371A · Usami et al. · 1995 [cited by applicant]
US 8854366B1 · Simkins, Jr. et al. · 2014 [cited by applicant]
US 11375235B2 · Fleureau et al. · 2022 [cited by applicant]
US 11790562B2 · Fleureau · 2023 [cited by examiner]
US 20080143714A1 · Huang et al. · 2008 [cited by applicant]
US 20110175911A1 · Loop et al. · 2011 [cited by applicant]
US 20110286530A1 · Tian et al. · 2011 [cited by applicant]
US 20130107010A1 · Hoiem et al. · 2013 [cited by applicant]
US 20140063024A1 · Zhang et al. · 2014 [cited by applicant]
US 20140092439A1 · Krig · 2014 [cited by examiner]
US 20140313290A1 · Tech et al. · 2014 [cited by applicant]
US 20150245063A1 · Rusanovskyy et al. · 2015 [cited by applicant]
US 20150279098A1 · Kim et al. · 2015 [cited by applicant]
US 20160035324A1 · Morphet · 2016 [cited by applicant]
US 20170163980A1 · Hirabayashi et al. · 2017 [cited by applicant]
US 20170347055A1 · Dore et al. · 2017 [cited by applicant]
US 20180053324A1 · Cohen et al. · 2018 [cited by applicant]
US 20180225871A1 · Suresh et al. · 2018 [cited by applicant]
US 20180350134A1 · Lodato et al. · 2018 [cited by applicant]
US 20190042832A1 · Venshtain · 2019 [cited by applicant]
US 20190045157A1 · Venshtain et al. · 2019 [cited by applicant]
US 20190058857A1 · Bishop et al. · 2019 [cited by applicant]
US 20190087979A1 · Mammou et al. · 2019 [cited by applicant]
US 20190114815A1 · Erhard · 2019 [cited by applicant]
US 20190156520A1 · Mammou et al. · 2019 [cited by applicant]
US 20190313081A1 · Oh · 2019 [cited by applicant]
US 20200013168A1 · Seshita et al. · 2020 [cited by applicant]
US 20200228836A1 · Schwarz et al. · 2020 [cited by applicant]
US 20200344493A1 · Fleureau et al. · 2020 [cited by applicant]
CN 102982560A · 2013 [cited by applicant]
CN 106570934A · 2017 [cited by applicant]
CN 107074259A · 2017 [cited by applicant]
CN 111742548A · 2020 [cited by applicant]
EP 3249922A1 · 2017 [cited by applicant]
WO 2016003340A1 · 2016 [cited by applicant]
Anderson, et al., “Depth Buffer Compression for Stochastic Motion Blur Rasterization”, High Performance Graphics, Vancouver, British Columbia, Canada, Aug. 5, 2011, pp. 127-134. [cited by applicant]
Jylanki, Jukka , “A Thousand Ways to Pack the Bin—A Practical Approach to Two-Dimensional Rectangle Bin Packing”, Available at <https://core.ac.uk/display/103387426>, Feb. 27, 2010, 50 pages. [cited by applicant]
Liu, et al., “Three-Dimensional Point-Cloud Plus Patches: Towards Model-Based Image Coding in the Cloud”, IEEE International Conference on Multimedia Big Data, Beijing, China, Apr. 20, 2015, pp. 395-400. [cited by applicant]
Quek, et al., “Comparison of Bicubic and Bezier Polynomials for Surface Parameterization in Volumetric Images”, Third IEEE Symposium on BioInformatics and BioEngineering, Bethesda, Maryland, USA, Mar. 12, 2003, 8 pages. [cited by applicant]