The Multilevel Structures of NURBs and NURBlets on Intervals

This dissertation is concerned with the problem of constructing biorthogonal wavelets based on non-uniform rational cubic B-Splines on intervals. We call non-uniform rational B-Splines ``NURBs , and such biorthogonal wavelets ``NURBlets . Constructing NURBlets is useful in designing and representing an arbitrary shape of an object in the industry, especially when exactness of the shape is critical such as the shape of an aircraft. As we know presently most popular wavelet models in the industry are approximated at boundaries. In this dissertation a new model is presented that is well suited for generating arbitrary shapes in the industry with mathematical exactness throughout intervals; it fulfills interpolation at boundaries as well

Lifting-based subdivision wavelets with geometric constraints.

Qin, Guiming."August 2010."Thesis (M.Phil.)--Chinese University of Hong Kong, 2010.Includes bibliographical references (p. 72-74).Abstracts in English and Chinese.Chapter 1 --- Introduction --- p.5Chapter 1.1 --- B splines and B-splines surfaces --- p.5Chapter 1. 2 --- Box spline --- p.6Chapter 1. 3 --- Biorthogonal subdivision wavelets based on the lifting scheme --- p.7Chapter 1.4 --- Geometrically-constrained subdivision wavelets --- p.9Chapter 1.5 --- Contributions --- p.9Chapter 2 --- Explicit symbol formulae for B-splines --- p.11Chapter 2. 1 --- Explicit formula for a general recursion scheme --- p.11Chapter 2. 2 --- Explicit formulae for de Boor algorithms of B-spline curves and their derivatives --- p.14Chapter 2.2.1 --- Explicit computation of de Boor Algorithm for Computing B-Spline Curves --- p.14Chapter 2.2.2 --- Explicit computation of Derivatives of B-Spline Curves --- p.15Chapter 2. 3 --- Explicit power-basis matrix fomula for non-uniform B-spline curves --- p.17Chapter 3 --- Biorthogonal subdivision wavelets with geometric constraints --- p.23Chapter 3. 1 --- Primal subdivision and dual subdivision --- p.23Chapter 3. 2 --- Biorthogonal Loop-subdivision-based wavelets with geometric constraints for triangular meshes --- p.24Chapter 3.2.1 --- Loop subdivision surfaces and exact evaluation --- p.24Chapter 3.2.2 --- Lifting-based Loop subdivision wavelets --- p.24Chapter 3.2.3 --- Biorthogonal Loop-subdivision wavelets with geometric constraints --- p.26Chapter 3. 3 --- Biorthogonal subdivision wavelets with geometric constraints for quadrilateral meshes --- p.35Chapter 3.3.1 --- Catmull-Clark subdivision and Doo-Sabin subdivision surfaces --- p.35Chapter 3.3.1.1 --- Catmull-Clark subdivision --- p.36Chapter 3.3.1.2 --- Doo-Sabin subdivision --- p.37Chapter 3.3.2 --- Biorthogonal subdivision wavelets with geometric constraints for quadrilateral meshes --- p.38Chapter 3.3.2.1 --- Biorthogonal Doo-Sabin subdivision wavelets with geometric constraints --- p.38Chapter 3.3.2.2 --- Biorthogonal Catmull-Clark subdivision wavelets with geometric constraints --- p.44Chapter 4 --- Experiments and results --- p.49Chapter 5 --- Conclusions and future work --- p.60Appendix A --- p.62Appendix B --- p.67Appendix C --- p.69Appendix D --- p.71References --- p.7

Wavelets bases defined over tetrahedra

In this paper we define two wavelets bases over tetrahedra which are generated by a regular subdivision method. One of them is a basis based on vertices while the other one is a Haar-like basis that form an unconditional basis for Lp (T, Σ, μ), 1 < p < ∞, being μ the Lebesgue measure and Σ the σ - algebra of all tetrahedra generated from a tetrahedron T by the chosen subdivision method. In order to obtain more vanishing moments, the lifting scheme has been applied to both of themFacultad de Informátic

Wavelet-based multiresolution data representations for scalable distributed GIS services

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2002.Includes bibliographical references (p. 155-160).Demand for providing scalable distributed GIS services has been growing greatly as the Internet continues to boom. However, currently available data representations for these services are limited by a deficiency of scalability in data formats. In this research, four types of multiresolution data representations based on wavelet theories have been put forward. The designed Wavelet Image (WImg) data format helps us to achieve dynamic zooming and panning of compressed image maps in a prototype GIS viewer. The Wavelet Digital Elevation Model (WDEM) format is developed to deal with cell-based surface data. A WDEM is better than a raster pyramid in that a WDEM provides a non-redundant multiresolution representation. The Wavelet Arc (WArc) format is developed for decomposing curves into a multiresolution format through the lifting scheme. The Wavelet Triangulated Irregular Network (WTIN) format is developed to process general terrain surfaces based on the second generation wavelet theory. By designing a strategy to resample a terrain surface at subdivision points through the modified Butterfly scheme, we achieve the result: only one wavelet coefficient needs to be stored for each point in the final representation. In contrast to this result, three wavelet coefficients need to be stored for each point in a general 3D object wavelet-based representation. Our scheme is an interpolation scheme and has much better performance than the Hat wavelet filter on a surface. Boundary filters are designed to make the representation consistent with the rectangular boundary constraint.(cont.) We use a multi-linked list and a quadtree array as the data structures for computing. A method to convert a high resolution DEM to a WTIN is also provided. These four wavelet-based representations provide consistent and efficient multiresolution formats for online GIS. This makes scalable distributed GIS services more efficient and implementable.by Jingsong Wu.Ph.D

Wavelet-based numerical methods for the solution of the Nonuniform Multiconductor Transmission Lines

This work presents a new Time-Domain Space Expansion (TDSE) method for the numerical solution of the Nonuniform Multiconductor Transmission Lines (NMTL). This method is based on a weak formulation of the NMTL equations, which leads to a class of numerical schemes of different approximation order according to the particular choice of some trial and test functions. The core of this work is devoted to the definition of trial and test functions that can be used to produce accurate representations of the solution by keeping the computational effort as small as possible. It is shown that bases of wavelets are a good choice

A Wavelet Algorithm for the Boundary Element Solution of a Geodetic Boundary Value Problem

In this paper we consider a piecewise bilinear collocation method for the solution of a singular integral equation over a part of the surface of the earth. This singular equation is the boundary integral equation corresponding to the oblique derivative boundary problem for Laplace's equation. We introduce special wavelet bases for the spaces of test and trial functions. Analogously to well-known results on wavelet algorithms, the stiffness matrices with respect to these bases can be reduced to sparse matrices such that the assembling of the matrices and the iterative solution of the matrix equations become fast. Though the theoretical results apply only to integral equations with "smooth" solutions over "smooth" manifolds, we present numerical tests for a geometry as difficult as the surface of the earth

Samplets: Construction and scattered data compression

We introduce the concept of samplets by transferring the construction of Tausch-White wavelets to scattered data. This way, we obtain a multiresolution analysis tailored to discrete data which directly enables data compression, feature detection and adaptivity. The cost for constructing the samplet basis and for the fast samplet transform, respectively, is $O(N)$, where $N$ is the number of data points. Samplets with vanishing moments can be used to compress kernel matrices, arising, for instance, kernel based learning and scattered data approximation. The result are sparse matrices with only $O(N \log N )$ remaining entries. We provide estimates for the compression error and present an algorithm that computes the compressed kernel matrix with computational cost $O(N \log N )$. The accuracy of the approximation is controlled by the number of vanishing moments. Besides the cost efficient storage of kernel matrices, the sparse representation enables the application of sparse direct solvers for the numerical solution of corresponding linear systems. In addition to a comprehensive introduction to samplets and their properties, we present numerical studies to benchmark the approach. Our results demonstrate that samplets mark a considerable step in the direction of making large scattered data sets accessible for multiresolution analysis

Operator-adapted finite element wavelets : theory and applications to a posteriori error estimation and adaptive computational modeling

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2005.Includes bibliographical references (leaves 166-171).We propose a simple and unified approach for a posteriori error estimation and adaptive mesh refinement in finite element analysis using multiresolution signal processing principles. Given a sequence of nested discretizations of a domain we begin by constructing approximation spaces at each level of discretization spanned by conforming finite element interpolation functions. The solution to the virtual work equation can then be expressed as a telescopic sum consisting of the solution on the coarsest mesh along with a sequence of error terms denoted as two-level errors. These error terms are the projections of the solution onto complementary spaces that are scale-orthogonal with respect to the inner product induced by the weak-form of the governing differential operator. The problem of generating a compact, yet accurate representation of the solution then reduces to that of generating a compact, yet accurate representation of each of these error components. This problem is solved in three steps: (a) we first efficiently construct a set of scale-orthogonal wavelets that form a Riesz stable basis (in the energy-norm) for the complementary spaces; (b) we then efficiently estimate the contribution of each wavelet to the two-level error and finally (c) we select a subset of the wavelets at each level to preserve and solve exactly for the corresponding coefficients. Our approach has several advantages over a posteriori error estimation and adaptive refinement techniques in vogue in finite element analysis. First, in contrast to the true error, the two-level errors can be estimated very accurately even on coarse meshes. Second, mesh refinement is carried out by the addition of wavelets rather than element subdivision.(cont.) This implies that the technique does not have to directly deal with the handling of irregular vertices. Third, the error estimation and adaptive refinement steps use the same basis. Therefore, the estimates accurately predict how much the error will reduce upon mesh refinement. Finally, the proposed approach naturally and easily accommodates error estimation and adaptive refinement based on both the energy norm as well any bounded linear functional of interest (i.e., goal-oriented error estimation and adaptivity). We demonstrate the application of our approach to the adaptive solution of second and fourth- order problems such as heat transfer, linear elasticity and deformation of thin plates.by Raghunathan Sudarshan.Ph.D