Dynamic Targets in CRRs Part II: Experiments and SAR Correspondence

Expressions describing the correspondence between moving-target artifacts for synthetic-aperture radar (SAR) and compact radar range (CRR) emulations are developed. Experimental results are then presented to verify the accuracy of these equations and to characterize the capacity of CRRs to emulate translating, vibrating, and rotating targets. We show that phase-compensation techniques can be applied to CRR data, providing a suitable test bed for SAR phase-compensation techniques.     

Multitarget tracking using the joint multitarget probability density

This work addresses the problem of tracking multiple moving targets by recursively estimating the joint multitarget probability density (JMPD). Estimation of the JMPD is done in a Bayesian framework and provides a method for tracking multiple targets which allows nonlinear target motion and measurement to state coupling as well as nonGaussian target state densities. The JMPD technique simultaneously estimates both the target states and the number of targets in the surveillance region based on the set of measurements made. We give an implementation of the JMPD method based on particle filtering techniques and provide an adaptive sampling scheme which explicitly models the multitarget nature of the problem. We show that this implementation of the JMPD technique provides a natural way to track a collection of targets, is computationally tractable, and performs well under difficult conditions such as target crossing, convoy movement, and low measurement signal-to-noise ratio (SNR).     

Multiple hypothesis track maintenance with possibly unresolved measurements

In surveillance problems dense clutter/dense target situations call for refined data association and tracking techniques. In addition, closely spaced targets may exist which are not resolved. This phenomenon has to be considered explicitly in the tracking algorithm. We concentrate on two targets which temporarily move in close formation and derive a generalization of MHT methods on the basis of a simple resolution model.     

Quantitative SNR analysis for ISAR imaging using jointtime-frequency analysis-Short time Fourier transform

V.C. Chen recently presented an inverse synthetic aperture radar (ISAR) imaging technique using the joint time-frequency analysis (JTFA), which has been shown having a better performance for maneuvering targets over the conventional Fourier transform method. The main reason is because the frequencies of the radar returns of the maneuvering targets are time varying and a JTFA is a technique that is suitable for such signals, in particular a JTFA may concentrate a wideband signal, such as a chirp, while it spreads noise. We quantitatively study the signal-to-noise ratio (SNR) in the ISAR imaging using one of the typical JTFA techniques, namely the short time Fourier transform (STFT). We show that the SNR increases in the joint time-frequency (TF) domain over the one in the time or the frequency domain alone both theoretically and numerically. This quantitatively shows the advantage of the JTFA technique for the ISAR imaging     

Data fusion for ground moving target tracking

The aim of ground surveillance is the large scale, continuous and near real time determination of a dynamical ground picture. This task comprises detection and tracking of moving single targets and convoys, mobile weapon systems, and military equipment. The sensors of choice are airborne Ground Moving Target Indicator (GMTI) radar and synthetic aperture radar (SAR). As ground target tracking often suffers from dense target situations, high clutter, and low visibility, the integration and fusion of external background information is essential for providing precise and continuous tracks. We present Multi Hypotheses techniques for tracking several targets in complex ground situations with clutter. Methods to incorporate topographic information, in particular digital road maps, are described and demonstrated.     

Novel data association schemes for the probability hypothesis density filter

The probability hypothesis density (PHD) filter is a practical alternative to the optimal Bayesian multi-target Alter based on finite set statistics. It propagates the PHD function, a first-order moment of the full multi-target posterior density. The peaks of the PHD function give estimates of target states. However, the PHD filter keeps no record of target identities and hence does not produce track-valued estimates of individual targets. We propose two different schemes according to which PHD filter can provide track-valued estimates of individual targets. Both schemes use the probabilistic data-association functionality albeit in different ways. In the first scheme, the outputs of the PHD filter are partitioned into tracks by performing track-to-estimate association. The second scheme uses the PHD filter as a clutter filter to eliminate some of the clutter from the measurement set before it is subjected to existing data association techniques. In both schemes, the PHD filter effectively reduces the size of the data that would be subject to data association. We consider the use of multiple hypothesis tracking (MHT) for the purpose of data association. The performance of the proposed schemes are discussed and compared with that of MHT.     

Improved multi-target tracking in clutter by PDA smoothing

An algorithm is presented for the recursive tracking of multiple targets in cluttered environment by making use of the joint probabilistic data association fixed-lag smoothing (JPDAS) techniques. It is shown that a significant improvement in the accuracy of track estimation of both nonmaneuvering and maneuvering targets may be achieved by introducing a time lag of one or two sampling periods between the instants of estimation and latest measurement. Results of simulation experiments for a radar tracking problem that demonstrate the effects of fixed-lag smoothing are also presented     

Layover solution in multibaseline SAR interferometry

In this work, spectral estimation techniques are used to exploit baseline diversity of a multichannel interferometric synthetic aperture radar (SAR) system and overcome the layover problem. This problem arises when different height contributions collapse in the same range-azimuth resolution cell, due to the presence of strong terrain slopes or discontinuities in the sensed scene. We propose a multilook approach to counteract the presence of multiplicative noise, which is due to the extended nature of natural targets; to this purpose we extend the RELAX algorithm to the multilook data scenario (M-RELAX). A thorough performance analysis of nonparametric (beamforming and Capon) and parametric (root MUSIC and M-RELAX) techniques is carried out based on Monte Carlo simulations and Cramer-Rao lower bounds (CRLB) calculation. The results suggest the superiority of parametric methods over nonparametric ones.     

NCTR Plus Sensor Fusion Equals IFFN or can Two Plus Two Equal Five?

Fowler's Seventh Law for military systems [1] states: "Be wary of proposals for synergistic systems. Most of the time when you try to make 2 + 2 = 5, you end up with 3-and sometimes 1.9." We attempt to approach the broad issues of IFFN (identification, friend, foe, neutral) of military targets via the techniques of NCTR (noncooperative target recognition), coupled with the systems approach called "sensor fusion." Although the overall style of the paper is that of a tutorial, many of the results presented are original. In all cases where we make political obsrvations, they represent our personal opinions.     

Comparison of Two Target Classification Techniques

It has been shown that radar returns in the resonance region carry information regarding the overall dimensions and shape of targets. Two radar target classification techniques developed to utilize such returns are discussed. Both of these techniques utilize resonance region backscatter measurements of the radar cross section (RCS) and the intrinsic target backscattered phase. A target catalog used for testing the techniques was generated from measurements of the RCS of scale models of modern aircraft and naval ships using a radar range at The Ohio State University. To test the classification technique, targets had their RCS and phase taken from the data base and corrupted by errors to simulate full-scale propagation path and processing distortion. Several classification methods were then used to determine how well the corrupted measurements fit the measurement target signatures in the catalog. The first technique uses nearest neighbor (NN) algorithms on the RCS magnitude and (range corrected) phase at a number (e.g., 2, 4, or 8) of operating frequencies. The second technique uses an inverse Fourier transformation of the complex multifrequency radar returns to the time domain followed by cross correlation. Comparisons are made of the performance of the two techniques as a function of signal-to-error noise power ratio for various processing options.     

Monte Carlo filtering for multi target tracking and data association

We present Monte Carlo methods for multi-target tracking and data association. The methods are applicable to general nonlinear and non-Gaussian models for the target dynamics and measurement likelihood. We provide efficient solutions to two very pertinent problems: the data association problem that arises due to unlabelled measurements in the presence of clutter, and the curse of dimensionality that arises due to the increased size of the state-space associated with multiple targets. We develop a number of algorithms to achieve this. The first, which we refer to as the Monte Carlo joint probabilistic data association filter (MC-JPDAF), is a generalisation of the strategy proposed by Schulz et al. (2001) and Schulz et al. (2003). As is the case for the JPDAF, the distributions of interest are the marginal filtering distributions for each of the targets, but these are approximated with particles rather than Gaussians. We also develop two extensions to the standard particle filtering methodology for tracking multiple targets. The first, which we refer to as the sequential sampling particle filter (SSPF), samples the individual targets sequentially by utilising a factorisation of the importance weights. The second, which we refer to as the independent partition particle filter (IPPF), assumes the associations to be independent over the individual targets, leading to an efficient component-wise sampling strategy to construct new particles. We evaluate and compare the proposed methods on a challenging synthetic tracking problem.     

Low-Angle Radar Tracking in the Presence of Multipath

This paper is concerned with the problem of tracking radar targets in the low-angle regime where conventional tracking radars encounter difficulty due to the presence of a surface-reflected ray. Starting with a classical maximum-likelihood analysis of the problem of two closely spaced targets, two different techniques are evolved which are theoretically capable of dealing with the multipath problem. The expected accuracy has been studied both analytically and by means of computer simulations. Experimental programs have demonstrated the feasibility of both techniques. The paper also includes a discussion of certain alternative solutions to the problem.     

Target Detection and Parameter Estimation for MIMO Radar Systems

We investigate several target detection and parameter estimation techniques for a multiple-input multiple-output (MIMO) radar system. By transmitting independent waveforms via different antennas, the echoes due to targets at different locations are linearly independent of each other, which allows the direct application of many data-dependent beamforming techniques to achieve high resolution and excellent interference rejection capability. In the absence of array steering vector errors, we discuss the application of several existing data-dependent beamforming algorithms including Capon, APES (amplitude and phase estimation) and CAPES (combined Capon and APES), and then propose an alternative estimation procedure, referred to as the combined Capon and approximate maximum likelihood (CAML) method. Via several numerical examples, we show that the proposed CAML method can provide excellent estimation accuracy of both target locations and target amplitudes. In the presence of array steering vector errors, we apply the robust Capon beamformer (RCB) and doubly constrained robust Capon beamformer (DCRCB) approaches to the MIMO radar system to achieve accurate parameter estimation and superior interference and jamming suppression performance.     

Aperture Sampling Techniques for Precision Direction Finding

The resolution and tracking of radar targets which are close to. gether is a classical problem which is receiving increased attention. Improving the angular resolution by sampling the received wave front along the aperture and then applying modern "high resolution" spectrum estimation techniques (e. g., maximum likelihood and maximum entropy processing) to the spatial sample data is discussed. Experimental results are presented for the application ion of these techniques to field data from a L- band line array.     

利用分数阶Fourier域滤波的机载SAR多运动目标检测

 强度相差较大的多运动目标检测是机载合成孔径雷达 ( SAR)技术的一个重点和难点,传统的频域滤波和现代的时频分布方法都无法解决这个问题。首先分析了机载 SAR运动目标回波本质上为线性调频信号,据此提出一种基于分数阶 Fourier域滤波的运动目标检测新方法,并且应用逐次消去的思想有效地解决了强度相差较大的多目标检测问题。仿真的结果验证了算法的有效性。     

Measurement of Closely Spaced Point Targets

An algorithm for the measurement of closely spaced point targets is developed. The underlying concept is the method of moment estimation, in both the time and frequency domains. It is shown that Baum's algorithm is a special case of the results presented. The estimation techniques described herein do not assume that the separation of the point targets is greater than the waveform resolution. As a result, the distance between the point targets could be measured well below the Rayleigh limit. Since the results presented are based on the use of a single-pulse record, the outlined methodology is particularly suitable for real-time signal processing. Digital simulation is performed to demonstrate the feasibility of the working models.     

Partially Adaptive STAP using the FRACTA Algorithm

A partially adaptive space-time adaptive processor (STAP) utilizing the recently developed FRACTA algorithm is presented which significantly reduces the high computational complexity and large sample support requirements of fully adaptive STAP. Multi-window post-Doppler dimensionality reduction techniques are employed to transform the data prior to application of the FRACTA algorithm. The FRACTA algorithm is a reiterative censoring (RC) and detection algorithm which has been shown to provide excellent detection performance in nonhomogeneous interference environments. Two multi-window post-Doppler dimensionality reduction techniques are considered: PRI-staggered and adjacent-bin. The partially adaptive FRACTA algorithm is applied to the KASSPER I (Knowledge-Aided Sensor Signal Processing & Expert Reasoning) challenge datacube. The pulse repetition interval (PRI)-staggered approach with D=6 filters per Doppler bin is found to provide the best detection performance, outperforming the fully adaptive case while simultaneously reducing the runtime by a factor of ten. Using this implementation, partially adaptive FRACTA detects 197 out of 268 targets with one false alarm. The clairvoyant processor (the covariance matrix for each range cell is known) detects 198 targets with one false alarm. In addition, the partially adaptive FRACTA algorithm is shown to be resilient to jamming, and performs well for reduced sample support situations. When compared with partially adaptive STAP using traditional sliding window processing (SWP), the runtime of partially adaptive FRACTA is 14 times faster, and the detection performance is significantly increased (SWP detects 46 out of 268 targets with one false alarm).     

Bayesian and Dempster-Shafer target identification for radarsurveillance

This paper considers the problem of target track identification in a radar surveillance system. To build a target identifier alongside a tracker, four features which are available for real-time processing in an air surveillance system are used here: target identity (TID) from a friend-and-foe identification (IFF) system, elevation measurement from the radar, target speed, and acceleration estimated by a tracker. These four features are combined to classify air targets into five different air target categories: friendly commercial, friendly military, hostile commercial (or unknown airline), hostile military, and false targets (clutter). Two popular statistic-based techniques, namely, the Bayesian and Dempster-Shafer methods, are applied to develop radar target identification algorithms for our application. Real-life as well as simulated air surveillance radar data are used to evaluate the practicality and effectiveness of this track identification approach in a radar surveillance system