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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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
JournalVisual Computer
Volume30
Issue number10
DOIs
Publication statusPublished - 2013 Jan 1

Fingerprint

entropy
coding
Entropy
symbol
Topology
mathematics
Geometry
Group
Labeling
simulation
performance

ASJC Scopus subject areas

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

Cite this

Progressive 3D mesh compression using MOG-based Bayesian entropy coding and gradual prediction. / Lee, Dae Youn; Sull, Sanghoon; Kim, Chang-Su.

In: Visual Computer, Vol. 30, No. 10, 01.01.2013.

Research output: Contribution to journalArticle

@article{a520cf4799c442d7a36550128498380f,
title = "Progressive 3D mesh compression using MOG-based Bayesian entropy coding and gradual prediction",
abstract = "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 {\%}.",
keywords = "3D mesh compression, Context-based arithmetic coding, Mixture of Gaussian model, Predictive coding, Progressive coding, Triangular mesh",
author = "Lee, {Dae Youn} and Sanghoon Sull and Chang-Su Kim",
year = "2013",
month = "1",
day = "1",
doi = "10.1007/s00371-013-0779-3",
language = "English",
volume = "30",
journal = "The Visual Computer",
issn = "0178-2789",
publisher = "Springer Verlag",
number = "10",

}

TY - JOUR

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

AU - Lee, Dae Youn

AU - Sull, Sanghoon

AU - Kim, Chang-Su

PY - 2013/1/1

Y1 - 2013/1/1

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

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

KW - 3D mesh compression

KW - Context-based arithmetic coding

KW - Mixture of Gaussian model

KW - Predictive coding

KW - Progressive coding

KW - Triangular mesh

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

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

U2 - 10.1007/s00371-013-0779-3

DO - 10.1007/s00371-013-0779-3

M3 - Article

VL - 30

JO - The Visual Computer

JF - The Visual Computer

SN - 0178-2789

IS - 10

ER -