Maritime Moving Target Detection, Tracking and Geocoding Using Range-Compressed Airborne Radar Data

Eine regelmäßige und großflächige überwachung des Schiffsverkehrs gewinnt zunehmend an Bedeutung, vor allem auch um maritime Gefahrenlagen und illegale Aktivitäten rechtzeitig zu erkennen. Heutzutage werden dafür überwiegend das automatische Identifikationssystem (AIS) und stationäre Radarstationen an den Küsten eingesetzt. Luft- und weltraumgestützte Radarsensoren, die unabhängig vom Wetter und Tageslicht Daten liefern, können die vorgenannten Systeme sehr gut ergänzen. So können sie beispielsweise Schiffe detektieren, die nicht mit AIS-Transpondern ausgestattet sind oder die sich außerhalb der Reichweite der stationären AIS- und Radarstationen befinden. Luftgestützte Radarsensoren ermöglichen eine quasi-kontinuierliche Beobachtung von räumlich begrenzten Gebieten. Im Gegensatz dazu bieten weltraumgestützte Radare eine große räumliche Abdeckung, haben aber den Nachteil einer geringeren temporalen Abdeckung. In dieser Dissertation wird ein umfassendes Konzept für die Verarbeitung von Radardaten für die Schiffsverkehr-überwachung mit luftgestützten Radarsensoren vorgestellt. Die Hauptkomponenten dieses Konzepts sind die Detektion, das Tracking, die Geokodierung, die Bildgebung und die Fusion mit AIS-Daten. Im Rahmen der Dissertation wurden neuartige Algorithmen für die ersten drei Komponenten entwickelt. Die Algorithmen sind so aufgebaut, dass sie sich prinzipiell für zukünftige Echtzeitanwendungen eignen, die eine Verarbeitung an Bord der Radarplattform erfordern. Darüber hinaus eignen sich die Algorithmen auch für beliebige, nicht-lineare Flugpfade der Radarplattform. Sie sind auch robust gegenüber Lagewinkeländerungen, die während der Datenerfassung aufgrund von Luftturbulenzen jederzeit auftreten können. Die für die Untersuchungen verwendeten Daten sind ausschließlich entfernungskomprimierte Radardaten. Da das Signal-Rausch-Verhältnis von Flugzeugradar-Daten im Allgemeinen sehr hoch ist, benötigen die neuentwickelten Algorithmen keine vollständig fokussierten Radarbilder. Dies reduziert die Gesamtverarbeitungszeit erheblich und ebnet den Weg für zukünftige Echtzeitanwendungen. Der entwickelte neuartige Schiffsdetektor arbeitet direkt im Entfernungs-Doppler-Bereich mit sehr kurzen kohärenten Verarbeitungsintervallen (CPIs) der entfernungskomprimierten Radardaten. Aufgrund der sehr kurzen CPIs werden die detektierten Ziele im Dopplerbereich fokussiert abgebildet. Wenn sich die Schiffe zusätzlich mit einer bestimmten Radialgeschwindigkeit bewegen, werden ihre Signale aus dem Clutter-Bereich hinausgeschoben. Dies erhöht das Verhältnis von Signal- zu Clutter-Energie und verbessert somit die Detektierbarkeit. Die Genauigkeit der Detektion hängt stark von der Qualität der von der Meeresoberfläche rückgestreuten Radardaten ab, die für die Schätzung der Clutter-Statistik verwendet werden. Diese wird benötigt, um einen Detektions-Schwellenwert für eine konstante Fehlalarmrate (CFAR) abzuleiten und die Anzahl der Fehlalarme niedrig zu halten. Daher umfasst der vorgeschlagene Detektor auch eine neuartige Methode zur automatischen Extraktion von Trainingsdaten für die Statistikschätzung sowie geeignete Ozean-Clutter-Modelle. Da es sich bei Schiffen um ausgedehnte Ziele handelt, die in hochauflösenden Radardaten mehr als eine Auflösungszelle belegen, werden nach der Detektion mehrere von einem Ziel stammende Pixel zu einem physischen Objekten zusammengefasst, das dann in aufeinanderfolgenden CPIs mit Hilfe eines Bewegungsmodells und eines neuen Mehrzielverfolgungs-Algorithmus (Multi-Target Tracking) getrackt wird. Während des Trackings werden falsche Zielspuren und Geisterzielspuren automatisch erkannt und durch ein leistungsfähiges datenbankbasiertes Track-Management-System terminiert. Die Zielspuren im Entfernungs-Doppler-Bereich werden geokodiert bzw. auf den Boden projiziert, nachdem die Einfallswinkel (DOA) aller Track-Punkte geschätzt wurden. Es werden verschiedene Methoden zur Schätzung der DOA-Winkel für ausgedehnte Ziele vorgeschlagen und anhand von echten Radardaten, die Signale von echten Schiffen beinhalten, bewertet

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

Tracking Target Signal Strengths on a Grid using Sparsity

Multi-target tracking is mainly challenged by the nonlinearity present in the measurement equation, and the difficulty in fast and accurate data association. To overcome these challenges, the present paper introduces a grid-based model in which the state captures target signal strengths on a known spatial grid (TSSG). This model leads to \emph{linear} state and measurement equations, which bypass data association and can afford state estimation via sparsity-aware Kalman filtering (KF). Leveraging the grid-induced sparsity of the novel model, two types of sparsity-cognizant TSSG-KF trackers are developed: one effects sparsity through $\ell_1$-norm regularization, and the other invokes sparsity as an extra measurement. Iterative extended KF and Gauss-Newton algorithms are developed for reduced-complexity tracking, along with accurate error covariance updates for assessing performance of the resultant sparsity-aware state estimators. Based on TSSG state estimates, more informative target position and track estimates can be obtained in a follow-up step, ensuring that track association and position estimation errors do not propagate back into TSSG state estimates. The novel TSSG trackers do not require knowing the number of targets or their signal strengths, and exhibit considerably lower complexity than the benchmark hidden Markov model filter, especially for a large number of targets. Numerical simulations demonstrate that sparsity-cognizant trackers enjoy improved root mean-square error performance at reduced complexity when compared to their sparsity-agnostic counterparts.Comment: Submitted to IEEE Trans. on Signal Processin

Data and resource management in wireless networks via data compression, GPS-free dissemination, and learning

“This research proposes several innovative approaches to collect data efficiently from large scale WSNs. First, a Z-compression algorithm has been proposed which exploits the temporal locality of the multi-dimensional sensing data and adapts the Z-order encoding algorithm to map multi-dimensional data to a one-dimensional data stream. The extended version of Z-compression adapts itself to working in low power WSNs running under low power listening (LPL) mode, and comprehensively analyzes its performance compressing both real-world and synthetic datasets. Second, it proposed an efficient geospatial based data collection scheme for IoTs that reduces redundant rebroadcast of up to 95% by only collecting the data of interest. As most of the low-cost wireless sensors won’t be equipped with a GPS module, the virtual coordinates are used to estimate the locations. The proposed work utilizes the anchor-based virtual coordinate system and DV-Hop (Distance vector of hops to anchors) to estimate the relative location of nodes to anchors. Also, it uses circle and hyperbola constraints to encode the position of interest (POI) and any user-defined trajectory into a data request message which allows only the sensors in the POI and routing trajectory to collect and route. It also provides location anonymity by avoiding using and transmitting GPS location information. This has been extended also for heterogeneous WSNs and refined the encoding algorithm by replacing the circle constraints with the ellipse constraints. Last, it proposes a framework that predicts the trajectory of the moving object using a Sequence-to-Sequence learning (Seq2Seq) model and only wakes-up the sensors that fall within the predicted trajectory of the moving object with a specially designed control packet. It reduces the computation time of encoding geospatial trajectory by more than 90% and preserves the location anonymity for the local edge servers”--Abstract, page iv

A Vector Channel Based Approach to MIMO Radar Waveform Design for Extended Targets

Radar systems have been used for many years for estimating, detecting, classifying, and imaging objects of interest (targets). Stealthier targets and more cluttered environments have created a need for more sophisticated radar systems to gain more precise information about the radar environment. Because modern radar systems are largely defined in software, adaptive radar systems have emerged that tailor system parameters such as the transmitted waveform and receiver filter to the target and environment in order to address this need. The basic structure of a radar system exhibits many similarities to the structure of a communication system. Recognizing the parallel composition of radar systems and information transmission systems, initial works have begun to explore the application of information theory to radar system design, but a great deal of work still remains to make a full and clear connection between the problems addressed by radar systems and communication systems. Forming a comprehensive definition of this connection between radar systems and information transmission systems and associated problem descriptions could facilitate the cross-discipline transfer of ideas and accelerate the development and improvement of new system design solutions in both fields. In particular, adaptive radar system design is a relatively new field which stands to benefit from the maturity of information theory developed for information transmission if a parallel can be drawn to clearly relate similar radar and communication problems. No known previous work has yet drawn a clear parallel between the general multiple-input multiple-output (MIMO) radar system model considering both the detection and estimation of multiple extended targets and a similar multiuser vector channel information transmission system model. The goal of this dissertation is to develop a novel vector channel framework to describe a MIMO radar system and to study information theoretic adaptive radar waveform design for detection and estimation of multiple radar targets within this framework. Specifically, this dissertation first provides a new compact vector channel model for representing a MIMO radar system which illustrates the parallel composition of radar systems and information transmission systems. Second, using the proposed framework this dissertation contributes a compressed sensing based information theoretic approach to waveform design for the detection of multiple extended targets in noiseless and noisy scenarios. Third, this dissertation defines the multiple extended target estimation problem within the framework and proposes a greedy signal to interference-plus-noise ratio (SINR) maximizing procedure based on a similar approach developed for a collaborative multibase wireless communication system to optimally design wave forms in this scenario