We introduce a new patch-based multi-resolution analysis of semi-regular mesh surfaces. This analysis brings
patch-specific wavelet decomposition, quantization and encoding to the mesh compression process. Our underlying
mesh partitioning relies on surface roughness (based on frequency magnitude variations), in order to
produce patches, representative of semantic attributes of the object. With current compression methods based
on wavelet decomposition, some regions of the mesh still have wavelet coefficients with a non negligible magnitude
or polar angle (the angle with the normal vector), reflecting the high frequencies of the model. For each
non-smooth region, our adaptive compression chain provides the possibility to choose the best prediction filter
adjusted to its specificity. Our hierarchical analysis is based on a semi-regular mesh decomposition produced
by second-generation wavelets. Apart from progressive compression, other types of applications can benefit
from this adaptive decomposition, like error resilient compression, view-dependent reconstruction, indexation or
watermarking. Selective refinement examples are given to illustrate the concept of ROI (Region Of Interest)
decoding, which few people has considered, whereas it is possible with JPEG2000 for images.
During the last decades, the three-dimensional objects have begun to compete with traditional multimedia
(images, sounds and videos) and have been used by more and more applications. The common model used
to represent them is a surfacic mesh due to its intrinsic simplicity and efficacity. In this paper, we present a
new algorithm for the segmentation of semi-regular triangle meshes, via multiresolution analysis. Our method
uses several measures which reflect the roughness of the surface for all meshes resulting from the decomposition
of the initial model into different fine-to-coarse multiresolution meshes. The geometric data decomposition is
based on the lifting scheme. Using that formulation, we have compared various interpolant prediction operators,
associated or not with an update step. For each resolution level, the resulting approximation mesh is then
partitioned into classes having almost constant roughness thanks to a clustering algorithm. Resulting classes
gather regions having the same visual appearance in term of roughness. The last step consists in decomposing
the mesh into connex groups of triangles using region growing ang merging algorithms. These connex surface
patches are of particular interest for adaptive mesh compression, visualisation, indexation or watermarking.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.