Advanced search
2 files | 18.54 MB

Scalable feature-preserving irregular mesh coding

(2017) COMPUTER GRAPHICS FORUM. 36(6). p.275-290
Author
Organization
Abstract
This paper presents a novel wavelet-based transform and coding scheme for irregular meshes. The transform preserves geometric features at lower resolutions by adaptive vertex sampling and retriangulation, resulting in more accurate subsampling and better avoidance of smoothing and aliasing artefacts. By employing octree-based coding techniques, the encoding of both connectivity and geometry information is decoupled from any mesh traversal order, and allows for exploiting the intra-band statistical dependencies between wavelet coefficients. Improvements over the state of the art obtained by our approach are three-fold: (1) improved rate-distortion performance over Wavemesh and IPR for both the Hausdorff and root mean square distances at low-to-mid-range bitrates, most obvious when clear geometric features are present while remaining competitive for smooth, feature-poor models; (2) improved rendering performance at any triangle budget, translating to a better quality for the same runtime memory footprint; (3) improved visual quality when applying similar limits to the bitrate or triangle budget, showing more pronounced improvements than rate-distortion curves.
Keywords
IBCN, MULTIRESOLUTION ANALYSIS, PROGRESSIVE COMPRESSION, TRIANGLE MESHES, SURFACE MESHES, SCHEME

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 8.31 MB
  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 10.23 MB

Citation

Please use this url to cite or link to this publication:

Chicago
El Sayeh Khalil, Jonas, A Munteanu, L Denis, Peter Lambert, and Rik Van de Walle. 2017. “Scalable Feature-preserving Irregular Mesh Coding.” Computer Graphics Forum 36 (6): 275–290.
APA
El Sayeh Khalil, J., Munteanu, A., Denis, L., Lambert, P., & Van de Walle, R. (2017). Scalable feature-preserving irregular mesh coding. COMPUTER GRAPHICS FORUM, 36(6), 275–290.
Vancouver
1.
El Sayeh Khalil J, Munteanu A, Denis L, Lambert P, Van de Walle R. Scalable feature-preserving irregular mesh coding. COMPUTER GRAPHICS FORUM. 2017;36(6):275–90.
MLA
El Sayeh Khalil, Jonas, A Munteanu, L Denis, et al. “Scalable Feature-preserving Irregular Mesh Coding.” COMPUTER GRAPHICS FORUM 36.6 (2017): 275–290. Print.
@article{8531425,
  abstract     = {This paper presents a novel wavelet-based transform and coding scheme for irregular meshes. The transform preserves geometric features at lower resolutions by adaptive vertex sampling and retriangulation, resulting in more accurate subsampling and better avoidance of smoothing and aliasing artefacts. By employing octree-based coding techniques, the encoding of both connectivity and geometry information is decoupled from any mesh traversal order, and allows for exploiting the intra-band statistical dependencies between wavelet coefficients. Improvements over the state of the art obtained by our approach are three-fold: (1) improved rate-distortion performance over Wavemesh and IPR for both the Hausdorff and root mean square distances at low-to-mid-range bitrates, most obvious when clear geometric features are present while remaining competitive for smooth, feature-poor models; (2) improved rendering performance at any triangle budget, translating to a better quality for the same runtime memory footprint; (3) improved visual quality when applying similar limits to the bitrate or triangle budget, showing more pronounced improvements than rate-distortion curves.},
  author       = {El Sayeh Khalil, Jonas and Munteanu, A and Denis, L and Lambert, Peter and Van de Walle, Rik},
  issn         = {0167-7055},
  journal      = {COMPUTER GRAPHICS FORUM},
  language     = {eng},
  number       = {6},
  pages        = {275--290},
  title        = {Scalable feature-preserving irregular mesh coding},
  url          = {http://dx.doi.org/10.1111/cgf.12938},
  volume       = {36},
  year         = {2017},
}

Altmetric
View in Altmetric
Web of Science
Times cited: