Feature Extraction for image super-resolution using finite rate of innovation principles

To understand a real-world scene from several multiview pictures, it is necessary to find the disparities existing between each pair of images so that they are correctly related to one another. This process, called image registration, requires the extraction of some specific information about the scene. This is achieved by taking features out of the acquired images. Thus, the quality of the registration depends largely on the accuracy of the extracted features. Feature extraction can be formulated as a sampling problem for which perfect re- construction of the desired features is wanted. The recent sampling theory for signals with finite rate of innovation (FRI) and the B-spline theory offer an appropriate new frame- work for the extraction of features in real images. This thesis first focuses on extending the sampling theory for FRI signals to a multichannel case and then presents exact sampling results for two different types of image features used for registration: moments and edges. In the first part, it is shown that the geometric moments of an observed scene can be retrieved exactly from sampled images and used as global features for registration. The second part describes how edges can also be retrieved perfectly from sampled images for registration purposes. The proposed feature extraction schemes therefore allow in theory the exact registration of images. Indeed, various simulations show that the proposed extraction/registration methods overcome traditional ones, especially at low-resolution. These characteristics make such feature extraction techniques very appropriate for applications like image super-resolution for which a very precise registration is needed. The quality of the super-resolved images obtained using the proposed feature extraction meth- ods is improved by comparison with other approaches. Finally, the notion of polyphase components is used to adapt the image acquisition model to the characteristics of real digital cameras in order to run super-resolution experiments on real images

Feature Extraction for Image Super-resolution using Finite Rate of Innovation Principles

To understand a real-world scene from several multiview pictures, it is necessary to find the disparities existing between each pair of images so that they are correctly related to one another., This process. called image registration, reguires the extraction of some specific information about the scene. This is achieved by taking features out of the acquired imaqes. Thus, the quality of the, registration depends largely on the accuracy of the extracted features. Feature extraction can be formulated as a sampling problem for which perfect reconstruction of the, desired features is wanted. The recent sampling theory for signals with finite rate of innovation (FR/), and the B-spline theory offer an appropriate new framework for the extraction of features in real, images. This thesis first focuses on extending the sampling theory for FRI signals to a multichannel, case and then presents exact sampling results for two different types of image features used for, registration: moments and edges. In the first part, it is shown that the geometric moments of an observed scene can be retrieved exactly from sampled images and used as global features for registration. The second part describes how edges can also be retrieved perfectly from sampled images for registration purposes. The proposed feature extraction schemes therefore allow in theory the exact registration of images. Indeed, various simulations show that the proposed extraction/registration methods overcome traditional ones, especially at low-resolution. These characteristics make such feature extraction techniques very appropriate for applications like image super-resolution for which a very precise registration is needed. The quality of the superresolved images obtained using the proposed feature extraction methods is improved by comparison with other approaches. Finally, the notion of polyphase components is used to adapt the imaqe acquisition model to the characteristics of real digital cameras in order to run super-resolution experiments on real images

Motion-Compensated Image Reconstruction for Magnetic Resonance (MR) Imaging and for Simultaneous Positron Emission Tomography/MR Imaging

In this work, novel algorithms for 4D (3D + respiratory) and 5D (3D + respiratory + cardiac) motion-compensated (MoCo) magnetic resonance (MR) and positron emission tomography (PET) image reconstruction were developed. The focus of all methods was set on short MR acquisition times. Therefore, respiratory and cardiac patient motion were estimated on the basis of strongly undersampled radial MR data employing joint motion estimation and MR image reconstruction. In case of simultaneous PET/MR acquisitions, motion information derived from MR was incorporated into the MoCo PET reconstruction. 4D respiratory MoCo MR image reconstructions with acquisition times of 40 s achieved an image quality comparable to standard motion handling approaches, which require one order of magnitude longer MR acquisition times. Respiratory MoCo PET images using 1 min of the MR acquisition time for motion estimation revealed improved PET image quality and quantification accuracy when compared to standard reconstruction methods. Additional compensation of cardiac motion resulted in increased image sharpness of MR and PET images in the heart region and enabled time-resolved 5D imaging allowing for reconstruction of any arbitrary combination of respiratory and cardiac motion phases. The proposed methods for MoCo image reconstruction may be integrated into clinical routine, reducing MR acquisition times for improved patient comfort and increasing the diagnostic value of MR and simultaneous PET/MR examinations of the thorax and abdomen

Three Dimensional Bistatic Tomography Using HDTV

The thesis begins with a review of the principles of diffraction and reflection tomography; starting with the analytic solution to the inhomogeneous Helmholtz equation, after linearization by the Born approximation (the weak scatterer solution), and arriving at the Filtered Back Projection (Propagation) method of reconstruction. This is followed by a heuristic derivation more directly couched in the radar imaging context, without the rigor of the general inverse problem solution and more closely resembling an imaging turntable or inverse synthetic aperture radar. The heuristic derivation leads into the concept of the line integral and projections (the Radon Transform), followed by more general geometries where the plane wave approximation is invalid. We proceed next to study of the dependency of reconstruction on the space-frequency trajectory, combining the spatial aperture and waveform. Two and three dimensional apertures, monostatic and bistatic, fully and sparsely sampled and including partial apertures, with controlled waveforms (CW and pulsed, with and without modulation) define the filling of k-space and concomitant reconstruction performance. Theoretical developments in the first half of the thesis are applied to the specific example of bistatic tomographic imaging using High Definition Television (HDTV); the United States version of DVB-T. Modeling of the HDTV waveform using pseudonoise modulation to represent the hybrid 8VSB HDTV scheme and the move-stop-move approximation established the imaging potential, employing an idealized, isotropic 18 scatterer. As the move-stop-move approximation places a limitation on integration time (in cross correlation/pulse compression) due to transmitter/receiver motion, an exact solution for compensation of Doppler distortion is derived. The concept is tested with the assembly and flight test of a bistatic radar system employing software-defined radios (SDR). A three dimensional, bistatic collection aperture, exploiting an elevated commercial HDTV transmitter, is focused to demonstrate the principle. This work, to the best of our knowledge, represents a first in the formation of three dimensional images using bistatically-exploited television transmitters

Discrete Wavelet Transforms

The discrete wavelet transform (DWT) algorithms have a firm position in processing of signals in several areas of research and industry. As DWT provides both octave-scale frequency and spatial timing of the analyzed signal, it is constantly used to solve and treat more and more advanced problems. The present book: Discrete Wavelet Transforms: Algorithms and Applications reviews the recent progress in discrete wavelet transform algorithms and applications. The book covers a wide range of methods (e.g. lifting, shift invariance, multi-scale analysis) for constructing DWTs. The book chapters are organized into four major parts. Part I describes the progress in hardware implementations of the DWT algorithms. Applications include multitone modulation for ADSL and equalization techniques, a scalable architecture for FPGA-implementation, lifting based algorithm for VLSI implementation, comparison between DWT and FFT based OFDM and modified SPIHT codec. Part II addresses image processing algorithms such as multiresolution approach for edge detection, low bit rate image compression, low complexity implementation of CQF wavelets and compression of multi-component images. Part III focuses watermaking DWT algorithms. Finally, Part IV describes shift invariant DWTs, DC lossless property, DWT based analysis and estimation of colored noise and an application of the wavelet Galerkin method. The chapters of the present book consist of both tutorial and highly advanced material. Therefore, the book is intended to be a reference text for graduate students and researchers to obtain state-of-the-art knowledge on specific applications

Efficient compression of motion compensated residuals

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

A Decade of Neural Networks: Practical Applications and Prospects

The Jet Propulsion Laboratory Neural Network Workshop, sponsored by NASA and DOD, brings together sponsoring agencies, active researchers, and the user community to formulate a vision for the next decade of neural network research and application prospects. While the speed and computing power of microprocessors continue to grow at an ever-increasing pace, the demand to intelligently and adaptively deal with the complex, fuzzy, and often ill-defined world around us remains to a large extent unaddressed. Powerful, highly parallel computing paradigms such as neural networks promise to have a major impact in addressing these needs. Papers in the workshop proceedings highlight benefits of neural networks in real-world applications compared to conventional computing techniques. Topics include fault diagnosis, pattern recognition, and multiparameter optimization