Wavelet Theory Demystified

In this paper, we revisit wavelet theory starting from the representation of a scaling function as the convolution of a B-spline (the regular part of it) and a distribution (the irregular or residual part). This formulation leads to some new insights on wavelets and makes it possible to rederive the main results of the classical theory—including some new extensions for fractional orders—in a self-contained, accessible fashion. In particular, we prove that the B-spline component is entirely responsible for five key wavelet properties: order of approximation, reproduction of polynomials, vanishing moments, multiscale differentiation property, and smoothness (regularity) of the basis functions. We also investigate the interaction of wavelets with differential operators giving explicit time domain formulas for the fractional derivatives of the basis functions. This allows us to specify a corresponding dual wavelet basis and helps us understand why the wavelet transform provides a stable characterization of the derivatives of a signal. Additional results include a new peeling theory of smoothness, leading to the extended notion of wavelet differentiability in the $L _{ p }$ -sense and a sharper theorem stating that smoothness implies order

A Compressed Sensing Algorithm for Sparse-View Pinhole Single Photon Emission Computed Tomography

Single Photon Emission Computed Tomography (SPECT) systems are being developed with multiple cameras and without gantry rotation to provide rapid dynamic acquisitions. However, the resulting data is angularly undersampled, due to the limited number of views. We propose a novel reconstruction algorithm for sparse-view SPECT based on Compressed Sensing (CS) theory. The algorithm models Poisson noise by modifying the Iterative Hard Thresholding algorithm to minimize the Kullback-Leibler (KL) distance by gradient descent. Because the underlying objects of SPECT images are expected to be smooth, a discrete wavelet transform (DWT) using an orthogonal spline wavelet kernel is used as the sparsifying transform. Preliminary feasibility of the algorithm was tested on simulated data of a phantom consisting of two Gaussian distributions. Single-pinhole projection data with Poisson noise were simulated at 128, 60, 15, 10, and 5 views over 360 degrees. Image quality was assessed using the coefficient of variation and the relative contrast between the two objects in the phantom. Overall, the results demonstrate preliminary feasibility of the proposed CS algorithm for sparse-view SPECT imaging

Autofocus for digital Fresnel holograms by use of a Fresnelet-sparsity criterion

We propose a robust autofocus method for reconstructing digital Fresnel holograms. The numerical reconstruction involves simulating the propagation of a complex wave front to the appropriate distance. Since the latter value is difficult to determine manually, it is desirable to rely on an automatic procedure for finding the optimal distance to achieve high-quality reconstructions. Our algorithm maximizes a sharpness metric related to the sparsity of the signal’s expansion in distance-dependent waveletlike Fresnelet bases. We show results from simulations and experimental situations that confirm its applicability

A multiscale collocation method for fractional differential problems

We introduce a multiscale collocation method to numerically solve differential problems involving both ordinary and fractional derivatives of high order. The proposed method uses multiresolution analyses (MRA) as approximating spaces and takes advantage of a finite difference formula that allows us to express both ordinary and fractional derivatives of the approximating function in a closed form. Thus, the method is easy to implement, accurate and efficient. The convergence and the stability of the multiscale collocation method are proved and some numerical results are shown.We introduce a multiscale collocation method to numerically solve differential problems involving both ordinary and fractional derivatives of high order. The proposed method uses multiresolution analyses (MRA) as approximating spaces and takes advantage of a finite difference formula that allows us to express both ordinary and fractional derivatives of the approximating function in a closed form. Thus, the method is easy to implement, accurate and efficient. The convergence and the stability of the multiscale collocation method are proved and some numerical results are shown

Construction of Hilbert Transform Pairs of Wavelet Bases and Gabor-like Transforms

We propose a novel method for constructing Hilbert transform (HT) pairs of wavelet bases based on a fundamental approximation-theoretic characterization of scaling functions--the B-spline factorization theorem. In particular, starting from well-localized scaling functions, we construct HT pairs of biorthogonal wavelet bases of L^2(R) by relating the corresponding wavelet filters via a discrete form of the continuous HT filter. As a concrete application of this methodology, we identify HT pairs of spline wavelets of a specific flavor, which are then combined to realize a family of complex wavelets that resemble the optimally-localized Gabor function for sufficiently large orders. Analytic wavelets, derived from the complexification of HT wavelet pairs, exhibit a one-sided spectrum. Based on the tensor-product of such analytic wavelets, and, in effect, by appropriately combining four separable biorthogonal wavelet bases of L^2(R^2), we then discuss a methodology for constructing 2D directional-selective complex wavelets. In particular, analogous to the HT correspondence between the components of the 1D counterpart, we relate the real and imaginary components of these complex wavelets using a multi-dimensional extension of the HT--the directional HT. Next, we construct a family of complex spline wavelets that resemble the directional Gabor functions proposed by Daugman. Finally, we present an efficient FFT-based filterbank algorithm for implementing the associated complex wavelet transform.Comment: 36 pages, 8 figure