Spectral coding of mesh geometry with a hierarchical set partitioning algorithm

Umut Konur*, Uluǧ Bayazit, Hasan F. Ateş, Fikret S. Gürgen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose a progressive mesh geometry coder, which expresses geometry information in terms of spectral coefficients obtained through a transformation and codes these coefficients using a hierarchical set partitioning algorithm. The spectral transformation used is the one proposed in [10] where the spectral coefficients are obtained by projecting the mesh geometry onto an orthonormal basis determined by mesh topology. The set partitioning method that jointly codes the zeroes of these coefficients, treats the spectral coefficients for each of the three spatial coordinates with the right priority at all bit planes and realizes a truly embedded bitstream by implicit bit allocation. The experiments on common irregular meshes reveal that the distortion-rate performance of our coder is significantly superior to that of the spectral coder of [10].

Original languageEnglish
Title of host publicationProceedings of SPIE-IS and T Electronic Imaging - Visual Communications and Image Processing 2008
DOIs
Publication statusPublished - 2008
EventVisual Communications and Image Processing 2008 - San Jose, CA, United States
Duration: 29 Jan 200831 Jan 2008

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume6822
ISSN (Print)0277-786X

Conference

ConferenceVisual Communications and Image Processing 2008
Country/TerritoryUnited States
CitySan Jose, CA
Period29/01/0831/01/08

Keywords

  • Hierarchical set partitioning
  • Mesh geometry compression
  • Progressive coding
  • Spectral compression

Fingerprint

Dive into the research topics of 'Spectral coding of mesh geometry with a hierarchical set partitioning algorithm'. Together they form a unique fingerprint.

Cite this