TVMC: Time-Varying Mesh Compression Using Volume-Tracked Reference Meshes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F25%3A43975366" target="_blank" >RIV/49777513:23520/25:43975366 - isvavai.cz</a>
Result on the web
<a href="https://dl.acm.org/doi/10.1145/3712676.3714440" target="_blank" >https://dl.acm.org/doi/10.1145/3712676.3714440</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3712676.3714440" target="_blank" >10.1145/3712676.3714440</a>
Alternative languages
Result language
angličtina
Original language name
TVMC: Time-Varying Mesh Compression Using Volume-Tracked Reference Meshes
Original language description
Time-varying meshes (TVMs), characterized by their varying connectivity and number of vertices, hold significant potential in AR/VR applications. However, their practical use is challenging due to their large file sizes and the complexity of time-varying topology. Many time-varying mesh compression methods attempted to exploit redundancy between consecutive meshes to compress TVMs more efficiently, however, most face difficulties in establishing stable vertex and surface correspondence between the frames of a TVM. We propose TVMC, a novel TVM compression method that leverages volume tracking and extracts high-quality reference meshes for inter-frame prediction. Specifically, we use as-rigid-as-possible volume tracking to align consecutive TVMs and track volume centers, followed by multidimensional scaling to refine reference centers. This allows us to precisely deform a group of frames to the reference space and extract the reference mesh which is then deformed to approximate each mesh in the group to get displacement fields for TVM compression. Extensive experiments show that TVMC outperforms state-of-the-art methods (e.g., Google Draco, V-DMC 4.0, etc.), with bitrates of 4-6 Mbps compared to 9-12 Mbps for Draco and 10-15 Mbps for V-DMC 4.0. It reduces the decoding time by 66.1% compared to Draco and enables an increased group of frames (up to 15) without significant distortion.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GF23-04622L" target="_blank" >GF23-04622L: Data compression paradigm based on omitting self-evident information - COMPROMISE</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 16th ACM Multimedia Systems Conference
ISBN
979-8-4007-1467-2
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
79-89
Publisher name
Association for Computing Machinery
Place of publication
New York, NY, USA
Event location
Stellenbosch, South Africa
Event date
Mar 31, 2025
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001480944300008