Search results for "Lifting scheme"
showing 8 items of 18 documents
Adaptive surface compression with geometric wavelets.
2008
The recent advances in computer graphics and digitization allow access to an ever finer three-dimensional modelling of the world. The critical challenges with 3D models lie in their transmission and rendering, which must fit the heterogeneity of the end resources (network bandwidth, display terminals . . . ). In this context, this thesis investigates the progressive compression and transmission of 3D models, based on multiresolution analysis, to provide a scalable representation of these geometric models. This work is part of "CoSurf", a collaborative research project involving LIRIS laboratory and France Télécom R&D in Rennes. The proposed hierarchical compression method is based on a wave…
Biorthogonal Wavelet Transforms Originating from Discrete and Discrete-Time Splines
2018
This chapter describes how to generate families of biorthogonal wavelet transforms in spaces of periodic signals using prediction p-filters originating from discrete-time and discrete splines. The transforms are generated by the lifting scheme (Sweldens (Wavelet applications in signal and image processing III, vol 2569, 1995, [7]), Sweldens (Appl Comput Harmon Anal 3:186–200, 1996, [8]), Sweldens (SIAM J Math Anal 29:511–546, 1997, [9]), see also Sect. 7.1 of this volume). The discrete-time wavelets related to those transforms are (anti)symmetric, well localized in time domain and have flat spectra. These families comprise wavelets with any number of local discrete vanishing moments (LDVMs)…
On the Design of Fast Wavelet Transform Algorithms With Low Memory Requirements
2008
In this paper, a new algorithm to efficiently compute the two-dimensional wavelet transform is presented. This algorithm aims at low memory consumption and reduced complexity, meeting these requirements by means of line-by-line processing. In this proposal, we use recursion to automatically place the order in which the wavelet transform is computed. This way, we solve some synchronization problems that have not been tackled by previous proposals. Furthermore, unlike other similar proposals, our proposal can be straightforwardly implemented from the algorithm description. To this end, a general algorithm is given which is further detailed to allow its implementation with a simple filter bank…
Spline-Based Wavelet Transforms
2018
The Lifting Scheme introduced in (Sweldens, Appl. Comput. Harmon. Anal. 3(2), 186–200 (1996) and Sweldens, SIAM J. Math. Anal. 29(2), 511–546 (1997).) [3, 4] is a method that constructs bi-orthogonal wavelet transforms of signals and provides their efficient implementation. The main feature of the lifting scheme is that all the constructions are derived directly in the spatial domain and therefore can be custom designed to more general and irregular settings such as non-uniformly spaced data samples and bounded intervals. In this chapter, we outline the lifting scheme and describe how to use the local quasi-interpolating splines, introduced in Chap. 6, for the construction of wavelet transf…
Biorthogonal Wavelet Transforms Originating from Splines
2015
This chapter describes how to design families of biorthogonal wavelet transforms of signals and respective biorthogonal Wavelet bases in the signal space using spline-based prediction filters. Although the designed Wavelets originate from splines, they are not splines themselves. The design and implementation of the biorthogonal Wavelet transforms is done using the Lifting scheme. Most of the filters participating in the expansion of signals over the presented bases have infinite impulse responses and are implemented by recursive filtering whose computational cost is competitive with the FIR filtering cost. Properties of the designed Wavelets, such as symmetry, flat spectra, good time domai…
MULTIRESOLUTION ANALYSIS FOR IRREGULAR MESHES WITH APPEARANCE ATTRIBUTES
2004
We present a new multiresolution analysis framework based on the lifting scheme for irregular meshes with attributes. We introduce a surface prediction opera- tor to compute the detail coefficients for the geometry and the attributes of the model. Attribute analysis gives appearance information to complete the geomet- rical analysis of the model.We present an application to adaptive visualization and some experimental results to show the efficiency of our framework.
Multiresolution Analysis for Meshes with Appearance Attributes
2005
International audience; We present a new multiresolution analysis framework for irregular meshes with attributes based on the lifting scheme. We introduce a surface prediction operator to compute the detail coefficients for the geometry and the attributes of the model. Attribute analysis gives appearance information to complete the geometrical analysis of the model. A set of experimental results are given to show the efficiency of our framework. We present two applications to adaptive visual-ization and denoising.
A Study on Patch-Based Progressive Coding Schemes of Semi-Regular 3D Meshes for Local Wavelet Compression and View-Dependent Transmission
2010
International audience; This paper firstly introduces a wavelet-based segmentation for three-dimensional (3D) Semi-Regular (SR) meshes, as a pre-processing step, in a region-independent progressive coding algorithm. The proposed segmentation process aims at producing homogeneous regions with respect to their frequency amplitudes on the mesh surface, in other words: patches with different degrees of roughness. We have then studied the behavior of the wavelets, obtained during the independent coding of each region, especially close to the patch boundaries. The main contribution of this paper consists in considering three different possible wavelet decompositions, close to the region borders, …