IP Library › Granted Patent US 12,524,920
Granted Patent B2
US 12,524,920 · App. 18/725,692 · Granted Jan 13, 2026

Method for encoding 3D content represented by dynamic mesh, method for decoding coded mesh bitstream of dynamic mesh representing 3D content, and system

Inventors: Vladyslav Zakharchenko (Palo Alto, CA); Yue Yu (Palo Alto, CA); Haoping Yu (Palo Alto, CA)
Assignee: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.
G06T9/001G06T9/20G06T17/20G06T17/205G06T2210/36G06T2210/56
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,524,920
App. No.
18/725,692
Filed
Jun 28, 2024
Granted
Jan 13, 2026
Kind
B2
Art Unit
2487
USPC
375/240.09
Abstract

A method for encoding three-dimensional (3D) content represented by a dynamic mesh includes: converting geometry information from a list of vertices of the dynamic mesh to a sequence of geometry component images; encoding the sequence of geometry component images of the dynamic mesh using a video encoder to generate a geometry component bitstream; decoding the geometry component bitstream to generate reconstructed geometry component images; determining a face to be removed from connectivity component images of the dynamic mesh, the face containing a vertex in the reconstructed geometry component images; updating the connectivity component images of the dynamic mesh by removing the face from the connectivity component images; encoding the updated connectivity component images to generate a connectivity component bitstream; updating, based on updating the connectivity component images, attribute component images and mapping component images of the dynamic mesh; encoding the updated attribute component images to generate an attribute component bitstream.

Claims (43)

1 . A method for decoding a coded mesh bitstream of a dynamic mesh representing three-dimensional (3D) content, the method comprising:

reconstructing geometry information of the dynamic mesh from a geometry component bitstream in the coded mesh bitstream, the reconstructed geometry information comprising data specifying a plurality of vertices of the dynamic mesh;

reconstructing connectivity information of the dynamic mesh from a connectivity component bitstream in the coded mesh bitstream, the reconstructed connectivity information comprising data specifying a plurality of faces of the dynamic mesh;

refining the reconstructed connectivity information based on the reconstructed geometry information to generate refined connectivity information by at least dividing a face out of the plurality of faces specified by the reconstructed connectivity information into two faces based on a vertex of the plurality of vertices specified in the reconstructed geometry information;

reconstructing mapping information of the dynamic mesh from a mapping component bitstream in the coded mesh bitstream, the reconstructed mapping information comprising data specifying a list of vertex attribute coordinates in an attribute image;

refining the reconstructed mapping information based on the reconstructed geometry information to generate refined mapping information;

reconstructing the dynamic mesh based on the reconstructed geometry information, the refined connectivity information, and the refined mapping information; and

causing the reconstructed dynamic mesh to be rendered for display.

2 . The method of claim 1 , wherein refining the reconstructed connectivity information based on the reconstructed geometry information comprises:

identifying a vertex of the plurality of vertices that is located inside a face of the plurality of faces;

determining a projected vertex of the vertex on an edge of the face; and

dividing the face into two refined faces, each refined face has the projected vertex as one vertex.

3 . The method of claim 2 , wherein determining the projected vertex of the vertex comprises:

determining a nearest edge for the vertex among edges of the face, wherein a distance between the vertex to the nearest edge is smaller than another distance between the vertex to another edge of the edges of the face; and

determining the projected vertex as an intersection of a line with the nearest edge, the line passing through the vertex and an opposite vertex of the face that does not belong to the nearest edge.

4 . The method of claim 2 , wherein refining the reconstructed mapping information comprises:

determining a transformation based on the vertex and the projected vertex; and

applying the transformation to vertex attribute coordinates in the list of the vertex attribute coordinates that correspond to the vertex.

5 . The method of claim 4 , wherein the transformation comprises an affine transformation.

6 . The method of claim 2 , wherein each of the two refined faces have a same orientation as the face.

7 . The method of claim 1 , wherein refining the reconstructed connectivity information based on the reconstructed geometry information to generate refined connectivity information comprises dividing a face out of the plurality of faces specified by the reconstructed connectivity information into two faces based on a vertex of the plurality of vertices specified in the reconstructed geometry information.

8 . A system comprising:

a processor; and

a non-transitory computer-readable medium communicatively coupled to the processor, wherein the processor is configured to execute program code stored in the non-transitory computer-readable medium and thereby perform operations comprising:

reconstructing geometry information of a dynamic mesh from a geometry component bitstream in a coded mesh bitstream of the dynamic mesh, the reconstructed geometry information comprising data specifying a plurality of vertices of the dynamic mesh;

reconstructing connectivity information of the dynamic mesh from a connectivity component bitstream in the coded mesh bitstream, the reconstructed connectivity information comprising data specifying a plurality of faces of the dynamic mesh;

refining the reconstructed connectivity information based on the reconstructed geometry information to generate refined connectivity information by at least dividing a face out of the plurality of faces specified by the reconstructed connectivity information into two faces based on a vertex of the plurality of vertices specified in the reconstructed geometry information;

reconstructing mapping information of the dynamic mesh from a mapping component bitstream in the coded mesh bitstream, the reconstructed mapping information comprising data specifying a list of vertex attribute coordinates in an attribute image;

refining the reconstructed mapping information based on the reconstructed geometry information to generate refined mapping information;

reconstructing the dynamic mesh based on the reconstructed geometry information, the refined connectivity information, and the refined mapping information; and

causing the reconstructed dynamic mesh to be rendered for display.

9 . The system of claim 8 , wherein refining the reconstructed connectivity information based on the reconstructed geometry information comprises:

identifying the vertex of the plurality of vertices that is located inside the face of the plurality of faces;

determining a projected vertex of the identified vertex on an edge of the face; and

dividing the face into two refined faces, each refined face has the projected vertex as one vertex.

10 . The system of claim 9 , wherein determining the projected vertex of the vertex comprises:

determining a nearest edge for the vertex among edges of the face, wherein a distance between the vertex to the nearest edge is smaller than another distance between the vertex to another edge of the edges of the face; and

determining the projected vertex as an intersection of a line with the nearest edge, the line passing through the vertex and an opposite vertex of the face that does not belong to the nearest edge.

11 . The system of claim 9 , wherein refining the reconstructed mapping information comprises:

determining a transformation based on the vertex and the projected vertex; and

applying the transformation to vertex attribute coordinates in the list of the vertex attribute coordinates that correspond to the vertex.

12 . The system of claim 11 , wherein the transformation comprises an affine transformation.

13 . The system of claim 9 , wherein each of the two refined faces have a same orientation as the face.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 28, 2024
From: ZAKHARCHENKO, VLADYSLAV; YU, YUE; YU, HAOPING
To: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.
Reel/Frame 067876/0552 →
Continuity (4)
Provisional Application 63295138 · Dec 30, 2021
Provisional Application 63266176 · Dec 29, 2021
Provisional Application 63266175 · Dec 29, 2021
Related Publication 20250131600A1 · Apr 24, 2025
References Cited (25)
US 6262737B1 · Li · 2001 [cited by applicant]
US 12315081B2 · Graziosi · 2025 [cited by examiner]
US 20070194975A1 · Jang et al. · 2007 [cited by applicant]
US 20120262444A1 · Stefanoski et al. · 2012 [cited by applicant]
US 20130114910A1 · Mammou · 2013 [cited by applicant]
US 20200286261A1 · Faramarzi et al. · 2020 [cited by applicant]
US 20210090301A1 · Mammou et al. · 2021 [cited by applicant]
US 20220164994A1 · Joshi · 2022 [cited by examiner]
ISO/IEC 23090-5:2021 Information technology—Coded representation of immersive media—Part 5: Visual volumetric videobased coding (V3C) and video-based point cloud compression (VPCC), dated Jun. 2021. 338 pages. [cited by applicant]
Crowle et al. Dynamic Adaptive Mesh Streaming for Real-time 3D Teleimmersion. Jun. 18, 2015 (Jun. 18, 2015). [retrieved on Mar. 3, 2023]. Retrieved from the Internet: <URL: https://dlacm.org/doi/pdf/10.1145/2775292.2775… [cited by applicant]
Pourazad et al. An H.264-based video encoding scheme for 3D TV. Sep. 4, 2006 (Sep. 4, 2006). [retrieved on Mar. 3, 2023]. Retrieved from the Internet: <URL: https://ieeexplore.ieee.org/document/7071544>. 5 pages. [cited by applicant]
Graziosi.Video-based dynamic mesh coding.*2021 EEE International Conference on Image Processing (ICIP). IEEE,2021. Sep. 22, 2021 (Sep. 22, 2021) Retrieved on Apr. 14, 2023 (Apr. 11, 2023) from <https://ieeexplore. ieee.… [cited by applicant]
Schwarz et al. “Emerging MPEG standards for point cloud compression.” IEEE Journal on Emerging and Selected Topics in Circuits and Systems 9.1 (2019):133-148. Retrieved on Apr. 11, 2023(Apr. 11, 2023) from <https:/fieee… [cited by applicant]
Jasak et al. “Dynamic mesh handling in OpenFOAM applied to fluid-structure interactionsimulations.” Proceedings of the V European Conference on Computational Fluid Dynamics ECCOMAS CFD 2010.2010. Retrieved on Apr. 11, 2… [cited by applicant]
Lengyel. “Compression of time-dependent geometry.” Proceedings of the 1999 symposium on Interactive 3D graphics. 1999. Retrieved on Apr. 11, 2023 (Apr. 11, 2023) from <https://dl. acm. org/doi/pdf/10.1145/300523.300533>… [cited by applicant]
Pan et al. “Deep mesh reconstruction from single rgb images via topology modification networks.” Proceedings of the IEEE/CVF International Conference on Computer Vision.2019. Retrieved on Apr. 11, 2023(Apr. 11, 2023) fr… [cited by applicant]
Peng et al. Technologies for 3D mesh compression: A survey. Apr. 16, 2005(Apr. 16, 2005). [ retrieved on Mar. 3, 2023]. Retrieved from the Internet: <URL: http://mcl. usc. edu/wp-content/uploads/2014/01/200503-Technolog… [cited by applicant]
E. Faramarzi, R. Joshi and M. Budagavi, “Mesh Coding Extensions to MPEG-I V-PCC,” 2020 IEEE 22nd International Workshop on Multimedia Signal Processing (MMSP), 2020, pp. 1-5, doi: 10.1109/MMSP48831.2020.9287057. 5 pages. [cited by applicant]
J. Rossignac, “Edgebreaker: connectivity compression for triangle meshes,” in IEEE Transactions on Visualization and Computer Graphics, vol. 5, No. 1, pp. 47-61, Jan.-Mar. 1999, doi: 10.1109/2945.764870. 15 pages. [cited by applicant]
Mamou, Khaled & Zaharia, Titus & Prêteux, Françoise. (2009). TFAN: A low complexity 3D mesh compression algorithm. Journal of Visualization and Computer Animation. 20. 343-354. 10.1002/cav.319. 12 pages. [cited by applicant]
Rowenhorst, D & Rollett, A.D. & Rohrer, G & Groeber, M & Jackson, M & Konijnenberg, Peter & Graef, M.. (2015). Consistent representations of and conversions between 3D rotations. Modelling and Simulation in Materials Sc… [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/082494, Mar. 30, 2023. 14 pages. [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/082500, Jun. 28, 2023. 21pages. [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/082498, May 30, 2023. 21 pages. [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/082497, Mar. 29, 2023. 14 pages. [cited by applicant]
Cited By (1)
US 12,718,418