Scalable Feature‐Preserving Irregular Mesh Coding. (1st July 2016)

• Record Type: Journal Article
• Authors: El Sayeh Khalil, J.; Munteanu, A.; Denis, L.; Lambert, P.; Van de Walle, R.
• Is Part Of: Computer graphics forum. Volume 36:Number 6(2017)
• Page Start: 275
• Page End: 290
• Publication Date: 2016-07-01
• Subjects: scalable mesh compression -- level of detail algorithms -- scalable rendering -- I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling–Hierarchy and geometric transformations G.1.2 [Numerical Analysis]: Approximation–Approximation of surfaces and contours -- Wavelets and fractals E.4 [Coding and Information Theory]: Data compaction and compression; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.12938
• Languages: English
• ISSNs: 0167-7055

Abstract

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