DocumentCode
1762555
Title
Efficient Fine-Granular Scalable Coding of 3D Mesh Sequences
Author
Jae-Kyun Ahn ; Yeong Jun Koh ; Chang-Su Kim
Author_Institution
Sch. of Electr. Eng., Korea Univ., Seoul, South Korea
Volume
15
Issue
3
fYear
2013
fDate
41365
Firstpage
485
Lastpage
497
Abstract
An efficient fine-granular scalable coding algorithm of 3-D mesh sequences for low-latency streaming applications is proposed in this work. First, we decompose a mesh sequence into spatial and temporal layers to support scalable decoding. To support the finest-granular spatial scalability, we decimate only a single vertex at each layer to obtain the next layer. Then, we predict the coordinates of decimated vertices spatially and temporally based on a hierarchical prediction structure. Last, we quantize and transmit the spatio-temporal prediction residuals using an arithmetic coder. We propose an efficient context model for the arithmetic coding. Experiment results show that the proposed algorithm provides significantly better compression performance than the conventional algorithms, while supporting finer-granular spatial scalability.
Keywords
arithmetic codes; computer graphics; graph theory; mesh generation; prediction theory; spatiotemporal phenomena; 3D mesh sequence; arithmetic coder; decimated vertex coordinate prediction; fine-granular scalable coding algorithm; finest-granular spatial scalability; hierarchical prediction structure; low-latency streaming applications; spatial layers; spatiotemporal prediction residual quantization; spatiotemporal prediction residual transmission; temporal layers; Algorithm design and analysis; Encoding; Prediction algorithms; Principal component analysis; Scalability; Topology; Vectors; 3D mesh coding; entropy coding; fine-granular scalability; mesh sequence compression; predictive coding; spatial layer decomposition;
fLanguage
English
Journal_Title
Multimedia, IEEE Transactions on
Publisher
ieee
ISSN
1520-9210
Type
jour
DOI
10.1109/TMM.2012.2235417
Filename
6387603
Link To Document