Time-Varying Mesh Compression Using an Extended Block Matching Algorithm

Time-varying mesh, which is attracting a lot of attention as a new multimedia representation method, is a sequence of 3-D models that are composed of vertices, edges, and some attribute components such as color. Among these components, vertices require large storage space. In conventional 2-D video...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology Vol. 17; no. 11; pp. 1506 - 1518
Main Authors: Seung-Ryong Han, Yamasaki, T., Aizawa, K.
Format: Journal Article
Language:English
Published: New York IEEE 01.11.2007
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
3-D model coding
3-D motion compensation (MC)
Algorithms
Animation
Block matching algorithm
Blocking
Compressing
Discrete cosine transforms
Educational technology
Entropy
Finite element method
Image coding
Information geometry
Matching
Mathematical analysis
Mesh generation
Motion compensation
Pulse modulation
Redundancy
Space technology
time-varying mesh
Video compression
block matching algorithm
Time-varying mesh
3D model coding
3D motion compensation
ISSN:1051-8215, 1558-2205
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Time-varying mesh, which is attracting a lot of attention as a new multimedia representation method, is a sequence of 3-D models that are composed of vertices, edges, and some attribute components such as color. Among these components, vertices require large storage space. In conventional 2-D video compression algorithms, motion compensation (MC) using a block matching algorithm is frequently employed to reduce temporal redundancy between consecutive frames. However, there has been no such technology for 3-D time-varying mesh so far. Therefore, in this paper, we have developed an extended block matching algorithm (EBMA) to reduce the temporal redundancy of the geometry information in the time-varying mesh by extending the idea of the 2-D block matching algorithm to 3-D space. In our EBMA, a cubic block is used as a matching unit. MC in the 3-D space is achieved efficiently by matching the mean normal vectors calculated from partial surfaces in cubic blocks, which our experiments showed to be a suboptimal matching criterion. After MC, residuals are transformed by the discrete cosine transform, uniformly quantized, and then encoded. The extracted motion vectors are also entropy coded after differential pulse code modulation. As a result of our experiments, 10%-18% compression has been achieved.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2007.903810