Tencent America LLC

University of California

Apple Inc.

Omnivision Technologies, Inc.

Xiang Zhang

Shan Liu

Wen Gao

Xiaozhong Xu

Chao Huang

Jun Tian

Sehoon Yea

Weiwei Feng

Bing Jian

Yuan Wang

Thuong Nguyen Canh

Lu He

Haichao Zhu

Kelin Liu

Brett W Degner

Paul Xiaopeng Wang

Dinesh C Mathew

Keith J Hendren

Christopher R Wilk

Michael D McBroom

David H Narajowski

Bradley Joseph Hamel

Nicholas Alan Rundle

Simon S Lee

Laura M DeForest

Daniel K Boothe

Hao Zhu

Kristopher P Laurent

Sadao Ota

Edward T Sweet

Peter N Jeziorek

Karen Y Cheng

Danny L McBroom

Lauren M Farrell

Rebecca J Mikolajczyk

Stuart M Nevill

Sunita Venkatesh

Chanjuan Feng

Thomas H Tsang

Ming Liu

Ren-min Ma

David A Jungquist

Stephan Wenger

Seong Yeol Mun

Jonathan A Ellman

Cheng Sun

Haim Suchowski

Fanqing Frank Chen

Heesoo Kang

Xiaobo Yin

Michael Mrejen

Xingjie Ni

Tongcang Li

Rupert Francis Maximillian Oulton

Volker Jendrik Sorger

Qi-Huo Wei

Kai-Hang Su

Chihhui Wu

Jeongmin Kim

Ren-Min Ma

Yang Xia

Hamed Dalir

Anique Akhtar

A method of encoding includes receiving a polygon mesh comprising a plurality of original vertices. The method further includes deriving an initial base mesh from the polygon mesh, the initial base mesh including a first set of base mesh vertices. The method further includes performing a symmetrize process on the initial base mesh to generate a symmetrical base mesh that includes a first side having the first set of base mesh vertices and a second side having a second set of base mesh vertices, each base mesh vertex in the first set of base mesh vertices having a corresponding symmetric vertex in the second set of base mesh vertices. The method further includes determining a first displacement between each original vertex in the polygon mesh located on the second side of the symmetrical base mesh and a nearest vertex included in the second set of base mesh vertices.

Base mesh coding by using surface reflection symmetry

A method performed by at least one processor in a decoder includes receiving a coded video bitstream that includes a compressed two dimensional (2D) mesh corresponding to a surface of three dimensional (3D) volumetric object. The method further includes predicting a current vertex included in the compressed 2D mesh based on an interpolation-based hierarchical prediction scheme that uses at least one sampled vertex included in the compressed 2D mesh. The method further includes deriving a prediction residual associated with the predicted current vertex. The method further includes reconstructing a boundary vertex associated with the 3D volumetric object based on the predicted current vertex and the derived prediction residual.

Coding of boundary UV2XYZ index for mesh compression

In some examples, an apparatus for mesh coding includes processing circuitry. The processing circuitry receives a data structure for a mesh frame with polygons representing a surface of an object. The data structure for the mesh frame includes a UV atlas that associates vertices of the mesh frame to UV coordinates in the UV atlas. The processing circuitry determines respective sampling rates for regions of the mesh frame according to respective characteristics of the regions of the mesh frame and applies, on the UV atlas, the respective sampling rates for the regions of the mesh frame to determine sampling positions on the UV atlas. The processing circuitry generates one or more sampled two dimensional (2D) maps for the mesh frame according to the sampling positions on the UV atlas, and encodes the one or more sampled 2D maps into a bitstream.

Method and apparatus of adaptive sampling for mesh compression by encoders

Method, apparatus, and system for parallel dynamic mesh alignment are provided. The process may include determining that a temporal alignment is present between one or more frames in a received input mesh including a plurality of polygons that describe a surface of a volumetric object, then, determining an intra-frame alignment scheme to spatially align charts within a frame. The process may also include applying the intra-frame alignment scheme to one or more corresponding charts in the one or more frames for inter-frame alignment; and processing the one or more frames in parallel based on the intra-frame alignment scheme and inter-frame alignment.

Parallel approach to dynamic mesh alignment

A plurality of neighboring vertices of a current vertex in a current frame of a mesh is determined. The current frame corresponds to the mesh at a first time instance. Each of the plurality of neighboring vertices is connected to the current vertex through a respective edge in the mesh. A plurality of neighboring estimation errors of the plurality of neighboring vertices is determined. Each of the plurality of neighboring estimation errors indicates a difference between a reference vertex of a corresponding one of the plurality of neighboring vertices in a reference frame and the corresponding one of the plurality of neighboring vertices in the current frame. The reference frame corresponds to the mesh at a second time instance. A prediction residue of the current vertex is determined based on the plurality of neighboring estimation errors. Prediction information of the current vertex is generated based on the determined prediction residue.

Temporal prediction based vertex position compression

Aspects of the disclosure provide methods and apparatuses for mesh coding. In some examples, an apparatus for mesh coding includes processing circuitry. The processing circuitry receives a bitstream carrying a 3D mesh frame. The 3D mesh frame represents a surface of an object with polygons, the polygons are defined by vertices and edges connecting the vertices, the 3D mesh frame is parameterized into a plurality of 2D charts in a 2D UV atlas. The processing circuitry determines respective chart based coding modes for the plurality of 2D charts according to one or more indices decoded from the bitstream, and decodes, from the bitstream, at least respective geometry information associated with the plurality of 2D charts according to the respective chart based coding modes. The processing circuitry reconstructs the 3D mesh frame according to the respective geometry information associated with the plurality of 2D charts.

Method and apparatus for chart based mesh compression

Method, apparatus, and system for atlas sampling-based dynamic mesh compression are provided. The process may include receiving a mesh frame with polygons representing a surface of an object; determining that the mesh frame is associated with an irregular UV chart in response to one or more singularity components in the mesh frame; performing boundary detection to the UV chart to identify one or more boundary loops in the UV chart; and compressing information of the identified one or more boundary loops into a bitstream.

Atlas sampling based mesh compression with charts of general topology

A method, computer program, and computer system is provided for point cloud coding. The method includes receiving, from a bitstream, data corresponding to a point cloud; obtaining from the data a first prediction residual of a first component from among a plurality of components of an attribute associated with the point cloud; reconstructing the first prediction residual; determining a predicted second prediction residual based on the reconstructed first prediction residual and at least one model parameter; obtaining a second prediction residual of a second component from among the plurality of components based on the predicted second prediction residual; reconstructing the second prediction residual; and decoding the data corresponding to the point cloud based on the reconstructed first prediction residual and the reconstructed second prediction residual.

Coding of multiple-component attributes for point cloud coding

There is includes a method and apparatus comprising computer code configured to cause a processor or processors to perform obtaining volumetric data of at least one three-dimensional (3D) visual content, obtaining a plurality of 3D meshes from the volumetric data, projecting vertices of the plurality of 3D meshes onto a plurality of two-dimensional (2D) meshes, signaling connectivity information of the plurality of 3D meshes based on the plurality of 2D meshes, wherein the signaling the connectivity information comprises signaling whether ones of pixels of a 2D occupancy map is to be inferred or explicitly signaled.

Vertex prediction based on mesh triangulation derivation

A method and apparatus that receives a coded video bitstream from an encoder; retrieves, from the coded video bitstream, a mesh including a plurality of polygons that describe one or more surfaces of a volumetric object; predicts a current value of an index of the UV-to-XYZ index array from at least one previously coded value included in another index in the UV-to-XYZ index array, wherein the UV-to-XYZ index array includes a plurality of indices which correspond each two-dimensional (2D) UV vertex associated with the mesh to a three-dimensional (3D) XYZ vertex associated with the mesh; derives a prediction residual associated with the current value of the index of the UV-to-XYZ index array; and reconstructs a boundary UV coordinate based on the predicted current value of the index of the UV-to-XYZ index array and the derived prediction residual.

Predictive coding of boundary UV2XYZ index for mesh compression

Coding information of a mesh is received. The coding information includes a plurality of first coordinates and a plurality of second coordinates corresponding to a plurality of vertices and a texture map that are associated with the mesh. A respective first coordinate and a respective second coordinate associated with each of the plurality of vertices are normalized by adjusting the respective first coordinate based on a first factor and the respective second coordinate based on a second factor. The first factor and the second factor are associated with at least one of (i) a bit depth value indicating a coded range of the first coordinates and the second coordinates and (ii) a size of the texture map. The normalized respective first coordinate and the normalized respective second coordinate are expanded based on the first factor and the second factor respectively.

UV coordinate ranges and texture map size

A method and apparatus comprising computer code configured to cause a processor or processors to obtain volumetric data of at least one three-dimensional (3D) visual content, derive a first layer of a mesh including a plurality of first vertices from at least one frame of the volumetric data, determine displacement vectors from ones of the plurality of vertices of the first layer to respective ones of a plurality of second vertices of a second layer of the mesh, a total quantity of the plurality of second vertices is greater than a total quantity of the plurality of first vertices, and signal the volumetric data based on the displacement vectors.

Vertex prediction based on decoded neighbors

Method, apparatus, and system for generating temporally correlated UV atlases are provided. The process may include generating plurality of consistent UV charts based on partition information associated with one or more previous frames; removing one or more non-manifold vertices from the plurality of consistent UV charts based on assigning one or more incident faces associated with the one or more non-manifold vertices to corresponding UV charts; merging more than one of the plurality of consistent UV charts based on a similarity between the plurality of consistent UV charts and one or more reference charts associated with the one or more previous frames; and generating temporally correlated UV atlases for the current frame based on aligning the plurality of consistent UV charts with the one or more reference charts associated with the one or more previous frames.

Mesh parameterization with temporally correlated UV atlases

Aspects of the disclosure provide methods and apparatuses for mesh coding (e.g., compression and decompression). In some examples, an apparatus for mesh coding includes processing circuitry. The processing circuitry decodes, using a decoder supporting a first bitdepth, a plurality of segmental attribute values having the first bitdepth from a bitstream carrying a mesh that represents a surface of an object. The plurality of segmental attribute values is associated with attribute values of the mesh, the attribute values of the mesh have a second bitdepth that is higher than the first bitdepth. The processing circuitry determines the attribute values of the mesh having the second bitdepth according to the plurality of segmental attribute values having the first bitdepth.

Segment based compression methods for mesh compression

A method and apparatus that receives a coded video bitstream from an encoder; retrieves, from the coded video bitstream, a mesh including a plurality of polygons that describe a surface of a volumetric object; triangulates one or more vertices of the mesh, the one or more vertices are located on a boundary of the mesh or interior of the mesh; infers connectivity information between the one or more vertices using the triangulation of the one or more vertices; and reconstructs one or more boundary UV coordinates based on the connectivity information.

Triangulation methods with boundary information for dynamic mesh compression

Growing community of inventors

Sunnyvale, CA, United States of America

Xiang Zhang