This paper proposes a new compression algorithm for dynamic 3d meshes. In such a sequence of meshes, neighboring vertices have a strong tendency to behave similarly and the degree of dependencies between their locations in two successive frames is very large which can be efficiently exploited using a combination of Predictive and DCT coders (PDCT). Our strategy gathers mesh vertices of similar motions into clusters, establish a local coordinate frame (LCF) for each cluster and encodes frame by frame and each cluster separately. The vertices of each cluster have small variation over a time relative to the LCF. Therefore, the location of each new vertex is well predicted from its location in the previous frame relative to the LCF of its clust...
International audienceThis paper presents a novel compression scheme for 3D dynamic meshes. The prop...
This paper addresses the problem of representing dynamic 3D meshes in a compact way, so that they ca...
International audienceIn this paper, we propose an efficient low complexity compression scheme for d...
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a seq...
This paper presents a new compression algorithm for 3D dynamic mesh sequences based on the local pri...
We present a new approach to dynamic mesh compression, which combines compression with simplificatio...
Compression of computer graphics data such as static and dynamic 3D meshes has received significant ...
We introduce in this paper a new compression process to en-code the geometry of 3D mesh sequences (w...
International audienceIn this paper, we introduce a new formalism for mesh geometry prediction. We d...
International audienceWe present an original wavelet-based compression algorithm for sequences of 3D...
International audienceWe present an efficient compression algorithm for sequences of triangular mesh...
The task of dynamic mesh compression seeks to find a compact representation of a surface animation, ...
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoreti...
In this paper, we propose an efficient compression algorithm for 3D triangular meshes, consisting of...
Orcay, Özgür (Dogus Author)A large family of lossy 3-D mesh geometry compression schemes operate by ...
International audienceThis paper presents a novel compression scheme for 3D dynamic meshes. The prop...
This paper addresses the problem of representing dynamic 3D meshes in a compact way, so that they ca...
International audienceIn this paper, we propose an efficient low complexity compression scheme for d...
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a seq...
This paper presents a new compression algorithm for 3D dynamic mesh sequences based on the local pri...
We present a new approach to dynamic mesh compression, which combines compression with simplificatio...
Compression of computer graphics data such as static and dynamic 3D meshes has received significant ...
We introduce in this paper a new compression process to en-code the geometry of 3D mesh sequences (w...
International audienceIn this paper, we introduce a new formalism for mesh geometry prediction. We d...
International audienceWe present an original wavelet-based compression algorithm for sequences of 3D...
International audienceWe present an efficient compression algorithm for sequences of triangular mesh...
The task of dynamic mesh compression seeks to find a compact representation of a surface animation, ...
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoreti...
In this paper, we propose an efficient compression algorithm for 3D triangular meshes, consisting of...
Orcay, Özgür (Dogus Author)A large family of lossy 3-D mesh geometry compression schemes operate by ...
International audienceThis paper presents a novel compression scheme for 3D dynamic meshes. The prop...
This paper addresses the problem of representing dynamic 3D meshes in a compact way, so that they ca...
International audienceIn this paper, we propose an efficient low complexity compression scheme for d...