Efficient Fine-Granular Scalable Coding of 3D Mesh Sequences

Citations

WEB OF SCIENCE

20
Citations

SCOPUS

25

초록

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.

키워드

3D mesh codingentropy codingfine-granular scalabilitymesh sequence compressionpredictive codingspatial layer decomposition.COMPRESSION
제목
Efficient Fine-Granular Scalable Coding of 3D Mesh Sequences
저자
Ahn, Jae-KyunKoh, Yeong JunKim, Chang-Su
DOI
10.1109/TMM.2012.2235417
발행일
2013-04
유형
Article
저널명
IEEE Transactions on Multimedia
15
3
페이지
485 ~ 497