IP Library › Patent Application 18690052
Patent Application
App. No. 18/690,052

METHOD FOR DECODING 3D CONTENT, ENCODER, AND DECODER

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 None
App. No.
18/690,052
Abstract

A method for coding three-dimensional (3D) content includes: extracting a video frame from a video, where the video frame includes connectivity information associated with the 3D content; and reconstructing the 3D content based on the connectivity information, where the connectivity information includes: segments representing the 3D content; and sorted faces and vertex indices within each segment.

Claims (38)

1 - 8 . (canceled)

9 . An encoder for encoding three-dimensional (3D) content comprising:

at least one processor; and

a memory storing instructions that, when executed by the at least one processor, cause the encoder to perform:

segmenting a mesh representative of the 3D content into segments;

processing each segment to sort faces and vertex indices within each segment;

generating a connectivity information frame for each processed segment; and

encoding the connectivity information frames based on a video codec.

10 . The encoder of claim 9 , wherein the mesh representative of the 3D content is segmented based on objects, regions of interest, volumetric tiles, or semantic blocks associated with the 3D content.

11 . The encoder of claim 9 , wherein generating the connectivity information frame comprises:

transforming one-dimensional (1D) connectivity components associated with each processed segment to two-dimensional (2D) connectivity coding sample arrays.

12 . The encoder of claim 9 , wherein the faces are sorted in an ascending order and, for each face, the vertex indices are sorted in descending order.

13 . The encoder of claim 9 , wherein the vertex indices are sorted by rotating the faces, wherein valid rotations of the faces preserve normals of the faces.

14 . The encoder of claim 9 , wherein the connectivity information frames are divided into block and the blocks are divided into connectivity coding units (CCUs).

15 . A decoder for decoding three-dimensional (3D) content comprising:

at least one processor; and

a memory storing instructions that, when executed by the at least one processor, cause the decoder to perform:

extracting a video frame from a video, wherein the video frame includes connectivity information associated with the 3D content; and

reconstructing the 3D content based on the connectivity information, wherein the connectivity information comprises:

segments representing the 3D content; and

sorted faces and vertex indices within each segment.

16 . The decoder of claim 15 , wherein the 3D content comprises a mesh segmented based on objects, regions of interest, volumetric tiles, or semantic blocks associated with the 3D content.

17 . The decoder of claim 15 , wherein the connectivity information comprises two-dimensional (2D) connectivity coding sample arrays based on one-dimensional (1D) components of mesh frames associated with the 3D content.

18 . The decoder of claim 15 , wherein the faces are sorted in an ascending order and, for each face, the vertex indices are sorted in a descending order.

19 . The decoder of claim 15 , wherein the vertex indices are sorted based on rotations of the faces, wherein valid rotations of the faces preserve normals of the faces.

20 . The decoder of claim 15 , wherein the connectivity information are in connectivity information frames, the connectivity information frames divided into blocks, the blocks divided into connectivity coding units (CCUs).

21 . A method for decoding three-dimensional (3D) content comprising:

extracting a video frame from a video, wherein the video frame includes connectivity information associated with the 3D content; and

reconstructing the 3D content based on the connectivity information, wherein the connectivity information comprises:

segments representing the 3D content; and

sorted faces and vertex indices within each segment.

22 . The method of claim 21 , wherein the 3D content comprises a mesh segmented based on objects, regions of interest, volumetric tiles, or semantic blocks associated with the 3D content.

23 . The method of claim 21 , wherein the connectivity information comprises two-dimensional (2D) connectivity coding sample arrays based on one-dimensional (1D) components of mesh frames associated with the 3D content.

24 . The method of claim 21 , wherein the faces are sorted in an ascending order and, for each face, the vertex indices are sorted in a descending order.

25 . The method of claim 21 , wherein the vertex indices are sorted based on rotations of the faces, wherein valid rotations of the faces preserve normals of the faces.

26 . The method of claim 21 , wherein the connectivity information are in connectivity information frames, the connectivity information frames divided into blocks, the blocks divided into connectivity coding units (CCUs).

27 . The method of claim 26 , wherein the connectivity information frames comprise connectivity coding samples representing a differential value between a first face vertex index and a second face vertex index of connectivity information.

28 . The method of claim 26 , wherein the connectivity information frames are decoded based on based on a video codec, the video codec indicated in a sequence parameter set, a picture parameter set, or a supplemental enhancement information associated with the decoded connectivity information frames.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 3, 2024
From: INNOPEAK TECHNOLOGY, INC.
To: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.
Reel/Frame 066994/0119 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 8, 2024
From: ZAKHARCHENKO, VLADYSLAV; YU, HAOPING; YU, YUE
To: INNOPEAK TECHNOLOGY, INC.
Reel/Frame 066694/0649 →