Signal processing of FMCW Synthetic Aperture Radar data

In the field of airborne earth observation there is special attention to compact, cost effective, high resolution imaging sensors. Such sensors are foreseen to play an important role in small-scale remote sensing applications, such as the monitoring of dikes, watercourses, or highways. Furthermore, such sensors are of military interest; reconnaissance tasks could be performed with small unmanned aerial vehicles (UAVs), reducing in this way the risk for one's own troops. In order to be operated from small, even unmanned, aircrafts, such systems must consume little power and be small enough to fulfill the usually strict payload requirements. Moreover, to be of interest for the civil market, cost effectiveness is mandatory. Frequency Modulated Continuous Wave (FMCW) radar systems are generally compact and relatively cheap to purchase and to exploit. They consume little power and, due to the fact that they are ...

Meta, Adriano — Delft University of Technology


Multichannel SAR Interferometry based on Statistical Signal Processing

Interferometric SAR systems allow to reconstruct height profile of earth surfaces. The height reconstruction is based on phase unwrapping operation, which is an ill-posed problem since it admits infinite number of solutions. The phase unwrapping problem can be solved using the multichannel InSAR approach, based on the combination of different images of the scene obtained by slightly different positions. An effective way to combine the different interferograms is using statistical estimation theory. In particular the Maximum Likelihood and Maximum a Posteriori multichannel approach have proved to be effective and to be able to restore the uniqueness of the solution. In this thesis the statistical multichannel phase unwrapping is deeply analyzed. In particular, instruments and methods to use InSAR multichannel configuration on real data and in urban areas are provided. Moreover, a new fast and efficient multichannel phase unwrapping algorithm is ...

Ferraioli, Giampaolo — Universita di Napoli Parthenope


Sparse Signal Recovery From Incomplete And Perturbed Data

Sparse signal recovery consists of algorithms that are able to recover undersampled high dimensional signals accurately. These algorithms require fewer measurements than traditional Shannon/Nyquist sampling theorem demands. Sparse signal recovery has found many applications including magnetic resonance imaging, electromagnetic inverse scattering, radar/sonar imaging, seismic data collection, sensor array processing and channel estimation. The focus of this thesis is on electromagentic inverse scattering problem and joint estimation of the frequency offset and the channel impulse response in OFDM. In the electromagnetic inverse scattering problem, the aim is to find the electromagnetic properties of unknown targets from measured scattered field. The reconstruction of closely placed point-like objects is investigated. The application of the greedy pursuit based sparse recovery methods, OMP and FTB-OMP, is proposed for increasing the reconstruction resolution. The performances of the proposed methods are compared against NESTA and MT-BCS methods. ...

Senyuva, Rifat Volkan — Bogazici University


Parallel Magnetic Resonance Imaging reconstruction problems using wavelet representations

To reduce scanning time or improve spatio-temporal resolution in some MRI applications, parallel MRI acquisition techniques with multiple coils have emerged since the early 90’s as powerful methods. In these techniques, MRI images have to be reconstructed from ac- quired undersampled “k-space” data. To this end, several reconstruction techniques have been proposed such as the widely-used SENSitivity Encoding (SENSE) method. However, the reconstructed images generally present artifacts due to the noise corrupting the ob- served data and coil sensitivity profile estimation errors. In this work, we present novel SENSE-based reconstruction methods which proceed with regularization in the complex wavelet domain so as to promote the sparsity of the solution. These methods achieve ac- curate image reconstruction under degraded experimental conditions, in which neither the SENSE method nor standard regularized methods (e.g. Tikhonov) give convincing results. The proposed approaches relies on ...

Lotfi CHAARI — University Paris-Est


Analysis, Modelling, and Simulation of an Integrated Multisensor System for Maritime Border Control

In this dissertation a notional multi-sensor system acting in a maritime border control scenario for Homeland Security (HS) is analyzed, modelled, and simulated. The functions performed by the system are the detection, tracking, identification and classification of naval targets that enter a sea region, the evaluation of their threat level and the selection of a suitable reaction to them. The emulated system is composed of two platforms carrying multiple sensors: a land based platform, located on the coast, and an air platform, moving on an elliptic trajectory in front of the coast. The land based platform is equipped with a Vessel Traffic Service (VTS) radar, an infrared camera (IR) and a station belonging to an Automatic Identification System (AIS). The air platform carries an Airborne Early Warning Radar (AEWR) that can operate on a spotlight Synthetic Aperture Radar (SAR) mode, ...

Giompapa, Sofia — Universita di Pisa


Solving inverse problems in room acoustics using physical models, sparse regularization and numerical optimization

Reverberation consists of a complex acoustic phenomenon that occurs inside rooms. Many audio signal processing methods, addressing source localization, signal enhancement and other tasks, often assume absence of reverberation. Consequently, reverberant environments are considered challenging as state-ofthe-art methods can perform poorly. The acoustics of a room can be described using a variety of mathematical models, among which, physical models are the most complete and accurate. The use of physical models in audio signal processing methods is often non-trivial since it can lead to ill-posed inverse problems. These inverse problems require proper regularization to achieve meaningful results and involve the solution of computationally intensive large-scale optimization problems. Recently, however, sparse regularization has been applied successfully to inverse problems arising in different scientific areas. The increased computational power of modern computers and the development of new efficient optimization algorithms makes it possible ...

Antonello, Niccolò — KU Leuven


Bayesian Compressed Sensing using Alpha-Stable Distributions

During the last decades, information is being gathered and processed at an explosive rate. This fact gives rise to a very important issue, that is, how to effectively and precisely describe the information content of a given source signal or an ensemble of source signals, such that it can be stored, processed or transmitted by taking into consideration the limitations and capabilities of the several digital devices. One of the fundamental principles of signal processing for decades is the Nyquist-Shannon sampling theorem, which states that the minimum number of samples needed to reconstruct a signal without error is dictated by its bandwidth. However, there are many cases in our everyday life in which sampling at the Nyquist rate results in too many data and thus, demanding an increased processing power, as well as storage requirements. A mathematical theory that emerged ...

Tzagkarakis, George — University of Crete


Parametric and non-parametric approaches for multisensor data fusion

Multisensor data fusion technology combines data and information from multiple sensors to achieve improved accuracies and better inference about the environment than could be achieved by the use of a single sensor alone. In this dissertation, we propose parametric and nonparametric multisensor data fusion algorithms with a broad range of applications. Image registration is a vital first step in fusing sensor data. Among the wide range of registration techniques that have been developed for various applications, mutual information based registration algorithms have been accepted as one of the most accurate and robust methods. Inspired by the mutual information based approaches, we propose to use the joint R´enyi entropy as the dissimilarity metric between images. Since the R´enyi entropy of an image can be estimated with the length of the minimum spanning tree over the corresponding graph, the proposed information-theoretic registration ...

Ma, Bing — University of Michigan


Antenna Array Processing: Autocalibration and Fast High-Resolution Methods for Automotive Radar

In this thesis, advanced techniques for antenna array processing are addressed. The problem of autocalibration is considered and a novel method for a two-dimensional array is developed. Moreover, practicable methods for high-resolution direction-of-arrival (DOA) estimation and detection in automotive radar are proposed. A precise model of the array response is required to maintain the performance of DOA estimation. When the sensor environment is time-varying, this can only be achieved with autocalibration. The fundamental problem of autocalibration of an unknown phase response for uniform rectangular arrays is considered. For the case with a single source, a simple and robust least squares algorithm for joint two-dimensional DOA estimation and phase calibration is developed. An identification problem is determined and a suitable constraint is proposed. Simulation results show that the performance of the proposed estimator is close to the approximate CRB for both ...

Heidenreich, Philipp — Technische Universität Darmstadt


Film and Video Restoration using Rank-Order Models

This thesis introduces the rank-order model and investigates its use in several image restoration problems. More commonly used as filters, the rank-order operators are here employed as predictors. A Laplacian excitation sequence is chosen to complete the model. Images are generated with the model and compared with those formed with an AR model. A multidimensional rankorder model is formed from vector medians for use with multidimensional image data. The first application using the rank-order model is an impulsive noise detector. This exploits the notion of ‘multimodality’ in the histogram of a difference image of the degraded image and a rank-order filtered version. It uses the EM algorithm and a mixture model to automatically determine thresholds for detecting the impulsive noise. This method compares well with other detection methods, which require manual setting of thresholds, and to stack filtering, which requires ...

Armstrong, Steven — University of Cambridge


Cosparse regularization of physics-driven inverse problems

Inverse problems related to physical processes are of great importance in practically every field related to signal processing, such as tomography, acoustics, wireless communications, medical and radar imaging, to name only a few. At the same time, many of these problems are quite challenging due to their ill-posed nature. On the other hand, signals originating from physical phenomena are often governed by laws expressible through linear Partial Differential Equations (PDE), or equivalently, integral equations and the associated Green’s functions. In addition, these phenomena are usually induced by sparse singularities, appearing as sources or sinks of a vector field. In this thesis we primarily investigate the coupling of such physical laws with a prior assumption on the sparse origin of a physical process. This gives rise to a “dual” regularization concept, formulated either as sparse analysis (cosparse), yielded by a PDE ...

Kitić, Srđan — Université de Rennes 1


On some aspects of inverse problems in image processing

This work is concerned with two image-processing problems, image deconvolution with incomplete observations and data fusion of spectral images, and with some of the algorithms that are used to solve these and related problems. In image-deconvolution problems, the diagonalization of the blurring operator by means of the discrete Fourier transform usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard deconvolution techniques normally involve non-diagonalizable operators, resulting in rather slow methods, or, otherwise, use inexact convolution models, resulting in the occurrence of artifacts in the enhanced images. We propose a new deconvolution framework for images with incomplete observations that allows one to work with diagonalizable convolution operators, and therefore is very fast. The framework is also an efficient, high-quality alternative to existing methods of dealing with the image boundaries, such as edge ...

Simões, Miguel — Universidade de Lisboa, Instituto Superior Técnico & Université Grenoble Alpes


Robust Network Topology Inference and Processing of Graph Signals

The abundance of large and heterogeneous systems is rendering contemporary data more pervasive, intricate, and with a non-regular structure. With classical techniques facing troubles to deal with the irregular (non-Euclidean) domain where the signals are defined, a popular approach at the heart of graph signal processing (GSP) is to: (i) represent the underlying support via a graph and (ii) exploit the topology of this graph to process the signals at hand. In addition to the irregular structure of the signals, another critical limitation is that the observed data is prone to the presence of perturbations, which, in the context of GSP, may affect not only the observed signals but also the topology of the supporting graph. Ignoring the presence of perturbations, along with the couplings between the errors in the signal and the errors in their support, can drastically hinder ...

Rey, Samuel — King Juan Carlos University


Bayesian Approaches in Image Source Seperation

In this thesis, a general solution to the component separation problem in images is introduced. Unlike most existing works, the spatial dependencies of images are modelled in the separation process with the use of Markov random fields (MRFs). In the MRFs model, Cauchy density is used for the gradient images. We provide a general Bayesian framework for the estimation of the parameters of this model. Due to the intractability of the problem we resort to numerical solutions for the joint maximization of the a posteriori distribution of the sources, the mixing matrix and the noise variances. For numerical solution, four different methods are proposed. In first method, the difficulty of working analytically with general Gibbs distributions of MRF is overcome by using an approximate density. In this approach, the Gibbs distribution is modelled by the product of directional Gaussians. The ...

Kayabol, Koray — Istanbul University


Wireless Network Localization via Cooperation

This dissertation details two classes of cooperative localization methods for wireless networks in mixed line-of-sight and non-line-of-sight (LOS/NLOS) environments. The classes of methods depend on the amount of prior knowledge available. The methods used for both classes are based on the assumptions in practical localization environments that neither NLOS identification nor experimental campaigns are affordable. Two major contributions are, first, in methods that provide satisfactory localization accuracy whilst relaxing the requirement on statistical knowledge about the measurement model. Second, in methods that provide significantly improved localization performance without the requirement of good initialization. In the first half of the dissertation, cooperative localization using received signal strength (RSS) measurements in homogeneous mixed LOS/NLOS environments is considered for the case where the key model parameter, the path loss exponent, is unknown. The approach taken is to model the positions and the path ...

Jin, Di — Signal Processing Group, Technische Universität Darmstadt

The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.

The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.