Complete Parameterization of Piecewise-Polynomial Interpolation Kernels

Every now and then, a new design of an interpolation kernel shows up in the literature. While interesting results have emerged, the traditional design methodology proves laborious and is riddled with very large systems of linear equations that must be solved analytically. In this paper, we propose to ease this burden by providing an explicit formula that will generate every possible piecewise-polynomial kernel given its degree, its support, its regularity, and its order of approximation. This formula contains a set of coefficients that can be chosen freely and do not interfere with the four main design parameters; it is thus easy to tune the design to achieve any additional constraints that the designer may care for

Interpolation Revisited

Based on the theory of approximation, this paper presents a unified analysis of interpolation and resampling techniques. An important issue is the choice of adequate basis functions. We show that, contrary to the common belief, those that perform best are not interpolating. By opposition to traditional interpolation, we call their use generalized interpolation; they involve a prefiltering step when correctly applied. We explain why the approximation order inherent in any basis function is important to limit interpolation artifacts. The decomposition theorem states that any basis function endowed with approximation order can be expressed as the convolution of a B-spline of the same order with another function that has none. This motivates the use of splines and spline-based functions as a tunable way to keep artifacts in check without any significant cost penalty. We discuss implementation and performance issues, and we provide experimental evidence to support our claims

Wavelets, Fractals, and Radial Basis Functions

Wavelets and radial basis functions (RBFs) lead to two distinct ways of representing signals in terms of shifted basis functions. RBFs, unlike wavelets, are nonlocal and do not involve any scaling, which makes them applicable to nonuniform grids. Despite these fundamental differences, we show that the two types of representation are closely linked together …through fractals. First, we identify and characterize the whole class of self-similar radial basis functions that can be localized to yield conventional multiresolution wavelet bases. Conversely, we prove that for any compactly supported scaling function φ(x), there exists a one-sided central basis function $\rho _{ + }(x)$ that spans the same multiresolution subspaces. The central property is that the multiresolution bases are generated by simple translation of $\rho _{ + }$ without any dilation. We also present an explicit time-domain representation of a scaling function as a sum of harmonic splines. The leading term in the decomposition corresponds to the fractional splines: a recent, continuous-order generalization of the polynomial splines

A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity

The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design of image representations, which trade off between efficiency and complexity, while achieving accurate rendering of smooth regions as well as reproducing faithful contours and textures. The most recent ones, proposed in the past decade, share an hybrid heritage highlighting the multiscale and oriented nature of edges and patterns in images. This paper presents a panorama of the aforementioned literature on decompositions in multiscale, multi-orientation bases or dictionaries. They typically exhibit redundancy to improve sparsity in the transformed domain and sometimes its invariance with respect to simple geometric deformations (translation, rotation). Oriented multiscale dictionaries extend traditional wavelet processing and may offer rotation invariance. Highly redundant dictionaries require specific algorithms to simplify the search for an efficient (sparse) representation. We also discuss the extension of multiscale geometric decompositions to non-Euclidean domains such as the sphere or arbitrary meshed surfaces. The etymology of panorama suggests an overview, based on a choice of partially overlapping "pictures". We hope that this paper will contribute to the appreciation and apprehension of a stream of current research directions in image understanding.Comment: 65 pages, 33 figures, 303 reference

Wavelets and Subband Coding

First published in 1995, Wavelets and Subband Coding offered a unified view of the exciting field of wavelets and their discrete-time cousins, filter banks, or subband coding. The book developed the theory in both continuous and discrete time, and presented important applications. During the past decade, it filled a useful need in explaining a new view of signal processing based on flexible time-frequency analysis and its applications. Since 2007, the authors now retain the copyright and allow open access to the book

Reconstruction algorithms for multispectral diffraction imaging

Thesis (Ph.D.)--Boston UniversityIn conventional Computed Tomography (CT) systems, a single X-ray source spectrum is used to radiate an object and the total transmitted intensity is measured to construct the spatial linear attenuation coefficient (LAC) distribution. Such scalar information is adequate for visualization of interior physical structures, but additional dimensions would be useful to characterize the nature of the structures. By imaging using broadband radiation and collecting energy-sensitive measurement information, one can generate images of additional energy-dependent properties that can be used to characterize the nature of specific areas in the object of interest. In this thesis, we explore novel imaging modalities that use broadband sources and energy-sensitive detection to generate images of energy-dependent properties of a region, with the objective of providing high quality information for material component identification. We explore two classes of imaging problems: 1) excitation using broad spectrum sub-millimeter radiation in the Terahertz regime and measure- ment of the diffracted Terahertz (THz) field to construct the spatial distribution of complex refractive index at multiple frequencies; 2) excitation using broad spectrum X-ray sources and measurement of coherent scatter radiation to image the spatial distribution of coherent-scatter form factors. For these modalities, we extend approaches developed for multimodal imaging and propose new reconstruction algorithms that impose regularization structure such as common object boundaries across reconstructed regions at different frequencies. We also explore reconstruction techniques that incorporate prior knowledge in the form of spectral parametrization, sparse representations over redundant dictionaries and explore the advantage and disadvantages of these techniques in terms of image quality and potential for accurate material characterization. We use the proposed reconstruction techniques to explore alternative architectures with reduced scanning time and increased signal-to-noise ratio, including THz diffraction tomography, limited angle X-ray diffraction tomography and the use of coded aperture masks. Numerical experiments and Monte Carlo simulations were conducted to compare performances of the developed methods, and validate the studied architectures as viable options for imaging of energy-dependent properties

Complete Parametrization of Piecewise-Polynomial Interpolators According to Degree, Support, Regularity, and Order

The most essential ingredient of interpolation is its basis function. We have shown in previous papers that this basis need not be necessarily interpolating to achieve good results. On the contrary, several recent studies have confirmed that non-interpolating bases, such as B-splines and O-moms, perform best. This opens up a much wider choice of basis functions. In this paper, we give to the designer the tools that will allow him to characterize this enlarged space of functions. In particular, he will be able to specify up-front the four most important parameters for image processing: degree, support, regularity, and order. The theorems presented here will then allow him to refine his design by dealing with additional coefficients that can be selected freely, without interfering with the main design parameters