Improvement of detection and tracking techniques in multistatic passive radar systems. (Mejora de técnicas de detección y seguimiento en sistemas radar pasivos multiestáticos)

Esta tesis doctoral es el resultado de una intensa actividad investigadora centrada en los sensores radar pasivos para la mejora de las capacidades de detección y seguimiento en escenarios complejos con blancos terrestres y pequeños drones. El trabajo de investigación se ha llevado a cabo en el grupo de investigación coordinado por la Dra. María Pilar Jarabo Amores, dentro del marco diferentes proyectos: IDEPAR (“Improved DEtection techniques for PAssive Radars”), MASTERSAT (“MultichAnnel paSsive radar receiver exploiting TERrestrial and SATellite Illuminators”) y KRIPTON (“A Knowledge based appRoach to passIve radar detection using wideband sPace adapTive prOcessiNg”) financiados por el Ministerio de Economía y Competitividad de España; MAPIS (Multichannel passive ISAR imaging for military applications) y JAMPAR (“JAMmer-based PAssive Radar”), financiados por la Agencia Europea de Defensa (EDA) . El objetivo principal es la mejora de las técnicas de detección y seguimiento en radares pasivos con configuraciones biestáticas y multiestaticas. En el documento se desarrollan algoritmos para el aprovechamiento de señales procedentes de distintos iluminadores de oportunidad (transmisores DVB-T, satélites DVB-S y señales GPS). Las soluciones propuestas han sido integradas en el demostrador tecnológico IDEPAR, desarrollado y actualizado bajo los proyectos mencionados, y validadas en escenarios reales declarados de interés por potenciales usuarios finales (Direccion general de armamento y material, instituto nacional de tecnología aeroespacial y la armada española). Para el desarrollo y evaluación de cadenas de las cadenas de procesado, se plantean dos casos de estudio: blancos terrestres en escenarios semiurbanos edificios y pequeños blancos aéreos en escenarios rurales y costeros. Las principales contribuciones se pueden resumir en los siguientes puntos: • Diseño de técnicas de seguimiento 2D en el espacio de trabajo rango biestático-frecuencia Doppler: se desarrollan técnicas de seguimiento para los dos casos de estudio, localización de blancos terrestres y pequeños drones. Para es último se implementan técnicas capaces de seguir tanto el movimiento del dron como su firma Doppler, lo que permite implementar técnicas de clasificación de blancos. • Diseño de técnicas de seguimiento de blancos capaces de integrar información en el espacio 3D (rango, Doppler y acimut): se diseñan técnicas basadas en procesado en dos etapas, una primera con seguimiento en 2D para el filtrado de falsas alarmas y la segunda para el seguimiento en 3D y la conversión de coordenadas a un plano local cartesiano. Se comparan soluciones basadas en filtros de Kalman para sistemas tanto lineales como no lineales. • Diseño de cadenas de procesado para sistemas multiestáticos: la información estimada del blanco sobre múltiples geometrías biestáticas es utilizada para incremento de las capacidades de localización del blanco en el plano cartesiano local. Se presentan soluciones basadas en filtros de Kalman para sistemas no lineales explotando diferentes medidas biestáticas en el proceso de transformación de coordenadas, analizando las mejoras de precisión en la localización del blanco. • Diseño de etapas de procesado para radares pasivos basados en señales satelitales de las constelaciones GPS DVB-S. Se estudian las características de las señales satelitales identificando sus inconvenientes y proponiendo cadenas de procesado que permitan su utilización para la detección y seguimiento de blancos terrestres. • Estudio del uso de señales DVB-T multicanal con gaps de transmisión entre los diferentes canales en sistemas radares pasivos. Con ello se incrementa la resolución del sistema, y las capacidades de detección, seguimiento y localización. Se estudia el modelo de señal multicanal, sus efectos sobre el procesado coherente y se proponen cadenas de procesado para paliar los efectos adversos de este tipo de señales

OFDM passive radar employing compressive processing in MIMO configurations

A key advantage of passive radar is that it provides a means of performing position detection and tracking without the need for transmission of energy pulses. In this respect, passive radar systems utilising (receiving) orthogonal frequency division multiplexing (OFDM) communications signals from transmitters using OFDM standards such as long term evolution (LTE), WiMax or WiFi, are considered. Receiving a stronger reference signal for the matched filtering, detecting a lower target signature is one of the challenges in the passive radar. Impinging at the receiver, the OFDM waveforms supply two-dimensional virtual uniform rectangul ararray with the first and second dimensions refer to time delays and Doppler frequencies respectively. A subspace method, multiple signals classification (MUSIC) algorithm, demonstrated the signal extraction using multiple time samples. Apply normal measurements, this problem requires high computational resources regarding the number of OFDM subcarriers. For sub-Nyquist sampling, compressive sensing (CS) becomes attractive. A single snap shot measurement can be applied with Basis Pursuit (BP), whereas l1-singular value decomposition (l1-SVD) is applied for the multiple snapshots. Employing multiple transmitters, the diversity in the detection process can be achieved. While a passive means of attaining three-dimensional large-set measurements is provided by co-located receivers, there is a significant computational burden in terms of the on-line analysis of such data sets. In this thesis, the passive radar problem is presented as a mathematically sparse problem and interesting solutions, BP and l1-SVD as well as Bayesian compressive sensing, fast-Besselk, are considered. To increase the possibility of target signal detection, beamforming in the compressive domain is also introduced with the application of conve xoptimization and subspace orthogonality. An interference study is also another problem when reconstructing the target signal. The networks of passive radars are employed using stochastic geometry in order to understand the characteristics of interference, and the effect of signal to interference plus noise ratio (SINR). The results demonstrate the outstanding performance of l1-SVD over MUSIC when employing multiple snapshots. The single snapshot problem along with fast-BesselK multiple-input multiple-output configuration can be solved using fast-BesselK and this allows the compressive beamforming for detection capability

Adaptive Sensing Techniques for Dynamic Target Tracking and Detection with Applications to Synthetic Aperture Radars.

This thesis studies adaptive allocation of a limited set of sensing or computational resources in order to maximize some criteria, such as detection probability, estimation accuracy, or throughput, with specific application to inference with synthetic aperture radars (SAR). Sparse scenarios are considered where the interesting element is embedded in a much larger signal space. Policies are examined that adaptively distribute the constrained resources by using observed measurements to inform the allocation at subsequent stages. This thesis studies adaptive allocation policies in three main directions. First, a framework for adaptive search for sparse targets is proposed to simultaneously detect and track moving targets. Previous work is extended to include a dynamic target model that incorporates target transitions, birth/death probabilities, and varying target amplitudes. Policies are proposed that are shown empirically to have excellent asymptotic performance in estimation error, detection probability, and robustness to model mismatch. Moreover, policies are provided with low computational complexity as compared to state-of-the-art dynamic programming solutions. Second, adaptive sensor management is studied for stable tracking of targets under different modalities. A sensor scheduling policy is proposed that guarantees that the target spatial uncertainty remains bounded. When stability conditions are met, fundamental performance limits are derived such as the maximum number of targets that can be tracked stably and the maximum spatial uncertainty of those targets. The theory is extended to the case where the system may be engaged in tasks other than tracking, such as wide area search or target classification. Lastly, these developed tools are applied to tracking targets using SAR imagery. A hierarchical Bayesian model is proposed for efficient estimation of the posterior distribution for the target and clutter states given observed SAR imagery. This model provides a unifying framework that models the physical, kinematic, and statistical properties of SAR imagery. It is shown that this method generally outperforms common algorithms for change detection. Moreover, the proposed method has the additional benefits of (a) easily incorporating additional information such as target motion models and/or correlated measurements, (b) having few tuning parameters, and (c) providing a characterization of the uncertainty in the state estimation process.PHDElectrical Engineering-SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/97931/1/newstage_1.pd

The University Defence Research Collaboration In Signal Processing

This chapter describes the development of algorithms for automatic detection of anomalies from multi-dimensional, undersampled and incomplete datasets. The challenge in this work is to identify and classify behaviours as normal or abnormal, safe or threatening, from an irregular and often heterogeneous sensor network. Many defence and civilian applications can be modelled as complex networks of interconnected nodes with unknown or uncertain spatio-temporal relations. The behavior of such heterogeneous networks can exhibit dynamic properties, reflecting evolution in both network structure (new nodes appearing and existing nodes disappearing), as well as inter-node relations. The UDRC work has addressed not only the detection of anomalies, but also the identification of their nature and their statistical characteristics. Normal patterns and changes in behavior have been incorporated to provide an acceptable balance between true positive rate, false positive rate, performance and computational cost. Data quality measures have been used to ensure the models of normality are not corrupted by unreliable and ambiguous data. The context for the activity of each node in complex networks offers an even more efficient anomaly detection mechanism. This has allowed the development of efficient approaches which not only detect anomalies but which also go on to classify their behaviour

Cognitive Radar Detection in Nonstationary Environments and Target Tracking

Target detection and tracking are the most fundamental and important problems in a wide variety of defense and civilian radar systems. In recent years, to cope with complex environments and stealthy targets, the concept of cognitive radars has been proposed to integrate intelligent modules into conventional radar systems. To achieve better performance, cognitive radars are designed to sense, learn from, and adapt to environments. In this dissertation, we introduce cognitive radars for target detection in nonstationary environments and cognitive radar networks for target tracking.For target detection, many algorithms in the literature assume a stationary environment (clutter). However, in practical scenarios, changes in the nonstationary environment can perturb the parameters of the clutter distribution or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which can rapidly recognize the nonstationarity, accurately learn the new characteristics of the environment, and adaptively update the detector. To achieve this cognition, we propose a unifying framework that integrates three functions: (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by using kernel density estimation (KDE) methods and similarity measures (iii) adaptive target detection by automatically modifying the likelihood-ratio test and the corresponding detection threshold. We also conduct extensive numerical experiments to show the merits of the proposed method compared to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case.For target tracking, with remarkable advances in sensor techniques and deployable platforms, a sensing system has freedom to select a subset of available radars, plan their trajectories, and transmit designed waveforms. Accordingly, we propose a general framework for single target tracking in cognitive networks of radars, including joint consideration of waveform design, path planning, and radar selection. We formulate the tracking procedure using the theories of dynamic graphical models (DGM) and recursive Bayesian state estimation (RBSE). This procedure includes two iterative steps: (i) solving a combinatorial optimization problem to select the optimal subset of radars, waveforms, and locations for the next tracking instant, and (ii) acquiring the recursive Bayesian state estimation to accurately track the target. Further, we use an illustrative example to introduce a specific scenario in 2-D space. Simulation results based on this scenario demonstrate that the proposed framework can accurately track the target under the management of a network of radars

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

Short-Range Millimeter-Wave Sensing and Imaging: Theory, Experiments and Super-Resolution Algorithms

Recent advancements in silicon technology offer the possibility of realizing low-cost and highly integrated radar sensor and imaging systems in mm-wave (between 30 and 300 GHz) and beyond. Such active short-range mm-wave systems have a wide range of applications including medical imaging, security scanning, autonomous vehicle navigation, and human gesture recognition. Moving to higher frequencies provides us with the spectral and spatial degrees of freedom that we need for high resolution imaging and sensing application. Increased bandwidth availability enhances range resolution by increasing the degrees of freedom in the time-frequency domain. Cross-range resolution is enhanced by the increase in the number of spatial degrees of freedom for a constrained form factor. The focus of this thesis is to explore system design and algorithmic development to utilize the available degrees of freedom in mm-wave frequencies in order to realize imaging and sensing capabilities under cost, complexity and form factor constraints. We first consider the fundamental problem of estimating frequencies and gains in a noisy mixture of sinusoids. This problem is ubiquitous in radar sensing applications, including target range and velocity estimation using standard radar waveforms (e.g., chirp or stepped frequency continuous wave), and direction of arrival estimation using an array of antenna elements. We have developed a fast and robust iterative algorithm for super-resolving the frequencies and gains, and have demonstrated near-optimal performance in terms of frequency estimation accuracy by benchmarking against the Cramer Rao Bound in various scenarios.Next, we explore cross-range radar imaging using an array of antenna elements under severe cost, complexity and form factor constraints. We show that we must account for such constraints in a manner that is quite different from that of conventional radar, and introduce new models and algorithms validated by experimental results. In order to relax the synchronization requirements across multiple transceiver elements we have considered the monostatic architecture in which only the co-located elements are synchronized. We investigate the impact of sparse spatial sampling by reducing the number of array antenna elements, and show that ``sparse monostatic'' architecture leads to grating lobe artifact, which introduces ambiguity in the detection/estimation of point targets in the scene. At short ranges, however, targets are ``low-pass'' and contain extended features (consisting of a continuum of points), and are not well-modeled by a small number of point scatterers. We introduce the concept of ``spatial aggregation,'' which provides the flexibility of constructing a dictionary in which each atom corresponds to a collection of point scatterers, and demonstrate its effectiveness in suppressing the grating lobes and preserving the information in the scene.Finally, we take a more fundamental and systematic approach based on singular decomposition of the imaging system, to understand the information capacity and the limits of performance for various geometries. In general, a scene can be described by an infinite number of independent parameters. However, the number of independent parameters that can be measured through an imaging system (also known as the degrees of freedom of the system) is typically finite, and is constrained by the geometry and wavelength. We introduce a measure to predict the number of spatial degrees of freedom of 1D imaging systems for both monostatic and multistatic array architectures. Our analysis reveals that there is no fundamental benefit in multistatic architecture compared to monostatic in terms of achievable degrees of freedom. The real benefit of multistatic architecture from a practical point of view, is in being able to design sparse transmit and receive antenna arrays that are capable of achieving the available degrees of freedom. Moreover, our analytical framework opens up new avenues to investigate image formation techniques that aim to reconstruct the reflectivity function of the scene by solving an inverse scattering problem, and provides crucial insights on the achievable resolution