Scattering Center Extraction and Recognition Based on ESPRIT Algorithm

Inverse Synthetic Aperture Radar (ISAR) generates high quality radar images even in low visibility. And it provides important physical features for space target recognition and location. This thesis focuses on ISAR rapid imaging, scattering center information extraction, and target classification. Based on the principle of Fourier imaging, the backscattering field of radar target is obtained by physical optics (PO) algorithm, and the relation between scattering field and objective function is deduced. According to the resolution formula, the incident parameters of electromagnetic wave are set reasonably. The interpolation method is used to realize three-dimensional (3D) simulation of aircraft target, and the results are compared with direct imaging results. CLEAN algorithm extracts scattering center information effectively. But due to the limitation of resolution parameters, traditional imaging can’t meet the actual demand. Therefore, the super-resolution Estimation of Signal Parameters via Rotational Invariance Techniques (ESPRIT) algorithm is used to obtain spatial target location information. The signal subspace and noise subspace are orthogonal to each other. By combining spatial smoothing method with ESPRIT algorithm, the physical characteristics of geometric target scattering center are obtained accurately. In particular, the proposed method is validated on complex 3D aircraft targets and it proves that this method is applied to most scattering mechanisms. The distribution of scattering centers reflects the geometric information of the target. Therefore, the electromagnetic image to be recognized and ESPRIT image are matched by the domain matching method. And the classification results under different radii are obtained. In addition, because the neural network can extract rich image features, the improved ALEX network is used to classify and recognize target data processed by ESPRIT. It proves that ESPRIT algorithm can be used to expand the existing datasets and prepare for future identification of targets in real environments. Final a visual classification system is constructed to visually display the results

State-Space Approaches to Ultra-Wideband Doppler Processing

National security needs dictate the development of new radar systems capable of identifying and tracking exoatmospheric threats to aid our defense. These new radar systems feature reduced noise floors, electronic beam steering, and ultra-wide bandwidths, all of which facilitate threat discrimination. However, in order to identify missile attributes such as RF reflectivity, distance, and velocity, many existing processing algorithms rely upon narrow bandwidth assumptions that break down with increased signal bandwidth. We present a fresh investigation into these algorithms for removing bandwidth limitations and propose novel state-space and direct-data factoring formulations such as * the multidimensional extension to the Eigensystem Realization Algorithm, * employing state-space models in place of interpolation to obtain a form which admits a separation and isolation of solution components, * and side-stepping the joint diagonalization of state transition matrices, which commonly plagues methods like multidimensional ESPRIT. We then benchmark our approaches and relate the outcomes to the Cramer-Rao bound for the case of one and two adjacent reflectors to validate their conceptual design and identify those techniques that compare favorably to or improve upon existing practices

Matrix and Tensor-based ESPRIT Algorithm for Joint Angle and Delay Estimation in 2D Active Broadband Massive MIMO Systems and Analysis of Direction of Arrival Estimation Algorithms for Basal Ice Sheet Tomography

In this thesis, we apply and analyze three direction of arrival algorithms (DoA) to tackle two distinct problems: one belongs to wireless communication, the other to radar signal processing. Though the essence of these two problems is DoA estimation, their formulation, underlying assumptions, application scenario, etc. are totally different. Hence, we write them separately, with ESPRIT algorithm the focus of Part I and MUSIC and MLE detailed in Part II. For wireless communication scenario, mobile data traffic is expected to have an exponential growth in the future. In order to meet the challenge as well as the form factor limitation on the base station, 2D "massive MIMO" has been proposed as one of the enabling technologies to significantly increase the spectral efficiency of a wireless system. In "massive MIMO" systems, a base station will rely on the uplink sounding signals from mobile stations to figure out the spatial information to perform MIMO beamforming. Accordingly, multi-dimensional parameter estimation of a ray-based multi-path wireless channel becomes crucial for such systems to realize the predicted capacity gains. In the first Part, we study joint angle and delay estimation for 2D "massive MIMO" systems in mobile wireless communications. To be specific, we first introduce a low complexity time delay and 2D DoA estimation algorithm based on unitary transformation. Some closed-form results and capacity analysis are involved. Furthermore, the matrix and tensor-based 3D ESPRIT-like algorithms are applied to jointly estimate angles and delay. Significant improvements of the performance can be observed in our communication scheme. Finally, we found that azimuth estimation is more vulnerable compared to elevation estimation. Results suggest that the dimension of the antenna array at the base station plays an important role in determining the estimation performance. These insights will be useful for designing practical "massive MIMO" systems in future mobile wireless communications. For the problem of radar remote sensing of ice sheet topography, one of the key requirements for deriving more realistic ice sheet models is to obtain a good set of basal measurements that enables accurate estimation of bed roughness and conditions. For this purpose, 3D tomography of the ice bed has been successfully implemented with the help of DoA algorithms such as MUSIC and MLE techniques. These methods have enabled fine resolution in the cross-track dimension using synthetic aperture radar (SAR) images obtained from single pass multichannel data. In Part II, we analyze and compare the results obtained from the spectral MUSIC algorithm and an alternating projection (AP) based MLE technique. While the MUSIC algorithm is more attractive computationally compared to MLE, the performance of the latter is known to be superior in most situations. The SAR focused datasets provide a good case study to explore the performance of these two techniques to the application of ice sheet bed elevation estimation. For the antenna array geometry and sample support used in our tomographic application, MUSIC performs better originally using a cross-over analysis where the estimated topography from crossing flightlines are compared for consistency. However, after several improvements applied to MLE, i.e., replacing ideal steering vector generation with measured steering vectors, automatic determination of the number of scatter sources, smoothing the 3D tomography in order to get a more accurate height estimation and introducing a quality metric for the estimated signals, etc., MLE outperforms MUSIC. It confirms that MLE is indeed the optimal estimator for our particular ice bed tomographic application. We observe that, the spatial bottom smoothing, aiming to remove the artifacts made by MLE algorithm, is the most essential step in the post-processing procedure. The 3D tomography we obtained lays a good foundation for further analysis and modeling of ice sheets

Maximum Likelihood Estimation of Exponentials in Unknown Colored Noise for Target Identification in Synthetic Aperture Radar Images

This dissertation develops techniques for estimating exponential signals in unknown colored noise. The Maximum Likelihood (ML) estimators of the exponential parameters are developed. Techniques are developed for one and two dimensional exponentials, for both the deterministic and stochastic ML model. The techniques are applied to Synthetic Aperture Radar (SAR) data whose point scatterers are modeled as damped exponentials. These estimated scatterer locations (exponentials frequencies) are potential features for model-based target recognition. The estimators developed in this dissertation may be applied with any parametrically modeled noise having a zero mean and a consistent estimator of the noise covariance matrix. ML techniques are developed for a single instance of data in colored noise which is modeled in one dimension as (1) stationary noise, (2) autoregressive (AR) noise and (3) autoregressive moving-average (ARMA) noise and in two dimensions as (1) stationary noise, and (2) white noise driving an exponential filter. The classical ML approach is used to solve for parameters which can be decoupled from the estimation problem. The remaining nonlinear optimization to find the exponential frequencies is then solved by extending white noise ML techniques to colored noise. In the case of deterministic ML, the computationally efficient, one and two-dimensional Iterative Quadratic Maximum Likelihood (IQML) methods are extended to colored noise. In the case of stochastic ML, the one and two-dimensional Method of Direction Estimation (MODE) techniques are extended to colored noise. Simulations show that the techniques perform close to the Cramer-Rao bound when the model matches the observed noise

Maximum Likelihood Estimation of Exponentials in Unknown Colored Noise for Target in Identification Synthetic Aperture Radar Images

This dissertation develops techniques for estimating exponential signals in unknown colored noise. The Maximum Likelihood ML estimators of the exponential parameters are developed. Techniques are developed for one and two dimensional exponentials, for both the deterministic and stochastic ML model. The techniques are applied to Synthetic Aperture Radar SAR data whose point scatterers are modeled as damped exponentials. These estimated scatterer locations exponentials frequencies are potential features for model-based target recognition. The estimators developed in this dissertation may be applied with any parametrically modeled noise having a zero mean and a consistent estimator of the noise covariance matrix. ML techniques are developed for a single instance of data in colored noise which is modeled in one dimension as 1 stationary noise, 2 autoregressive AR noise and 3 autoregressive moving-average ARMA noise and in two dimensions as 1 stationary noise, and 2 white noise driving an exponential filter. The classical ML approach is used to solve for parameters which can be decoupled from the estimation problem. The remaining nonlinear optimization to find the exponential frequencies is then solved by extending white noise ML techniques to colored noise. In the case of deterministic ML, the computationally efficient, one and two-dimensional Iterative Quadratic Maximum Likelihood IQML methods are extended to colored noise. In the case of stochastic ML, the one and two-dimensional Method of Direction Estimation MODE techniques are extended to colored noise. Simulations show that the techniques perform close to the Cramer-Rao bound when the model matches the observed noise

Synthetic aperture radar target detection, feature extraction, and image formation techniques

This report presents new algorithms for target detection, feature extraction, and image formation with the synthetic aperture radar (SAR) technology. For target detection, we consider target detection with SAR and coherent subtraction. We also study how the image false alarm rates are related to the target template false alarm rates when target templates are used for target detection. For feature extraction from SAR images, we present a computationally efficient eigenstructure-based 2D-MODE algorithm for two-dimensional frequency estimation. For SAR image formation, we present a robust parametric data model for estimating high resolution range signatures of radar targets and for forming high resolution SAR images

Sparse Bases and Bayesian Inference of Electromagnetic Scattering

Many approaches in CEM rely on the decomposition of complex radiation and scattering behavior with a set of basis vectors. Accurate estimation of the quantities of interest can be synthesized through a weighted sum of these vectors. In addition to basis decompositions, sparse signal processing techniques developed in the CS community can be leveraged when only a small subset of the basis vectors are required to sufficiently represent the quantity of interest. We investigate several concepts in which novel bases are applied to common electromagnetic problems and leverage the sparsity property to improve performance and/or reduce computational burden. The first concept explores the use of multiple types of scattering primitives to reconstruct scattering patterns of electrically large targets. Using a combination of isotropic point scatterers and wedge diffraction primitives as our bases, a 40% reduction in reconstruction error can be achieved. Next, a sparse basis is used to improve DOA estimation. We implement the BSBL technique to determine the angle of arrival of multiple incident signals with only a single snapshot of data from an arbitrary arrangement of non-isotropic antennas. This is an improvement over the current state-of-the-art, where restrictions on the antenna type, configuration, and a priori knowledge of the number of signals are often assumed. Lastly, we investigate the feasibility of a basis set to reconstruct the scattering patterns of electrically small targets. The basis is derived from the TCM and can capture non-localized scattering behavior. Preliminary results indicate that this basis may be used in an interpolation and extrapolation scheme to generate scattering patterns over multiple frequencies

Multidimensional Frequency Estimation with Applications in Automotive Radar

This thesis considers multidimensional frequency estimation with a focus on computational efficiency and high-resolution capability. A novel framework on multidimensional high-resolution frequency estimation is developed and applied to increase the range, radial velocity, and angular resolution capcability of state-of-the-art automotive radars

A Two-stage Multiband Radar Sensing Scheme via Stochastic Particle-Based Variational Bayesian Inference

Multiband fusion is an important technique for radar sensing, which jointly utilizes measurements from multiple non-contiguous frequency bands to improve the sensing performance. In the multi-band radar sensing signal model, there are many local optimums in the associated likelihood function due to the existence of high frequency component, which makes it difficult to obtain high-accuracy parameter estimation. To cope with this challenge, we divide the radar target parameter estimation into two stages equipped with different but equivalent signal models, where the first-stage coarse estimation is used to narrow down the search range for the next stage, and the second-stage refined estimation is based on the Bayesian approach to avoid the convergence to a bad local optimum of the likelihood function. Specifically, in the coarse estimation stage, we employ a weighted root MUSIC algorithm to achieve initial estimation. Then, we apply the block stochastic successive convex approximation (SSCA) approach to derive a novel stochastic particle-based variational Bayesian inference (SPVBI) algorithm for the Bayesian estimation of the radar target parameters in the refined stage. Unlike the conventional particle-based VBI (PVBI) in which only the probability of each particle is optimized and the per-iteration computational complexity increases exponentially with the number of particles, the proposed SPVBI optimizes both the position and probability of each particle, and it adopts the block SSCA to significantly improve the sampling efficiency by averaging over iterations. As such, it is shown that the proposed SPVBI can achieve a better performance than the conventional PVBI with a much smaller number of particles and per-iteration complexity. Finally, extensive simulations verify the advantage of the proposed algorithm over various baseline algorithms