Abstract | ||
---|---|---|
3D dynamic meshes are associated with voluminous data and need to be encoded for efficient storage and transmission. We study the impact of vertex clustering on registration-based dynamic mesh coding, where compact mesh motion representation is achieved by computing correspondences for the mesh segments from the temporal reference to obtain high compression performance. Clustering algorithms segment the mesh into smaller pieces and the compression performance is directly related to how effectively these pieces can describe the mesh motion. In this paper, we demonstrate that the use of efficient vertex clustering schemes in the compression framework can bring about a 10% improvement in compression performance. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.imavis.2007.11.005 | Image Vision Comput. |
Keywords | Field | DocType |
compact mesh motion representation,computer animation,efficient storage,high compression performance,vertex clustering,compression framework,compression performance,3d dynamic meshes,data compression,dynamic mesh,mesh segment,mesh motion,efficient vertex,registration-based dynamic mesh coding | Computer vision,Compression (physics),Laplacian smoothing,Polygon mesh,Computer science,Coding (social sciences),T-vertices,Artificial intelligence,Data compression,Cluster analysis,Computer animation | Journal |
Volume | Issue | ISSN |
26 | 7 | Image and Vision Computing |
Citations | PageRank | References |
2 | 0.37 | 30 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Subramanian Ramanathan | 1 | 487 | 60.35 |
Ashraf A. Kassim | 2 | 1164 | 97.26 |
Tiow-Seng Tan | 3 | 398 | 27.99 |