# US 2025/0148648 A1 · A method and an apparatus for encoding/decoding a textured mesh

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0148648 A1
- Document ID: US20250148648A1
- Status: Published application
- Kind: A1
- Application number: 18/835,424
- Filed: 2023-01-30
- Published: 2025-05-08
- Earliest claimed: 2022-02-03
- Assignees: InterDigital CE Patent Holdings, SAS
- Applicants: InterDigital CE Patent Holdings, SAS
- Inventors: Jean-Eudes Marvie; Celine Guede; Maja Krivokuca; Olivier Mocquard
- Web page: https://patentgrep.com/patent/US20250148648A1

## CPC

- G06T 9/001: {Model-based coding, e.g. wire frame}
- G06T 7/10: Segmentation; Edge detection (motion-based segmentation G06T7/215)
- H04N 19/597: specially adapted for multi-view video sequence encoding
- G06T 2207/20021: Dividing image into blocks, subimages or windows
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Methods and apparatuses for encoding or decoding animated textured meshes are provided wherein a texture map is encoded that comprises a regular grid of tiles, wherein each tile comprises texture data associated to a patch projected onto the tile, said patch belonging to partitioning of a surface of the texture mesh. According to an embodiment, the partitioning of the surface of the textured mesh is obtained by subdividing the surface of the mesh into a set of regular patches. According to an embodiment, encoding the texture map comprises arranging the tiles of the texture map based on an inter-tile transition cost. According to another embodiment, encoding the texture map comprises arranging the tiles of the texture map based on a distortion cost between the texture map of a reference frame and the texture map of the current frame.

## Claims

### Claim 1

A method comprising:
obtaining a partitioning of a surface of a textured mesh by subdividing the surface of the mesh into a set of patches, the patches having approximately equal area and size, and
encoding a texture map comprising a regular grid of tiles, wherein each tile comprises texture data associated to a patch of the set projected onto the tile.

### Claim 2

An apparatus comprising one or more processors configured to:
obtain a partitioning of a surface of a textured mesh by subdividing the surface of the mesh into a set of patches, the patches having approximately equal area and size, and
encode a texture map comprising a regular grid of tiles, wherein each tile comprises texture data associated to a patch of the set projected onto the tile.

### Claim 3 (depends on 1)

The method of claim 1 further comprising obtaining UV coordinates on the regular grid of tiles for at least one patch of the textured mesh.

### Claim 4 (depends on 3)

The method of claim 3, wherein the texture map is obtained by projecting an input texture map on the regular grid of tiles using input UV coordinates of vertices of the textured mesh and the obtained UV coordinates.

### Claim 5 (depends on 1)

The method of claim 1, wherein a patch is a sub-mesh of the mesh.

### Claim 6 (depends on 1)

The method of claim 1, wherein the patches have a same shape and/or size.

### Claim at position 7

7-8. (canceled)

### Claim 9 (depends on 1)

The method of claim 1, wherein obtaining the partitioning includes:
selecting a set of faces on the surface that maximizes an inter-face distance between faces of the set, and
allocating, each other face of the mesh, to a face of the set that is nearest from the other face.

### Claim 10 (depends on 3)

The method of claim 3, wherein obtaining UV coordinates comprises obtaining UV coordinates for each vertex of the mesh that belongs to the at least one patch.

### Claim 11 (depends on 3)

The method claim 3, wherein obtaining UV coordinates comprises arranging the at least one patch in a coordinate system that comprises all the patches of the partitioning.

### Claim 12

(canceled)

### Claim 13 (depends on 3)

The method claim 3, wherein tiles are spaced by a given number of pixels on the grid.

### Claim 14 (depends on 4)

The method claim 4, further comprises, for at least one patch, dilating texture data associated to the at least one patch, in the texture map by a given number of pixels.

### Claim 15

(canceled)

### Claim 16 (depends on 3)

The method of claim 3, further comprising arranging the tiles of the texture map based on an inter-tile transitions cost.

### Claim 17 (depends on 16)

The method of claim 16 further comprising updating the obtained UV coordinates based on the arrangement of the tiles.

### Claim 18

(canceled)

### Claim 19 (depends on 1)

The method of claim 1, wherein the method further comprises arranging tiles of the texture map based on a distortion cost between at least one tile of the texture map and at least one tile of a reference texture map.

### Claim 20 (depends on 19)

The method of claim 19 further comprising updating UV coordinates based on the arrangement of the tiles of the texture map.

### Claim 21 (depends on 19)

The method of claim 19 further comprising storing an information for updating UV coordinates based on the arrangement of the tiles of the texture map.

### Claim at position 21

22-23. (canceled)

### Claim 24

A method comprising decoding a texture map comprising a regular grid of tiles, wherein each tile comprises texture data associated to a patch projected onto the tile, wherein the patch belongs to a set of patches from a partitioning of a surface of a textured mesh, and wherein the patches have approximately equal area and size.

### Claim 25

An apparatus comprising one or more processors configured to decode a texture map comprising a regular grid of tiles, wherein each tile comprises texture data associated to a patch projected onto the tile, wherein the patch belongs to a set of patches from a partitioning of a surface of a textured mesh, and wherein the patches have approximately equal area and size.

### Claim at position 24

26-33. (canceled)

### Claim 34 (depends on 1)

A computer readable storage medium having stored thereon instructions for causing one or more processors to perform the method of claim 1.

### Claim 35 (depends on 25)

The apparatus according to claim 25, and at least one of (i) an antenna configured to receive a signal, the signal including data representative of at least one part of a textured mesh, (ii) a band limiter configured to limit the received signal to a band of frequencies that includes the data representative of the at least one part of the textured mesh, or (iii) a display configured to display at least one part of a three dimensional (3D) object reconstructed from signal.

### Claim 36 (depends on 35)

The apparatus according to claim 35, comprising a television (TV), a cell phone, a tablet or a set top box.

### Claim 37

A computer readable storage medium having stored thereon a bitstream comprising coded video data representative of a texture map comprising a regular grid of tiles, wherein each tile comprises texture data associated to a patch projected onto the tile, wherein the patch belongs to a set patches from a partitioning of a surface of a textured mesh, and wherein the patches have approximately equal area and size.

### Claim 38

(canceled)

### Claim 39 (depends on 37)

The computer readable storage medium of claim 37, further comprising at least one of:
coded data representative of UV coordinates on the regular grid of tiles for at least one patch an information for updating UV coordinates on the regular grid of tiles obtained for at least one patch of the textured mesh,
data representative of a topology of the textured mesh, and
data representative of vertices positions of the textured mesh.

### Claim at position 31

40-41. (canceled)

### Claim 42 (depends on 2)

The apparatus of claim 2, wherein the one or more processors being configured to obtain the partitioning comprises the one or more processors being configured to:
select a set of faces on the surface that maximizes an inter-face distance between faces of the set, and
allocate, each other face of the mesh, to a face of the set that is nearest from the other face.

### Claim 43 (depends on 2)

The apparatus of claim 2, wherein the one or more processors are further configured for arranging the tiles of the texture map based on an inter-tile transitions cost.

### Claim 44 (depends on 2)

The apparatus of claim 2, wherein the one or more processors are further configured for arranging tiles of the texture map based on a distortion cost between at least one tile of the texture map and at least one tile of a reference texture map.
