432 research outputs found
Multichannel sampling of finite rate of innovation signals
Recently there has been a surge of interest in sampling theory in signal processing
community. New efficient sampling techniques have been developed that allow
sampling and perfectly reconstructing some classes of non-bandlimited signals at
sub-Nyquist rates. Depending on the setup used and reconstruction method involved,
these schemes go under different names such as compressed sensing (CS),
compressive sampling or sampling signals with finite rate of innovation (FRI).
In this thesis we focus on the theory of sampling non-bandlimited signals
with parametric structure or specifically signals with finite rate of innovation. Most
of the theory on sampling FRI signals is based on a single acquisition device with
one-dimensional (1-D) signals. In this thesis, we extend these results to the case of
2-D signals and multichannel acquisition systems. The essential issue in multichannel
systems is that while each channel receives the input signal, it may introduce
different unknown delays, gains or affine transformations which need to be estimated
from the samples together with the signal itself. We pose both the calibration of
the channels and the signal reconstruction stage as a parametric estimation problem
and demonstrate that a simultaneous exact synchronization of the channels and reconstruction
of the FRI signal is possible. Furthermore, because in practice perfect
noise-free channels do not exist, we consider the case of noisy measurements and
show that by considering Cramer-Rao bounds as well as numerical simulations, the
multichannel systems are more resilient to noise than the single-channel ones.
Finally, we consider the problem of system identification based on the multichannel and finite rate of innovation sampling techniques. First, by employing our
multichannel sampling setup, we propose a novel algorithm for system identification
problem with known input signal, that is for the case when both the input signal and
the samples are known. Then we consider the problem of blind system identification
and propose a novel algorithm for simultaneously estimating the input FRI signal
and also the unknown system using an iterative algorithm
Wavelet Theory
The wavelet is a powerful mathematical tool that plays an important role in science and technology. This book looks at some of the most creative and popular applications of wavelets including biomedical signal processing, image processing, communication signal processing, Internet of Things (IoT), acoustical signal processing, financial market data analysis, energy and power management, and COVID-19 pandemic measurements and calculations. The editor’s personal interest is the application of wavelet transform to identify time domain changes on signals and corresponding frequency components and in improving power amplifier behavior
From spline wavelet to sampling theory on circulant graphs and beyond– conceiving sparsity in graph signal processing
Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing. As such, this thesis aspires to conceive the theory of sparse representations on graphs by traversing the cornerstones of wavelet and sampling theory on graphs.
Beginning with the novel topic of graph spline wavelet theory, we introduce families of spline and e-spline wavelets, and associated filterbanks on circulant graphs, which lever- age an inherent vanishing moment property of circulant graph Laplacian matrices (and their parameterized generalizations), for the reproduction and annihilation of (exponen- tial) polynomial signals. Further, these families are shown to provide a stepping stone to generalized graph wavelet designs with adaptive (annihilation) properties. Circulant graphs, which serve as building blocks, facilitate intuitively equivalent signal processing concepts and operations, such that insights can be leveraged for and extended to more complex scenarios, including arbitrary undirected graphs, time-varying graphs, as well as associated signals with space- and time-variant properties, all the while retaining the focus on inducing sparse representations.
Further, we shift from sparsity-inducing to sparsity-leveraging theory and present a novel sampling and graph coarsening framework for (wavelet-)sparse graph signals, inspired by Finite Rate of Innovation (FRI) theory and directly building upon (graph) spline wavelet theory. At its core, the introduced Graph-FRI-framework states that any K-sparse signal residing on the vertices of a circulant graph can be sampled and perfectly reconstructed from its dimensionality-reduced graph spectral representation of minimum size 2K, while the structure of an associated coarsened graph is simultaneously inferred. Extensions to arbitrary graphs can be enforced via suitable approximation schemes.
Eventually, gained insights are unified in a graph-based image approximation framework which further leverages graph partitioning and re-labelling techniques for a maximally sparse graph wavelet representation.Open Acces
Recommended from our members
Spatio-temporal directional analysis of 4D echocardiography
Speckle noise corrupts ultrasonic data by introducing sharp changes in an echocardiographic image intensity profile, while attenuation alters the intensity of equally significant cardiac structures. These properties introduce inhomogeneity in the spatial domain and suggests that measures based on phase information rather than intensity are more appropriate for denoising and cardiac border detection. The present analysis method relies on the expansion of temporal ultrasonic volume data on complex exponential wavelet-like basis functions called Brushlets. These basis functions decompose a signal into distinct patterns of oriented textures. Projected coefficients are associated with distinct 'brush strokes' of a particular size and orientation. 4D overcomplete brushlet analysis is applied to temporal echocardiographic values. We show that adding the time dimension in the analysis dramatically improves the quality and robustness of the method without adding complexity in the design of a segmentation tool. We have investigated mathematical and empirical methods for identifying the most 'efficient' brush stroke sizes and orientations for decomposition and reconstruction on both phantom and clinical data. In order to determine the 'best tiling' or equivalently, the 'best brushlet basis', we use an entropy-based information cost metric function. Quantitative validation and clinical applications of this new spatio-temporal analysis tool are reported for balloon phantoms and clinical data sets
Multiscale Representations for Manifold-Valued Data
We describe multiscale representations for data observed on equispaced grids and taking values in manifolds such as the sphere , the special orthogonal group , the positive definite matrices , and the Grassmann manifolds . The representations are based on the deployment of Deslauriers--Dubuc and average-interpolating pyramids "in the tangent plane" of such manifolds, using the and maps of those manifolds. The representations provide "wavelet coefficients" which can be thresholded, quantized, and scaled in much the same way as traditional wavelet coefficients. Tasks such as compression, noise removal, contrast enhancement, and stochastic simulation are facilitated by this representation. The approach applies to general manifolds but is particularly suited to the manifolds we consider, i.e., Riemannian symmetric spaces, such as , , , where the and maps are effectively computable. Applications to manifold-valued data sources of a geometric nature (motion, orientation, diffusion) seem particularly immediate. A software toolbox, SymmLab, can reproduce the results discussed in this paper
A flexible hardware architecture for 2-D discrete wavelet transform: design and FPGA implementation
The Discrete Wavelet Transform (DWT) is a powerful signal processing tool that has recently gained widespread acceptance in the field of digital image processing. The multiresolution analysis provided by the DWT addresses the shortcomings of the Fourier Transform and its derivatives. The DWT has proven useful in the area of image compression where it replaces the Discrete Cosine Transform (DCT) in new JPEG2000 and MPEG4 image and video compression standards. The Cohen-Daubechies-Feauveau (CDF) 5/3 and CDF 9/7 DWTs are used for reversible lossless and irreversible lossy compression encoders in the JPEG2000 standard respectively. The design and implementation of a flexible hardware architecture for the 2-D DWT is presented in this thesis. This architecture can be configured to perform both the forward and inverse DWT for any DWTfamily, using fixed-point arithmetic and no auxiliary memory. The Lifting Scheme method is used to perform the DWT instead of the less efficient convolution-based methods. The DWT core is modeled using MATLAB and highly parameterized VHDL. The VHDL model is synthesized to a Xilinx FPGA to prove hardware functionality. The CDF 5/3 and CDF 9/7 versions of the DWT are both modeled and used as comparisons throughout this thesis. The DWT core is used in conjunction with a very simple image denoising module to demonstrate the potential of the DWT core to perform image processing techniques. The CDF 5/3 hardware produces identical results to its theoretical MATLAB model. The fixed point CDF 9/7 deviates very slightly from its floating-point MATLAB model with a ~59dB PSNR deviation for nine levels of DWT decomposition. The execution time for performing both DWTs is nearly identical at -14 clock cycles per image pixel for one level of DWT decomposition. The hardware area generated for the CDF 5/3 is -16,000 gates using only 5% of the Xilinx FPGA hardware area, 2.185 MHz maximum clock speed and 24 mW power consumption. The simple wavelet image denoising techniques resulted in cleaned images up to -27 PSNR
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
- …