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

WAVELET PACKET FRAME-BASED IMAGE RESTORATION MODELS AND THEIR ASYMPTOTIC ANALYSIS

Ph.DDOCTOR OF PHILOSOPH

A Survey of Signal Processing Problems and Tools in Holographic Three-Dimensional Television

Cataloged from PDF version of article.Diffraction and holography are fertile areas for application of signal theory and processing. Recent work on 3DTV displays has posed particularly challenging signal processing problems. Various procedures to compute Rayleigh-Sommerfeld, Fresnel and Fraunhofer diffraction exist in the literature. Diffraction between parallel planes and tilted planes can be efficiently computed. Discretization and quantization of diffraction fields yield interesting theoretical and practical results, and allow efficient schemes compared to commonly used Nyquist sampling. The literature on computer-generated holography provides a good resource for holographic 3DTV related issues. Fast algorithms to compute Fourier, Walsh-Hadamard, fractional Fourier, linear canonical, Fresnel, and wavelet transforms, as well as optimization-based techniques such as best orthogonal basis, matching pursuit, basis pursuit etc., are especially relevant signal processing techniques for wave propagation, diffraction, holography, and related problems. Atomic decompositions, multiresolution techniques, Gabor functions, and Wigner distributions are among the signal processing techniques which have or may be applied to problems in optics. Research aimed at solving such problems at the intersection of wave optics and signal processing promises not only to facilitate the development of 3DTV systems, but also to contribute to fundamental advances in optics and signal processing theory. © 2007 IEEE

Wavelet Analysis on the Sphere

The goal of this monograph is to develop the theory of wavelet harmonic analysis on the sphere. By starting with orthogonal polynomials and functional Hilbert spaces on the sphere, the foundations are laid for the study of spherical harmonics such as zonal functions. The book also discusses the construction of wavelet bases using special functions, especially Bessel, Hermite, Tchebychev, and Gegenbauer polynomials

Geometric Surface Processing and Virtual Modeling

In this work we focus on two main topics "Geometric Surface Processing" and "Virtual Modeling". The inspiration and coordination for most of the research work contained in the thesis has been driven by the project New Interactive and Innovative Technologies for CAD (NIIT4CAD), funded by the European Eurostars Programme. NIIT4CAD has the ambitious aim of overcoming the limitations of the traditional approach to surface modeling of current 3D CAD systems by introducing new methodologies and technologies based on subdivision surfaces in a new virtual modeling framework. These innovations will allow designers and engineers to transform quickly and intuitively an idea of shape in a high-quality geometrical model suited for engineering and manufacturing purposes. One of the objective of the thesis is indeed the reconstruction and modeling of surfaces, representing arbitrary topology objects, starting from 3D irregular curve networks acquired through an ad-hoc smart-pen device. The thesis is organized in two main parts: "Geometric Surface Processing" and "Virtual Modeling". During the development of the geometric pipeline in our Virtual Modeling system, we faced many challenges that captured our interest and opened new areas of research and experimentation. In the first part, we present these theories and some applications to Geometric Surface Processing. This allowed us to better formalize and give a broader understanding on some of the techniques used in our latest advancements on virtual modeling and surface reconstruction. The research on both topics led to important results that have been published and presented in articles and conferences of international relevance

Multidimensional Wavelets and Computer Vision

This report deals with the construction and the mathematical analysis of multidimensional nonseparable wavelets and their efficient application in computer vision. In the first part, the fundamental principles and ideas of multidimensional wavelet filter design such as the question for the existence of good scaling matrices and sensible design criteria are presented and extended in various directions. Afterwards, the analytical properties of these wavelets are investigated in some detail. It will turn out that they are especially well-suited to represent (discretized) data as well as large classes of operators in a sparse form - a property that directly yields efficient numerical algorithms. The final part of this work is dedicated to the application of the developed methods to the typical computer vision problems of nonlinear image regularization and the computation of optical flow in image sequences. It is demonstrated how the wavelet framework leads to stable and reliable results for these problems of generally ill-posed nature. Furthermore, all the algorithms are of order O(n) leading to fast processing

Quaternion Matrices : Statistical Properties and Applications to Signal Processing and Wavelets

Similarly to how complex numbers provide a possible framework for extending scalar signal processing techniques to 2-channel signals, the 4-dimensional hypercomplex algebra of quaternions can be used to represent signals with 3 or 4 components. For a quaternion random vector to be suited for quaternion linear processing, it must be (second-order) proper. We consider the likelihood ratio test (LRT) for propriety, and compute the exact distribution for statistics of Box type, which include this LRT. Various approximate distributions are compared. The Wishart distribution of a quaternion sample covariance matrix is derived from first principles. Quaternions are isomorphic to an algebra of structured 4x4 real matrices. This mapping is our main tool, and suggests considering more general real matrix problems as a way of investigating quaternion linear algorithms. A quaternion vector autoregressive (VAR) time-series model is equivalent to a structured real VAR model. We show that generalised least squares (and Gaussian maximum likelihood) estimation of the parameters reduces to ordinary least squares, but only if the innovations are proper. A LRT is suggested to simultaneously test for quaternion structure in the regression coefficients and innovation covariance. Matrix-valued wavelets (MVWs) are generalised (multi)wavelets for vector-valued signals. Quaternion wavelets are equivalent to structured MVWs. Taking into account orthogonal similarity, all MVWs can be constructed from non-trivial MVWs. We show that there are no non-scalar non-trivial MVWs with short support [0,3]. Through symbolic computation we construct the families of shortest non-trivial 2x2 Daubechies MVWs and quaternion Daubechies wavelets.Open Acces

Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms.

The marching-on-in-time (MOT)-based time domain integral equation solvers provide an appealing avenue for solving transient electromagnetic scattering/radiation problems. These state-of-the-art solvers are high-order accurate, rapidly converging and low-/high-frequency stable. Moreover, their computational efficiencies can be significantly improved by accelerators such as the multilevel plane-wave time-domain (PWTD) algorithm. However, practical transient electromagnetic problems involving millions of spatial unknowns and thousands of time steps were barely solved by PWTD-accelerated MOT solvers. This is due to the lack of (i) an efficient parallelization scheme for PWTD’s heterogeneous structure on modern computing platforms, and (ii) a temporal/angular/spatial adaptive PWTD that further improves the computational efficiency. The contributions of this work are as follows: First, a provably scalable parallelization scheme for the PWTD algorithm is developed. The proposed scheme scales well on thousands of CPU processors upon hierarchically partitioning the workloads in spatial, angular and temporal dimensions. The proposed scheme is adopted to time domain surface/volume integral equations (TD-SIE/TD-VIE) solvers for analyzing transient scattering from large and complex-shaped conducting/dielectric objects involving ten million/tens of millions of spatial unknowns. In addition, we developed a single/multiple graphics processing units (GPU) implementation of the PWTD algorithm that achieves at least one order of magnitude speedups compared to serial CPU implementations. Second, a wavelet compression scheme based on local cosine bases (LCBs) that exploits the sparsity in the temporal dimension is developed. All PWTD operations are performed in the wavelet domain with reduced computational complexity. The resultant wavelet-enhanced TD-SIE solver is capable of analyzing transient scattering from smooth quasi-planar conducting objects spanning well over one hundred wavelengths.PhDElectrical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/113642/1/liuyangz_1.pd