Scalable Feature‐Preserving Irregular Mesh Coding

Simple item page
dc.contributor.authorEl Sayeh Khalil, J.en_US
dc.contributor.authorMunteanu, A.en_US
dc.contributor.authorDenis, L.en_US
dc.contributor.authorLambert, P.en_US
dc.contributor.authorWalle, R.en_US
dc.contributor.editorChen, Min and Zhang, Hao (Richard)en_US
dc.date.accessioned2018-01-10T07:36:29Z
dc.date.available2018-01-10T07:36:29Z
dc.date.issued2017
dc.description.abstractThis 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.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.en_US
dc.description.number6
dc.description.sectionheadersArticles
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume36
dc.identifier.doi10.1111/cgf.12938
dc.identifier.issn1467-8659
dc.identifier.pages275-290
dc.identifier.urihttps://doi.org/10.1111/cgf.12938
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf12938
dc.publisher© 2017 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectscalable mesh compression
dc.subjectlevel of detail algorithms
dc.subjectscalable rendering
dc.subjectI.3.5 [Computer Graphics]: Computational Geometry and Object Modeling–Hierarchy and geometric transformations G.1.2 [Numerical Analysis]: Approximation–Approximation of surfaces and contours
dc.subjectWavelets and fractals E.4 [Coding and Information Theory]: Data compaction and compression
dc.titleScalable Feature‐Preserving Irregular Mesh Codingen_US
Files
Collections
36-Issue 6