2009
DOI: 10.1016/j.cad.2009.02.013
|View full text |Cite
|
Sign up to set email alerts
|

Single-rate near lossless compression of animated geometry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 10 publications
0
7
0
Order By: Relevance
“…Zhang and Owen [2007] and Müller et al [2006] place vertex displacement vectors into a hierarchical tree structure (an octree), which allows exploitation of spatiotemporal coherence. Amjoun and Straßer [2009] proposed using local coordinate systems (that separate tangential and normal components) to encode delta vectors. Stefanoski and Liu [2007] proposed simplifying the frames into spatial layers (i.e., levels of detail) and then exploiting spatial and temporal dependencies between neighboring spatial layers and consecutive frames to estimate the motion of each vertex.…”
Section: Methods Using Spatiotemporal Predictionmentioning
confidence: 99%
See 1 more Smart Citation
“…Zhang and Owen [2007] and Müller et al [2006] place vertex displacement vectors into a hierarchical tree structure (an octree), which allows exploitation of spatiotemporal coherence. Amjoun and Straßer [2009] proposed using local coordinate systems (that separate tangential and normal components) to encode delta vectors. Stefanoski and Liu [2007] proposed simplifying the frames into spatial layers (i.e., levels of detail) and then exploiting spatial and temporal dependencies between neighboring spatial layers and consecutive frames to estimate the motion of each vertex.…”
Section: Methods Using Spatiotemporal Predictionmentioning
confidence: 99%
“…Before starting, we have to provide some insight into the useful functionalities of a dynamic mesh compression algorithm. We distinguish two main features that characterize existing algorithms: -Local versus global: As raised in Amjoun and Straßer [2009], some algorithms analyze the global coherence of the dynamic mesh to compress it, whereas on the other side, others focus on local frame-to-frame changes. The main benefit of global approaches is an improved compression performance, whereas local algorithms allow for faster (often real-time) compression/decompression.…”
Section: State Of the Art On Mesh Sequence Compressionmentioning
confidence: 99%
“…Moreover, Khodakovsky et al [14] proposed to apply predictive method and arithmetic encoding on wavelet transform coefficients. Amjoun and Straβer [15] introduced a new connectivityguided predictive scheme to encode the residues in the local coordinate frames to improve the efficiency of animation compression. Stefanoski and Ostermann [16] presented a fast and efficient scalable predictive coding (SPC) scheme by employing predictive encoding in the space of rotation-invariant coordinates with respect to a spatially and temporally scalable decomposition of dynamic animation.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, a number of previous research efforts [5,6,20,42] have been focused on connectivitybased compression. Their core idea is to exploit connectivity information of a mesh.…”
Section: Related Workmentioning
confidence: 99%