Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values

The stability of sparse signal reconstruction is investigated in this paper. We design efficient algorithms to verify the sufficient condition for unique $\ell_1$ sparse recovery. One of our algorithm produces comparable results with the state-of-the-art technique and performs orders of magnitude faster. We show that the $\ell_1$-constrained minimal singular value ($\ell_1$-CMSV) of the measurement matrix determines, in a very concise manner, the recovery performance of $\ell_1$-based algorithms such as the Basis Pursuit, the Dantzig selector, and the LASSO estimator. Compared with performance analysis involving the Restricted Isometry Constant, the arguments in this paper are much less complicated and provide more intuition on the stability of sparse signal recovery. We show also that, with high probability, the subgaussian ensemble generates measurement matrices with $\ell_1$-CMSVs bounded away from zero, as long as the number of measurements is relatively large. To compute the $\ell_1$-CMSV and its lower bound, we design two algorithms based on the interior point algorithm and the semi-definite relaxation

Adaptive OFDM Radar for Target Detection and Tracking

We develop algorithms to detect and track targets by employing a wideband orthogonal frequency division multiplexing: OFDM) radar signal. The frequency diversity of the OFDM signal improves the sensing performance since the scattering centers of a target resonate variably at different frequencies. In addition, being a wideband signal, OFDM improves the range resolution and provides spectral efficiency. We first design the spectrum of the OFDM signal to improve the radar\u27s wideband ambiguity function. Our designed waveform enhances the range resolution and motivates us to use adaptive OFDM waveform in specific problems, such as the detection and tracking of targets. We develop methods for detecting a moving target in the presence of multipath, which exist, for example, in urban environments. We exploit the multipath reflections by utilizing different Doppler shifts. We analytically evaluate the asymptotic performance of the detector and adaptively design the OFDM waveform, by maximizing the noncentrality-parameter expression, to further improve the detection performance. Next, we transform the detection problem into the task of a sparse-signal estimation by making use of the sparsity of multiple paths. We propose an efficient sparse-recovery algorithm by employing a collection of multiple small Dantzig selectors, and analytically compute the reconstruction performance in terms of the $ell_1$-constrained minimal singular value. We solve a constrained multi-objective optimization algorithm to design the OFDM waveform and infer that the resultant signal-energy distribution is in proportion to the distribution of the target energy across different subcarriers. Then, we develop tracking methods for both a single and multiple targets. We propose an tracking method for a low-grazing angle target by realistically modeling different physical and statistical effects, such as the meteorological conditions in the troposphere, curved surface of the earth, and roughness of the sea-surface. To further enhance the tracking performance, we integrate a maximum mutual information based waveform design technique into the tracker. To track multiple targets, we exploit the inherent sparsity on the delay-Doppler plane to develop an computationally efficient procedure. For computational efficiency, we use more prior information to dynamically partition a small portion of the delay-Doppler plane. We utilize the block-sparsity property to propose a block version of the CoSaMP algorithm in the tracking filter

The Constant Information Radar

abstract: The constant information radar, or CIR, is a tracking radar that modulates target revisit time by maintaining a fixed mutual information measure. For highly dynamic targets that deviate significantly from the path predicted by the tracking motion model, the CIR adjusts by illuminating the target more frequently than it would for well-modeled targets. If SNR is low, the radar delays revisit to the target until the state entropy overcomes noise uncertainty. As a result, we show that the information measure is highly dependent on target entropy and target measurement covariance. A constant information measure maintains a fixed spectral efficiency to support the RF convergence of radar and communications. The result is a radar implementing a novel target scheduling algorithm based on information instead of heuristic or ad hoc methods. The CIR mathematically ensures that spectral use is justified

MIMO Radar Waveform Design and Sparse Reconstruction for Extended Target Detection in Clutter

This dissertation explores the detection and false alarm rate performance of a novel transmit-waveform and receiver filter design algorithm as part of a larger Compressed Sensing (CS) based Multiple Input Multiple Output (MIMO) bistatic radar system amidst clutter. Transmit-waveforms and receiver filters were jointly designed using an algorithm that minimizes the mutual coherence of the combined transmit-waveform, target frequency response, and receiver filter matrix product as a design criterion. This work considered the Probability of Detection (P D) and Probability of False Alarm (P FA) curves relative to a detection threshold, τ th, Receiver Operating Characteristic (ROC), reconstruction error and mutual coherence measures for performance characterization of the design algorithm to detect both known and fluctuating targets and amidst realistic clutter and noise. Furthermore, this work paired the joint waveform-receiver filter design algorithm with multiple sparse reconstruction algorithms, including: Regularized Orthogonal Matching Pursuit (ROMP), Compressive Sampling Matching Pursuit (CoSaMP) and Complex Approximate Message Passing (CAMP) algorithms. It was found that the transmit-waveform and receiver filter design algorithm significantly outperforms statically designed, benchmark waveforms for the detection of both known and fluctuating extended targets across all tested sparse reconstruction algorithms. In particular, CoSaMP was specified to minimize the maximum allowable P FA of the CS radar system as compared to the baseline ROMP sparse reconstruction algorithm of previous work. However, while the designed waveforms do provide performance gains and CoSaMP affords a reduced peak false alarm rate as compared to the previous work, fluctuating target impulse responses and clutter severely hampered CS radar performance when either of these sparse reconstruction techniques were implemented. To improve detection rate and, by extension, ROC performance of the CS radar system under non-ideal conditions, this work implemented the CAMP sparse reconstruction algorithm in the CS radar system. It was found that detection rates vastly improve with the implementation of CAMP, especially in the case of fluctuating target impulse responses amidst clutter or at low receive signal to noise ratios (β n). Furthermore, where previous work considered a τ th=0, the implementation of a variable τ th in this work offered novel trade off between P D and P FA in radar design to the CS radar system. In the simulated radar scene it was found that τ th could be moderately increased retaining the same or similar P D while drastically improving P FA. This suggests that the selection and specification of the sparse reconstruction algorithm and corresponding τ th for this radar system is not trivial. Rather, a tradeoff was noted between P D and P FA based on the choice and parameters of the sparse reconstruction technique and detection threshold, highlighting an engineering trade-space in CS radar system design. Thus, in CS radar system design, the radar designer must carefully choose and specify the sparse reconstruction technique and appropriate detection threshold in addition to transmit-waveforms, receiver filters and building the dictionary of target impulse responses for detection in the radar scene

Adaptive MIMO Radar for Target Detection, Estimation, and Tracking

We develop and analyze signal processing algorithms to detect, estimate, and track targets using multiple-input multiple-output: MIMO) radar systems. MIMO radar systems have attracted much attention in the recent past due to the additional degrees of freedom they offer. They are commonly used in two different antenna configurations: widely-separated: distributed) and colocated. Distributed MIMO radar exploits spatial diversity by utilizing multiple uncorrelated looks at the target. Colocated MIMO radar systems offer performance improvement by exploiting waveform diversity. Each antenna has the freedom to transmit a waveform that is different from the waveforms of the other transmitters. First, we propose a radar system that combines the advantages of distributed MIMO radar and fully polarimetric radar. We develop the signal model for this system and analyze the performance of the optimal Neyman-Pearson detector by obtaining approximate expressions for the probabilities of detection and false alarm. Using these expressions, we adaptively design the transmit waveform polarizations that optimize the target detection performance. Conventional radar design approaches do not consider the goal of the target itself, which always tries to reduce its detectability. We propose to incorporate this knowledge about the goal of the target while solving the polarimetric MIMO radar design problem by formulating it as a game between the target and the radar design engineer. Unlike conventional methods, this game-theoretic design does not require target parameter estimation from large amounts of training data. Our approach is generic and can be applied to other radar design problems also. Next, we propose a distributed MIMO radar system that employs monopulse processing, and develop an algorithm for tracking a moving target using this system. We electronically generate two beams at each receiver and use them for computing the local estimates. Later, we efficiently combine the information present in these local estimates, using the instantaneous signal energies at each receiver to keep track of the target. Finally, we develop multiple-target estimation algorithms for both distributed and colocated MIMO radar by exploiting the inherent sparsity on the delay-Doppler plane. We propose a new performance metric that naturally fits into this multiple target scenario and develop an adaptive optimal energy allocation mechanism. We employ compressive sensing to perform accurate estimation from far fewer samples than the Nyquist rate. For colocated MIMO radar, we transmit frequency-hopping codes to exploit the frequency diversity. We derive an analytical expression for the block coherence measure of the dictionary matrix and design an optimal code matrix using this expression. Additionally, we also transmit ultra wideband noise waveforms that improve the system resolution and provide a low probability of intercept: LPI)

Computable Performance Analysis of Recovering Signals with Low-dimensional Structures

The last decade witnessed the burgeoning development in the reconstruction of signals by exploiting their low-dimensional structures, particularly, the sparsity, the block-sparsity, the low-rankness, and the low-dimensional manifold structures of general nonlinear data sets. The reconstruction performance of these signals relies heavily on the structure of the sensing matrix/operator. In many applications, there is a flexibility to select the optimal sensing matrix among a class of them. A prerequisite for optimal sensing matrix design is the computability of the performance for different recovery algorithms. I present a computational framework for analyzing the recovery performance of signals with low-dimensional structures. I define a family of goodness measures for arbitrary sensing matrices as the optimal values of a set of optimization problems. As one of the primary contributions of this work, I associate the goodness measures with the fixed points of functions defined by a series of linear programs, second-order cone programs, or semidefinite programs, depending on the specific problem. This relation with the fixed-point theory, together with a bisection search implementation, yields efficient algorithms to compute the goodness measures with global convergence guarantees. As a by-product, we implement efficient algorithms to verify sufficient conditions for exact signal recovery in the noise-free case. The implementations perform orders-of-magnitude faster than the state-of-the-art techniques. The utility of these goodness measures lies in their relation with the reconstruction performance. I derive bounds on the recovery errors of convex relaxation algorithms in terms of these goodness measures. Using tools from empirical processes and generic chaining, I analytically demonstrate that as long as the number of measurements are relatively large, these goodness measures are bounded away from zeros for a large class of random sensing matrices, a result parallel to the probabilistic analysis of the restricted isometry property. Numerical experiments show that, compared with the restricted isometry based performance bounds, our error bounds apply to a wider range of problems and are tighter, when the sparsity levels of the signals are relatively low. I expect that computable performance bounds would open doors for wide applications in compressive sensing, sensor arrays, radar, MRI, image processing, computer vision, collaborative filtering, control, and many other areas where low-dimensional signal structures arise naturally

Multiple-Target Tracking in Complex Scenarios

In this dissertation, we develop computationally efficient algorithms for multiple-target tracking: MTT) in complex scenarios. For each of these scenarios, we develop measurement and state-space models, and then exploit the structure in these models to propose efficient tracking algorithms. In addition, we address design issues such as sensor selection and resource allocation. First, we consider MTT when the targets themselves are moving in a time-varying multipath environment. We develop a sparse-measurement model that allows us to exploit the inherent joint delay-Doppler diversity offered by the environment. We then reformulate the problem of MTT as a block-support recovery problem using the sparse measurement model. We exploit the structure of the dictionary matrix to develop a computationally efficient block support recovery algorithm: and thereby a multiple-target tracking algorithm) under the assumption that the channel state describing the time-varying multipath environment is known. Further, we also derive an upper bound on the overall error probability of wrongly identifying the support of the sparse signal. We then relax the assumption that the channel state is known. We develop a new particle filter called the Multiple Rao-Blackwellized Particle Filter: MRBPF) to jointly estimate both the target and the channel states. We also compute the posterior Cramér-Rao bound: PCRB) on the estimates of the target and the channel states and use the PCRB to find a suitable subset of antennas to be used for transmission in each tracking interval, as well as the power transmitted by these antennas. Second, we consider the problem of tracking an unknown number and types of targets using a multi-modal sensor network. In a multi-modal sensor network, different quantities associated with the same state are measured using sensors of different kinds. Hence, an efficient method that can suitably combine the diverse information measured by each sensor is required. We first develop a Hierarchical Particle Filter: HPF) to estimate the unknown state from the multi-modal measurements for a special class of problems which can be modeled hierarchically. We then model our problem of tracking using a hierarchical model and then use the proposed HPF for joint initiation, termination and tracking of multiple targets. The multi-modal data consists of the measurements collected from a radar, an infrared camera and a human scout. We also propose a unified framework for multi-modal sensor management that comprises sensor selection: SS), resource allocation: RA) and data fusion: DF). Our approach is inspired by the trading behavior of economic agents in commercial markets. We model the sensors and the sensor manager as economic agents, and the interaction among them as a double sided market with both consumers and producers. We propose an iterative double auction mechanism for computing the equilibrium of such a market. We relate the equilibrium point to the solutions of SS, RA and DF. Third, we address MTT problem in the presence of data association ambiguity that arises due to clutter. Data association corresponds to the problem of assigning a measurement to each target. We treat the data association and state estimation as separate subproblems. We develop a game-theoretic framework to solve the data association, in which we model each tracker as a player and the set of measurements as strategies. We develop utility functions for each player, and then use a regret-based learning algorithm to find the correlated equilibrium of this game. The game-theoretic approach allows us to associate measurements to all the targets simultaneously. We then use particle filtering on the reduced dimensional state of each target, independently

Cognitive radar network design and applications

PhD ThesisIn recent years, several emerging technologies in modern radar system design are attracting the attention of radar researchers and practitioners alike, noteworthy among which are multiple-input multiple-output (MIMO), ultra wideband (UWB) and joint communication-radar technologies. This thesis, in particular focuses upon a cognitive approach to design these modern radars. In the existing literature, these technologies have been implemented on a traditional platform in which the transmitter and receiver subsystems are discrete and do not exchange vital radar scene information. Although such radar architectures benefit from these mentioned technological advances, their performance remains sub-optimal due to the lack of exchange of dynamic radar scene information between the subsystems. Consequently, such systems are not capable to adapt their operational parameters “on the fly”, which is in accordance with the dynamic radar environment. This thesis explores the research gap of evaluating cognitive mechanisms, which could enable modern radars to adapt their operational parameters like waveform, power and spectrum by continually learning about the radar scene through constant interactions with the environment and exchanging this information between the radar transmitter and receiver. The cognitive feedback between the receiver and transmitter subsystems is the facilitator of intelligence for this type of architecture. In this thesis, the cognitive architecture is fused together with modern radar systems like MIMO, UWB and joint communication-radar designs to achieve significant performance improvement in terms of target parameter extraction. Specifically, in the context of MIMO radar, a novel cognitive waveform optimization approach has been developed which facilitates enhanced target signature extraction. In terms of UWB radar system design, a novel cognitive illumination and target tracking algorithm for target parameter extraction in indoor scenarios has been developed. A cognitive system architecture and waveform design algorithm has been proposed for joint communication-radar systems. This thesis also explores the development of cognitive dynamic systems that allows the fusion of cognitive radar and cognitive radio paradigms for optimal resources allocation in wireless networks. In summary, the thesis provides a theoretical framework for implementing cognitive mechanisms in modern radar system design. Through such a novel approach, intelligent illumination strategies could be devised, which enable the adaptation of radar operational modes in accordance with the target scene variations in real time. This leads to the development of radar systems which are better aware of their surroundings and are able to quickly adapt to the target scene variations in real time.Newcastle University, Newcastle upon Tyne: University of Greenwich