Track-While-Scan Algorithm in a Clutter Environment

A track-while scan (TWS) algorithm is developed for targets in a clutter environment. The problem has been studied using only the position measurements [1, 5-8], but the simulation results have not been satisfactory. Modern processing techniques (FFT processor) ) in air traffic control and surveillance radar receivers provide both position and radial velocity. The radial velocity measurement may be conveniently used in the target-track correlation process, which will reduce the association ambiguity in the clutter environment. t. In the clear environment the algorithm using the position and radial velocity measurements has been treated in [3, 4]. A TWS algorithm, using both position and radial velocity measurements for targets in a clutter environment, is presented here. The algorithm obtained is nonlinear and adaptive. In order to evaluate the improvement due to radial velocity measurement a simulation has been performed on a digital computer. The algorithm was run with and without radial velocity measurements to compare its performances. An improvement was noted especially when the target path included an accelerated portion.     

Structures for radar detection in compound Gaussian clutter

The problem of coherent radar target detection in a background of non-Gaussian clutter modeled by a compound Gaussian distribution is studied here. We show how the likelihood ratio may be recast into an estimator-correlator form that shows that an essential feature of the optimal detector is to compute an optimum estimate of the reciprocal of the unknown random local power level. We then proceed to show that the optimal detector may be recast into yet another form, namely a matched filter compared with a data-dependent threshold. With these reformulations of the optimal detector, the problem of obtaining suboptimal detectors may be systematically studied by either approximating the likelihood ratio directly, utilizing a suboptimal estimate in the estimator-correlator structure or utilizing a suboptimal function to model the data-dependent threshold in the matched filter interpretation. Each of these approaches is studied to obtain suboptimal detectors. The results indicate that for processing small numbers of pulses, a suboptimal detector that utilizes information about the nature of the non-Gaussian clutter can be implemented to obtain quasi-optimal performance. As the number of pulses to be processed increases, a suboptimal detector that does not require information about the specific nature of the non-Gaussian clutter may be implemented to obtain quasi-optimal performance     

An Application of Evidential Networks to Threat Assessment

Decision makers operating in modern defence theatres need to comprehend and reason with huge quantities of potentially uncertain and imprecise data in a timely fashion. An automatic information fusion system is developed which aims at supporting a commander's decision making by providing a threat assessment, that is an estimate of the extent to which an enemy platform poses a threat based on evidence about its intent and capability. Threat is modelled by a network of entities and relationships between them, while the uncertainties in the relationships are represented by belief functions as defined in the theory of evidence. To support the implementation of the threat assessment functionality, an efficient valuation-based reasoning scheme, referred to as an evidential network, is developed. To reduce computational overheads, the scheme performs local computations in the network by applying an inward propagation algorithm to the underlying binary join tree. This allows the dynamic nature of the external evidence, which drives the evidential network, to be taken into account by recomputing only the affected paths in the binary join tree.     

Radar Detection of Correlated Targets in Clutter

This paper provides general models of radar echoes from a target. The rationale of the approach is to consider the echoes as the output of a linear dynamic system driven by white Gaussian noise (WGN). Two models can be conceived to generate N target returns: samples generated as a batch, or sequentially generated one by one. The models allow the accommodation of any correlation between pulses and nonstationary behavior of the target. The problem of deriving the optimum receiver structure is next considered. The theory of "estimator-correlator" receiver is applied to the case of a Gaussian-distributed time-correlated target embedded in clutter and thermal noise. Two equivalent detection schemes are obtained (i. e., the batch detector and the recursive detector) which are related to the above mentioned procedures of generating radar echoes. A combined analytic-numeric method has been conceived to obtain a set of original detection curves related to operational cases of interest. Finally, an adaptive implementation of the proposed processor is suggested, especially with reference to the problem of on-line estimation of the clutter covariance matrix and of the CFAR threshold. In both cases detection loss due to adaptation has been evaluated by means of a Monte Carlo simulation approach. In summary, the original contributions of the paper lie in the mathematical formulation of a powerful model for radar echoes and in the derivation of a large set of detection curves.     

Hard-constrained versus soft-constrained parameter estimation

The paper aims at contrasting two different ways of incorporating a priori information in parameter estimation, i.e., hard-constrained and soft-constrained estimation. Hard-constrained estimation can be interpreted, in the Bayesian framework, as maximum a posteriori probability (MAP) estimation with uniform prior distribution over the constraining set, and amounts to a constrained least-squares (LS) optimization. Novel analytical results on the statistics of the hard-constrained estimator are presented for a linear regression model subject to lower and upper bounds on a single parameter. This analysis allows to quantify the mean squared error (MSE) reduction implied by constraints and to see how this depends on the size of the constraining set compared with the confidence regions of the unconstrained estimator. Contrastingly, soft-constrained estimation can be regarded as MAP estimation with Gaussian prior distribution and amounts to a less computationally demanding unconstrained LS optimization with a cost suitably modified by the mean and covariance of the Gaussian distribution. Results on the design of the prior covariance of the soft-constrained estimator for optimal MSE performance are also given. Finally, a practical case-study concerning a line fitting estimation problem is presented in order to validate the theoretical results derived in the paper as well as to compare the performance of the hard-constrained and soft-constrained approaches under different settings     

Tracking of a Ballistic Missile with A-Priori Information

The paper addresses the problem of estimating the launch and impact points of a ballistic target from radar measurements. The problem has been faced under different hypotheses on the available prior knowledge. The proposed approach combines a nonlinear batch estimator with a recursive MM (multiple model) particle filter in order to attain the estimation goal. Extensive simulations assess the achievable estimation performance.     

Space-time-frequency processing of synthetic aperture radar signals

The subject of this work is the detection and high resolution microwave imaging of objects moving on the ground and observed by an airborne radar. The proposed approach is based on a combined space-time and time-frequency processing. The space-time processing makes use of a linear array antenna and exploits the radar motion for filtering the received echoes in order to improve as much as possible the signal-to-disturbance ratio. The signal is then mapped onto the time-frequency domain, by computing its Wigner-Ville distribution, for a further filtering and for estimating its instantaneous frequency, necessary for the formation of a high resolution image of the moving object     

CFAR behavior of adaptive detectors: an experimental analysis

We conduct an experimental analysis for assessing the constant false alarm rate (CFAR) behavior of four coherent adaptive radar detectors in the presence of experimentally measured clutter data. To this end we exploit several data files containing both land, lake, and mixed land and sea clutter, collected by two radar systems (the MIT Lincoln Laboratory Phase-One radar and the McMaster IPIX radar) at different polarizations, range resolutions, and frequency bands. The results show that all the receivers, in the presence of real data, don't respect their nominal probability of false alarm (P/sub fa/), namely they exhibit a false alarm rate higher than the value preassigned at the design stage. Nevertheless one of them, the recursive persymmetric adaptive normalized matched filter (RP-ANMF) is very robust, in the sense that it presents an acceptable displacement from the nominal P/sub fa/, in correspondence of all the analyzed scenarios.     

Performance measure for Markovian switching systems using best-fitting Gaussian distributions

This paper considers the theoretical posterior Cramer-Rao lower bound (PCRLB) for the case of tracking a manoeuvring target with Markovian switching dynamics. In a recent article [2] it was proposed to calculate the PCRLB conditional on the manoeuvre sequence and then determine the bound as a weighted average, giving an unconditional PCRLB. However, we demonstrate that this approach can produce an overly optimistic lower bound, because the sequence of manoeuvres is implicitly assumed known. Motivated by this, we develop a general approach and derive a closed-form estimate of the PCRLB in the case of Markovian switching systems. The basis of the approach is to, at each time step, replace the multi-modal prior target probability density function (pdf) with a best-fitting Gaussian (BFG) approximation. We present a recursive formula for calculating the mean and covariance of this Gaussian distribution, and demonstrate how the covariance increases as a result of the potential manoeuvres. We are then able to calculate the PCRLB for this BFG model using an existing Riccati-like recursion. Because of the BFG approximation, we are no longer guaranteed a bound and so we refer to our estimate as an "error performance measure" rather than a bound. The presented approach is applied both to filtering and smoothing cases. The simulation results indicate a very close agreement between the proposed performance measure and the error performance of an interacting multiple model estimator.     

A self-normalizing gradient search adaptive array algorithm

A method is described to normalize the step parameter and perturbation amount used for gradient search adaptive algorithms. The step normalization assures rapid stable convergence. The perturbation normalization also assures rapid stable convergence and limits the output perturbation noise to a level below thermal noise. The normalizations are computationally simple and are consistent with the use of a single receiver at the adaptive array output. Results are presented to verify the robustness of the technique.<>