SAR image reconstruction by expectation maximization based matching pursuit

Cataloged from PDF version of article.Synthetic Aperture Radar (SAR) provides high resolution images of terrain and target reflectivity. SAR systems are indispensable in many remote sensing applications. Phase errors due to uncompensated platform motion degrade resolution in reconstructed images. A multitude of autofocusing techniques has been proposed to estimate and correct phase errors in SAR images. Some autofocus techniques work as a post-processor on reconstructed images and some are integrated into the image reconstruction algorithms. Compressed Sensing (CS), as a relatively new theory, can be applied to sparse SAR image reconstruction especially in detection of strong targets. Autofocus can also be integrated into CS based SAR image reconstruction techniques. However, due to their high computational complexity, CS based techniques are not commonly used in practice. To improve efficiency of image reconstruction we propose a novel CS based SAR imaging technique which utilizes recently proposed Expectation Maximization based Matching Pursuit (EMMP) algorithm. EMMP algorithm is greedy and computationally less complex enabling fast SAR image reconstructions. The proposed EMMP based SAR image reconstruction technique also performs autofocus and image reconstruction simultaneously. Based on a variety of metrics, performance of the proposed EMMP based SAR image reconstruction technique is investigated. The obtained results show that the proposed technique provides high resolution images of sparse target scenes while performing highly accurate motion compensation. (C) 2014 Elsevier Inc. All rights reserved

Novel methods for SAR imaging problems

Ankara : The Department of Electrical and Electronics Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013.Thesis (Ph. D.) -- Bilkent University, 2013.Includes bibliographical references leaves 62-70.Synthetic Aperture Radar (SAR) provides high resolution images of terrain reflectivity. SAR systems are indispensable in many remote sensing applications. High resolution imaging of terrain requires precise position information of the radar platform on its flight path. In target detection and identification applications, imaging of sparse reflectivity scenes is a requirement. In this thesis, novel SAR image reconstruction techniques for sparse target scenes are developed. These techniques differ from earlier approaches in their ability of simultaneous image reconstruction and motion compensation. It is shown that if the residual phase error after INS/GPS corrected platform motion is captured in the signal model, then the optimal autofocused image formation can be formulated as a sparse reconstruction problem. In the first proposed technique, Non-Linear Conjugate Gradient Descent algorithm is used to obtain the optimum reconstruction. To increase robustness in the reconstruction, Total Variation penalty is introduced into the cost function of the optimization. To reduce the rate of A/D conversion and memory requirements, a specific under sampling pattern is introduced. In the second proposed technique, Expectation Maximization Based Matching Pursuit (EMMP) algorithm is utilized to obtain the optimum sparse SAR reconstruction. EMMP algorithm is greedy and computationally less complex resulting in fast SAR image reconstructions. Based on a variety of metrics, performances of the proposed techniques are compared. It is observed that the EMMP algorithm has an additional advantage of reconstructing off-grid targets by perturbing on-grid basis vectors on a finer grid.Uğur, SalihPh.D

Off-grid sparse SAR image reconstruction by EMMP algorithm

A new and robust sparse SAR image reconstruction technique is proposed for off-grid targets in the CS framework. In the proposed approach, basis vectors corresponding to on-grid point reflectors are perturbed on a finer grid to find the appropriate bases for the reconstruction of off-grid targets. To provide efficiency of the reconstruction, the EMMP algorithm is applied to find reflectivity center locations. As demonstrated by simulations, the proposed approach significantly improves the performance of sparse SAR image reconstruction. © 2013 IEEE

Autofocused Spotlight SAR Image Reconstruction of Off-Grid Sparse Scenes

Synthetic aperture radar (SAR) has significant role in remote sensing. Phase errors due to uncompensated platform motion, measurement model mismatch, and measurement noise can cause degradations in SAR image reconstruction. For efficient processing of the measurements, image plane is discretized and autofocusing algorithms on this discrete grid are employed. However, in addition to the platform motion errors, the reflectors, which are not exactly on the reconstruction grid, also degrade the image quality. This is called the off-grid target problem. In this paper, a sparsity-based technique is developed for autofocused spotlight SAR image reconstruction that can correct phase errors due to uncompensated platform motion and provide robust images in the presence of off-grid targets. The proposed orthogonal matching pursuit-based reconstruction technique uses gradient descent parameter updates with built in autofocus. The technique can reconstruct high-quality images by using sub Nyquist rate of sampling on the reflected signals at the receiver. The results obtained using both simulated and real SAR system data show that the proposed technique provides higher quality reconstructions over alternative techniques in terms of commonly used performance metrics. © 2017 IEEE

Underdetermined Separation of Speech Mixture Based on Sparse Bayesian Learning

This paper describes a novel algorithm for underdetermined speech separation problem based on compressed sensing which is an emerging technique for efficient data reconstruction. The proposed algorithm consists of two steps. The unknown mixing matrix is firstly estimated from the speech mixtures in the transform domain by using K-means clustering algorithm. In the second step, the speech sources are recovered based on an autocalibration sparse Bayesian learning algorithm for speech signal. Numerical experiments including the comparison with other sparse representation approaches are provided to show the achieved performance improvement

Compressed sensing for enhanced through-the-wall radar imaging

Through-the-wall radar imaging (TWRI) is an emerging technology that aims to capture scenes behind walls and other visually opaque materials. The abilities to sense through walls are highly desirable for both military and civil applications, such as search and rescue missions, surveillance, and reconnaissance. TWRI systems, however, face with several challenges including prolonged data acquisition, large objects, strong wall clutter, and shadowing effects, which limit the radar imaging performances and hinder target detection and localization

Dictionary Learning for Sparse Representations With Applications to Blind Source Separation.

During the past decade, sparse representation has attracted much attention in the signal processing community. It aims to represent a signal as a linear combination of a small number of elementary signals called atoms. These atoms constitute a dictionary so that a signal can be expressed by the multiplication of the dictionary and a sparse coefficients vector. This leads to two main challenges that are studied in the literature, i.e. sparse coding (find the coding coefficients based on a given dictionary) and dictionary design (find an appropriate dictionary to fit the data). Dictionary design is the focus of this thesis. Traditionally, the signals can be decomposed by the predefined mathematical transform, such as discrete cosine transform (DCT), which forms the so-called analytical approach. In recent years, learning-based methods have been introduced to adapt the dictionary from a set of training data, leading to the technique of dictionary learning. Although this may involve a higher computational complexity, learned dictionaries have the potential to offer improved performance as compared with predefined dictionaries. Dictionary learning algorithm is often achieved by iteratively executing two operations: sparse approximation and dictionary update. We focus on the dictionary update step, where the dictionary is optimized with a given sparsity pattern. A novel framework is proposed to generalize benchmark mechanisms such as the method of optimal directions (MOD) and K-SVD where an arbitrary set of codewords and the corresponding sparse coefficients are simultaneously updated, hence the term simultaneous codeword optimization (SimCO). Moreover, its extended formulation ‘regularized SimCO’ mitigates the major bottleneck of dictionary update caused by the singular points. First and second order optimization procedures are designed to solve the primitive and regularized SimCO. In addition, a tree-structured multi-level representation of dictionary based on clustering is used to speed up the optimization process in the sparse coding stage. This novel dictionary learning algorithm is also applied for solving the underdetermined blind speech separation problem, leading to a multi-stage method, where the separation problem is reformulated as a sparse coding problem, with the dictionary being learned by an adaptive algorithm. Using mutual coherence and sparsity index, the performance of a variety of dictionaries for underdetermined speech separation is compared and analyzed, such as the dictionaries learned from speech mixtures and ground truth speech sources, as well as those predefined by mathematical transforms. Finally, we propose a new method for joint dictionary learning and source separation. Different from the multistage method, the proposed method can simultaneously estimate the mixing matrix, the dictionary and the sources in an alternating and blind manner. The advantages of all the proposed methods are demonstrated over the state-of-the-art methods using extensive numerical tests