Efficient fine-granular scalable coding of 3D mesh sequences

Jae Kyun Ahn, Yeong Jun Koh, Chang-Su Kim

Research output: Contribution to journalArticle

19 Citations (Scopus)

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.

Original languageEnglish
Article number6387603
Pages (from-to)485-497
Number of pages13
JournalIEEE Transactions on Multimedia
Volume15
Issue number3
DOIs
Publication statusPublished - 2013 Apr 1

Fingerprint

Scalability
Decoding
Experiments

Keywords

  • 3D mesh coding
  • Entropy coding
  • Fine-granular scalability
  • Mesh sequence compression
  • Predictive coding
  • Spatial layer decomposition

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Media Technology
  • Computer Science Applications

Cite this

Efficient fine-granular scalable coding of 3D mesh sequences. / Ahn, Jae Kyun; Koh, Yeong Jun; Kim, Chang-Su.

In: IEEE Transactions on Multimedia, Vol. 15, No. 3, 6387603, 01.04.2013, p. 485-497.

Research output: Contribution to journalArticle

Ahn, Jae Kyun ; Koh, Yeong Jun ; Kim, Chang-Su. / Efficient fine-granular scalable coding of 3D mesh sequences. In: IEEE Transactions on Multimedia. 2013 ; Vol. 15, No. 3. pp. 485-497.
@article{e2d13cd462bb49ea8ddc7ef03bd49fd4,
title = "Efficient fine-granular scalable coding of 3D mesh sequences",
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 = "3D mesh coding, Entropy coding, Fine-granular scalability, Mesh sequence compression, Predictive coding, Spatial layer decomposition",
author = "Ahn, {Jae Kyun} and Koh, {Yeong Jun} and Chang-Su Kim",
year = "2013",
month = "4",
day = "1",
doi = "10.1109/TMM.2012.2235417",
language = "English",
volume = "15",
pages = "485--497",
journal = "IEEE Transactions on Multimedia",
issn = "1520-9210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Efficient fine-granular scalable coding of 3D mesh sequences

AU - Ahn, Jae Kyun

AU - Koh, Yeong Jun

AU - Kim, Chang-Su

PY - 2013/4/1

Y1 - 2013/4/1

N2 - 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.

AB - 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.

KW - 3D mesh coding

KW - Entropy coding

KW - Fine-granular scalability

KW - Mesh sequence compression

KW - Predictive coding

KW - Spatial layer decomposition

UR - http://www.scopus.com/inward/record.url?scp=84897744398&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897744398&partnerID=8YFLogxK

U2 - 10.1109/TMM.2012.2235417

DO - 10.1109/TMM.2012.2235417

M3 - Article

AN - SCOPUS:84897744398

VL - 15

SP - 485

EP - 497

JO - IEEE Transactions on Multimedia

JF - IEEE Transactions on Multimedia

SN - 1520-9210

IS - 3

M1 - 6387603

ER -