Introduction to frames

This survey gives an introduction to redundant signal representations called frames. These representations have recently emerged as yet another powerful tool in the signal processing toolbox and have become popular through use in numerous applications. Our aim is to familiarize a general audience with the area, while at the same time giving a snapshot of the current state-of-the-art

Directional multiresolution image representations

Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an object of interest in a small description. For practical applications, this representation has to be realized by structured transforms and fast algorithms. Recently, it has become evident that commonly used separable transforms (such as wavelets) are not necessarily best suited for images. Thus, there is a strong motivation to search for more powerful schemes that can capture the intrinsic geometrical structure of pictorial information. This thesis focuses on the development of new "true" two-dimensional representations for images. The emphasis is on the discrete framework that can lead to algorithmic implementations. The first method constructs multiresolution, local and directional image expansions by using non-separable filter banks. This discrete transform is developed in connection with the continuous-space curvelet construction in harmonic analysis. As a result, the proposed transform provides an efficient representation for two-dimensional piecewise smooth signals that resemble images. The link between the developed filter banks and the continuous-space constructions is set up in a newly defined directional multiresolution analysis. The second method constructs a new family of block directional and orthonormal transforms based on the ridgelet idea, and thus offers an efficient representation for images that are smooth away from straight edges. Finally, directional multiresolution image representations are employed together with statistical modeling, leading to powerful texture models and successful image retrieval systems

Computing Intelligence Technique and Multiresolution Data Processing for Condition Monitoring

Condition monitoring (CM) of rotary machines has gained increasing importance and extensive research in recent years. Due to the rapid growth of data volume, automated data processing is necessary in order to deal with massive data efficiently to produce timely and accurate diagnostic results. Artificial intelligence (AI) and adaptive data processing approaches can be promising solutions to the challenge of large data volume. Unfortunately, the majority of AI-based techniques in CM have been developed for only the post-processing (classification) stage, whereas the critical tasks including feature extraction and selection are still manually processed, which often require considerable time and efforts but also yield a performance depending on prior knowledge and diagnostic expertise. To achieve an automatic data processing, the research of this PhD project provides an integrated framework with two main approaches. Firstly, it focuses on extending AI techniques in all phases, including feature extraction by applying Componential Coding Neural Network (CCNN) which has been found to have unique properties of being trained through unsupervised learning, capable of dealing with raw datasets, translation invariance and high computational efficiency. These advantages of CCNN make it particularly suitable for automated analyzing of the vibration data arisen from typical machine components such as the rolling element bearings which exhibit periodic phenomena with high non-stationary and strong noise contamination. Then, once an anomaly is detected, a further analysis technique to identify the fault is proposed using a multiresolution data analysis approach based on Double-Density Discrete Wavelet Transform (DD-DWT) which was grounded on over-sampled filter banks with smooth tight frames. This makes it nearly shift-invariant which is important for extracting non-stationary periodical peaks. Also, in order to denoise and enhance the diagnostic features, a novel level-dependant adaptive thresholding method based on harmonic to signal ratio (HSR) is developed and implemented on the selected wavelet coefficients. This method has been developed to be a semi-automated (adaptive) approach to facilitate the process of fault diagnosis. The developed framework has been evaluated using both simulated and measured datasets from typical healthy and defective tapered roller bearings which are critical parts of all rotating machines. The results have demonstrated that the CCNN is a robust technique for early fault detection, and also showed that adaptive DD-DWT is a robust technique for diagnosing the faults induced to test bearings. The developed framework has achieved multi-objectives of high detection sensitivity, reliable diagnosis and minimized computing complexity

Signal processing with Fourier analysis, novel algorithms and applications

Fourier analysis is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions, also analogously known as sinusoidal modeling. The original idea of Fourier had a profound impact on mathematical analysis, physics and engineering because it diagonalizes time-invariant convolution operators. In the past signal processing was a topic that stayed almost exclusively in electrical engineering, where only the experts could cancel noise, compress and reconstruct signals. Nowadays it is almost ubiquitous, as everyone now deals with modern digital signals. Medical imaging, wireless communications and power systems of the future will experience more data processing conditions and wider range of applications requirements than the systems of today. Such systems will require more powerful, efficient and flexible signal processing algorithms that are well designed to handle such needs. No matter how advanced our hardware technology becomes we will still need intelligent and efficient algorithms to address the growing demands in signal processing. In this thesis, we investigate novel techniques to solve a suite of four fundamental problems in signal processing that have a wide range of applications. The relevant equations, literature of signal processing applications, analysis and final numerical algorithms/methods to solve them using Fourier analysis are discussed for different applications in the electrical engineering/computer science. The first four chapters cover the following topics of central importance in the field of signal processing: • Fast Phasor Estimation using Adaptive Signal Processing (Chapter 2) • Frequency Estimation from Nonuniform Samples (Chapter 3) • 2D Polar and 3D Spherical Polar Nonuniform Discrete Fourier Transform (Chapter 4) • Robust 3D registration using Spherical Polar Discrete Fourier Transform and Spherical Harmonics (Chapter 5) Even though each of these four methods discussed may seem completely disparate, the underlying motivation for more efficient processing by exploiting the Fourier domain signal structure remains the same. The main contribution of this thesis is the innovation in the analysis, synthesis, discretization of certain well known problems like phasor estimation, frequency estimation, computations of a particular non-uniform Fourier transform and signal registration on the transformed domain. We conduct propositions and evaluations of certain applications relevant algorithms such as, frequency estimation algorithm using non-uniform sampling, polar and spherical polar Fourier transform. The techniques proposed are also useful in the field of computer vision and medical imaging. From a practical perspective, the proposed algorithms are shown to improve the existing solutions in the respective fields where they are applied/evaluated. The formulation and final proposition is shown to have a variety of benefits. Future work with potentials in medical imaging, directional wavelets, volume rendering, video/3D object classifications, high dimensional registration are also discussed in the final chapter. Finally, in the spirit of reproducible research we release the implementation of these algorithms to the public using Github

Sampling methods for parametric non-bandlimited signals:extensions and applications

Sampling theory has experienced a strong research revival over the past decade, which led to a generalization of Shannon's original theory and development of more advanced formulations with immediate relevance to signal processing and communications. For example, it was recently shown that it is possible to develop exact sampling schemes for a large class of non-bandlimited signals, namely, certain signals with finite rate of innovation. A common feature of such signals is that they have a parametric representation with a finite number of degrees of freedom and can be perfectly reconstructed from a finite number of samples. The goal of this thesis is to advance the sampling theory for signals of finite rate of innovation and consider its possible extensions and applications. In the first part of the thesis, we revisit the sampling problem for certain classes of such signals, including non-uniform splines and piecewise polynomials, and develop improved schemes that allow for stable and precise reconstruction in the presence of noise. Specifically, we develop a subspace approach to signal reconstruction, which converts a nonlinear estimation problem into the simpler problem of estimating the parameters of a linear model. This provides an elegant and robust framework for solving a large class of sampling problems, while offering more flexibility than the traditional scheme for bandlimited signals. In the second part of the thesis, we focus on applications of our results to certain classes of nonlinear estimation problems encountered in wideband communication systems, most notably ultra-wideband (UWB) systems, where the bandwidth used for transmission is much larger than the bandwidth or rate of information being sent. We develop several frequency domain methods for channel estimation and synchronization in UWB systems, which yield high-resolution estimates of all relevant channel parameters by sampling a received signal below the traditional Nyquist rate. We also propose algorithms that are suitable for identification of more realistic UWB channel models, where a received signal is made up of pulses with different pulse shapes. Finally, we extend our results to multidimensional signals, and develop exact sampling schemes for certain classes of parametric non-bandlimited 2-D signals, such as sets of 2-D Diracs, polygons or signals with polynomial boundaries

Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demonstrated that structured signals can be acquired with just a small number of linear measurements, on the order of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sampling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs accommodate the otherwise limiting quantizer of conventional ADCs. In this thesis, we consider a different approach to CS ADC by shifting towards lower quantizer bit-depths rather than lower sampling rates. We explore the extreme case where each measurement is quantized to just one bit, representing its sign. We develop a new theoretical framework to analyze this extreme case and develop new algorithms for signal reconstruction from such coarsely quantized measurements. The 1-bit CS framework leads us to scenarios where it may be more appropriate to reduce bit-depth instead of sampling rate. We find that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement compression (MC) regime, a high SNR favors acquiring fewer measurements with more bits per measurement (as in conventional CS); in the quantization compression (QC) regime, a low SNR favors acquiring more measurements with fewer bits per measurement (as in this thesis). A surprise from our analysis and experiments is that in many practical applications it is better to operate in the QC regime, even acquiring as few as 1 bit per measurement. The above philosophy extends further to practical CS ADC system designs. We propose two new CS architectures, one of which takes advantage of the fact that the sampling and quantization operations are performed by two different hardware components. The former can be employed at high rates with minimal costs while the latter cannot. Thus, we develop a system that discretizes in time, performs CS preconditioning techniques, and then quantizes at a low rate