Progressive 3D mesh compression using MOG-based Bayesian entropy coding and gradual prediction

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


A progressive 3D triangular mesh compression algorithm built on the MOG-based Bayesian entropy coding and the gradual prediction scheme is proposed in this work. For connectivity coding, we employ MOG models to estimate the posterior probabilities of topology symbols given vertex geometries. Then, we encode the topology symbols using an arithmetic coder with different contexts, which depend on the posterior probabilities. For geometry coding, we propose the gradual prediction labeling and the dual-ring prediction to divide vertices into groups and predict later groups more efficiently using the information in already encoded groups. Simulation results demonstrate that the proposed algorithm provides significantly better performance than the conventional wavemesh coder, with the average bit rate reduction of about 16.9 %.

Original languageEnglish
Pages (from-to)1077-1091
Number of pages15
JournalVisual Computer
Issue number10
Publication statusPublished - 2014 Oct 1

Bibliographical note

Funding Information:
This work was supported partly by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (No. 2012-011031), and partly by the Global Frontier R&D Program on Human-centered Interaction for Coexistence, funded by the NRF grant by the Korean Government (MEST) (NRF-M1AXA003-2011-0031648).

Publisher Copyright:
© 2013, Springer-Verlag Berlin Heidelberg.


  • 3D mesh compression
  • Context-based arithmetic coding
  • Mixture of Gaussian model
  • Predictive coding
  • Progressive coding
  • Triangular mesh

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Progressive 3D mesh compression using MOG-based Bayesian entropy coding and gradual prediction'. Together they form a unique fingerprint.

Cite this