Phase History Decomposition for Efficient Scatterer Classification in SAR Imagery

A new theory and algorithm for scatterer classification in SAR imagery is presented. The automated classification process is operationally efficient compared to existing image segmentation methods requiring human supervision. The algorithm reconstructs coarse resolution subimages from subdomains of the SAR phase history. It analyzes local peaks in the subimages to determine locations and geometric shapes of scatterers in the scene. Scatterer locations are indicated by the presence of a stable peak in all subimages for a given subaperture, while scatterer shapes are indicated by changes in pixel intensity. A new multi-peak model is developed from physical models of electromagnetic scattering to predict how pixel intensities behave for different scatterer shapes. The algorithm uses a least squares classifier to match observed pixel behavior to the model. Classification accuracy improves with increasing fractional bandwidth and is subject to the high-frequency and wide-aperture approximations of the multi-peak model. For superior computational efficiency, an integrated fast SAR imaging technique is developed to combine the coarse resolution subimages into a final SAR image having fine resolution. Finally, classification results are overlaid on the SAR image so that analysts can deduce the significance of the scatterer shape information within the image context

Knowledge-Aided STAP Using Low Rank and Geometry Properties

This paper presents knowledge-aided space-time adaptive processing (KA-STAP) algorithms that exploit the low-rank dominant clutter and the array geometry properties (LRGP) for airborne radar applications. The core idea is to exploit the fact that the clutter subspace is only determined by the space-time steering vectors, {red}{where the Gram-Schmidt orthogonalization approach is employed to compute the clutter subspace. Specifically, for a side-looking uniformly spaced linear array, the} algorithm firstly selects a group of linearly independent space-time steering vectors using LRGP that can represent the clutter subspace. By performing the Gram-Schmidt orthogonalization procedure, the orthogonal bases of the clutter subspace are obtained, followed by two approaches to compute the STAP filter weights. To overcome the performance degradation caused by the non-ideal effects, a KA-STAP algorithm that combines the covariance matrix taper (CMT) is proposed. For practical applications, a reduced-dimension version of the proposed KA-STAP algorithm is also developed. The simulation results illustrate the effectiveness of our proposed algorithms, and show that the proposed algorithms converge rapidly and provide a SINR improvement over existing methods when using a very small number of snapshots.Comment: 16 figures, 12 pages. IEEE Transactions on Aerospace and Electronic Systems, 201

Signal Subspace Processing in the Beam Space of a True Time Delay Beamformer Bank

A number of techniques for Radio Frequency (RF) source location for wide bandwidth signals have been described that utilize coherent signal subspace processing, but often suffer from limitations such as the requirement for preliminary source location estimation, the need to apply the technique iteratively, computational expense or others. This dissertation examines a method that performs subspace processing of the data from a bank of true time delay beamformers. The spatial diversity of the beamformer bank alleviates the need for a preliminary estimate while simultaneously reducing the dimensionality of subsequent signal subspace processing resulting in computational efficiency. The pointing direction of the true time delay beams is independent of frequency, which results in a mapping from element space to beam space that is wide bandwidth in nature. This dissertation reviews previous methods, introduces the present method, presents simulation results that demonstrate the assertions, discusses an analysis of performance in relation to the Cramer-Rao Lower Bound (CRLB) with various levels of noise in the system, and discusses computational efficiency. One limitation of the method is that in practice it may be appropriate for systems that can tolerate a limited field of view. The application of Electronic Intelligence is one such application. This application is discussed as one that is appropriate for a method exhibiting high resolution of very wide bandwidth closely spaced sources and often does not require a wide field of view. In relation to system applications, this dissertation also discusses practical employment of the novel method in terms of antenna elements, arrays, platforms, engagement geometries, and other parameters. The true time delay beam space method is shown through modeling and simulation to be capable of resolving closely spaced very wideband sources over a relevant field of view in a single algorithmic pass, requiring no course preliminary estimation, and exhibiting low computational expense superior to many previous wideband coherent integration techniques

Signal Subspace Processing in the Beam Space of a True Time Delay Beamformer Bank

A number of techniques for Radio Frequency (RF) source location for wide bandwidth signals have been described that utilize coherent signal subspace processing, but often suffer from limitations such as the requirement for preliminary source location estimation, the need to apply the technique iteratively, computational expense or others. This dissertation examines a method that performs subspace processing of the data from a bank of true time delay beamformers. The spatial diversity of the beamformer bank alleviates the need for a preliminary estimate while simultaneously reducing the dimensionality of subsequent signal subspace processing resulting in computational efficiency. The pointing direction of the true time delay beams is independent of frequency, which results in a mapping from element space to beam space that is wide bandwidth in nature. This dissertation reviews previous methods, introduces the present method, presents simulation results that demonstrate the assertions, discusses an analysis of performance in relation to the Cramer-Rao Lower Bound (CRLB) with various levels of noise in the system, and discusses computational efficiency. One limitation of the method is that in practice it may be appropriate for systems that can tolerate a limited field of view. The application of Electronic Intelligence is one such application. This application is discussed as one that is appropriate for a method exhibiting high resolution of very wide bandwidth closely spaced sources and often does not require a wide field of view. In relation to system applications, this dissertation also discusses practical employment of the novel method in terms of antenna elements, arrays, platforms, engagement geometries, and other parameters. The true time delay beam space method is shown through modeling and simulation to be capable of resolving closely spaced very wideband sources over a relevant field of view in a single algorithmic pass, requiring no course preliminary estimation, and exhibiting low computational expense superior to many previous wideband coherent integration techniques

A scalable real-time processing chain for radar exploiting illuminators of opportunity

Includes bibliographical references.This thesis details the design of a processing chain and system software for a commensal radar system, that is, a radar that makes use of illuminators of opportunity to provide the transmitted waveform. The stages of data acquisition from receiver back-end, direct path interference and clutter suppression, range/Doppler processing and target detection are described and targeted to general purpose commercial off-the-shelf computing hardware. A detailed low level design of such a processing chain for commensal radar which includes both processing stages and processing stage interactions has, to date, not been presented in the Literature. Furthermore, a novel deployment configuration for a networked multi-site FM broadcast band commensal radar system is presented in which the reference and surveillance channels are record at separate locations

Static Background Removal in Vehicular Radar: Filtering in Azimuth-Elevation-Doppler Domain

A significant challenge in autonomous driving systems lies in image understanding within complex environments, particularly dense traffic scenarios. An effective solution to this challenge involves removing the background or static objects from the scene, so as to enhance the detection of moving targets as key component of improving overall system performance. In this paper, we present an efficient algorithm for background removal in automotive radar applications, specifically utilizing a frequency-modulated continuous wave (FMCW) radar. Our proposed algorithm follows a three-step approach, encompassing radar signal preprocessing, three-dimensional (3D) ego-motion estimation, and notch filter-based background removal in the azimuth-elevation-Doppler domain. To begin, we model the received signal of the FMCW multiple-input multiple-output (MIMO) radar and develop a signal processing framework for extracting four-dimensional (4D) point clouds. Subsequently, we introduce a robust 3D ego-motion estimation algorithm that accurately estimates radar ego-motion speed, accounting for Doppler ambiguity, by processing the point clouds. Additionally, our algorithm leverages the relationship between Doppler velocity, azimuth angle, elevation angle, and radar ego-motion speed to identify the spectrum belonging to background clutter. Subsequently, we employ notch filters to effectively filter out the background clutter. The performance of our algorithm is evaluated using both simulated data and extensive experiments with real-world data. The results demonstrate its effectiveness in efficiently removing background clutter and enhacing perception within complex environments. By offering a fast and computationally efficient solution, our approach effectively addresses challenges posed by non-homogeneous environments and real-time processing requirements

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