CFAR detection of distributed targets in non-Gaussian disturbance

The subject of detection of spatially distributed targets in non-Gaussian noise with unknown statistics is addressed. At the design stage, in order to cope with the a priori uncertainty, we model noise returns as Gaussian vectors with the same structure of the covariance matrix, but possibly different power levels (heterogeneous environment). We also assume that a set of secondary data, free of signal components, is available to estimate the correlation properties of the disturbance The proposed detector assumes no a priori knowledge about the spatial distribution of the target scatterers and ensures the constant false alarm rate (CFAR) property with respect to both the structure of the covariance matrix and the power levels. Finally, the performance assessment, conducted modeling the disturbance as a spherically invariant random process (SIRP), confirms its validity to operate in real radar scenarios     

A CFAR Design for a Window Spanning Two Clutter Fields

When the heterogeneous clutter field spanning the spatial sampling sliding window can be modeled as two contiguous homogeneous clutter fields with the statistical parameters of each field unknown and independent from field to field and with the transition point between fields also not known, then the cell-averaging constant false alarm rate (CFAR) performance significantly degrades, yielding target masking effects and loss of false alarm regulation. For the same defined and encountered environment spanning the sliding window, the performance degradation effects are shown to be largely eliminated when a newly developed class of CFAR tests is employed. These tests are designated as heterogeneous clutter estimating CFARs (HCE-CFAR). The test initially involves the combined use of multiple hypothesis testing and maximum likelihood estimation procedures to estimate the statistical parameters of each of the two fields, and the transition point between them, and then makes use of the relevant estimated clutter field parameters to effect the final decision rule. HCE-CFAR designs are presented for both the cases when the contiguous fields have Rayleigh first-order probability distributions, and log-normal probability distribution. However, the focus of the development and the conducted performance evaluation is for the Rayleigh clutter cases.     

Detection loss due to interfering targets in ordered statisticsCFAR

The ordered-statistics (OS) constant false-alarm rate (CFAR) is relatively immune to the presence of interfering targets among the reference cells used to determine the average background. OS CFAR performance in a multitarget environment was previously studied by simulation. The author obtains analytic expressions for the added detection loss, assuming strong interfering targets. The real target is assumed to be a Rayleigh fluctuating target. Numerical examples are included     

Biparametric linear estimation for CFAR against Weibull clutter

The authors deal with constant false alarm rate (CFAR) procedures against nonstationary clutter, modeled as a Weibull distributed process whose scale parameter α and shape parameter β are both variable. It is shown that conventional CFAR procedures, which compensate only for α, degrade intolerably as β deviates from β=2, namely, as the Rayleigh distributional assumption is violated. A biparametric CFAR procedure is shown to be suited to such situations. The authors introduce a logarithmic transformation to reduce the Weibull probability density function (pdf) to a Gumbel pdf, i.e., to the location-scale type, and then exploit the best linear unbiased estimation (BLUE) of location-scale parameters to adjust the detection threshold. True CFAR is thus achieved when the clutter is locally homogeneous. Resilience against local inhomogeneities can also be conferred since BLUE lends itself to censoring. Through a performance analysis, the influence of various system and distributional parameters is elicited     

基于Nash-Pareto策略的两种改进算法及其应用

针对多目标、多设计变量的优化问题,提出了两种优化的新算法:一种是将多目标问题转化为单目标时,对目标权重的确定提出了新的途径;另一种是直接对多目标问题进行优化,并对Pareto遗传优化技术作了改进,以得到均匀分布的Pareto最优解集.两种新算法都是建立在Nash的系统分解与Pareto遗传算法的基础上,因此称这类算法为Nash-Pareto策略.借助于这类算法,文中以跨声速压气机双圆弧类叶型的气动优化为例,给出了气动优化的全过程.数值优化的实验表明所给出的改进算法是可行的、有效的.     

Covariance matrix estimation for adaptive CFAR detection incompound-Gaussian clutter

We address the estimation of the structure of the covariance matrix and its application to adaptive radar detection of coherent pulse trains in clutter-dominated disturbance modeled as a compound-Gaussian process. For estimation purposes we resort to range cells in spatial proximity with that under test and assume that these cells, free of signal components, can be clustered into groups of data with one and the same value of the texture. We prove that, plugging the proposed estimator of the structure of the covariance matrix into a previously derived detector, based upon the generalized likelihood ratio test (GLRT), leads to an adaptive detector which ensures the constant false alarm rate (CFAR) property with respect to the clutter covariance matrix as well as the statistics of the texture. Finally, we show that this adaptive receiver has an acceptable loss with respect to its nonadaptive counterpart in cases of relevant interest for radar applications     

Ordered Statistic CFAR Processing for Two-Parameter Distributions with Variable Skewness

Rohling has developed a constant false alarm rate (CFAR) technique based on ordered statistics of the reference cells. An extension of his technique is presented that maintains a CFAR for two-parameter distributions, with both mean power and skewness variable. The new method is therefore more robust, but has higher CFAR loss than the single-parameter technique.     

Use of genetic algorithms in ISAR imaging of targets with higher order motions

Genetic algorithms (GA) are proposed for inverse synthetic aperture radar (ISAR) imaging. GA is used for motion parameters search in place of exhaustive search in the adaptive joint time-frequency (AJTF) algorithm. While maintaining the same accuracy, GA has lower computational complexity, especially for targets with higher order motions.     

Analysis of some modified ordered statistic CFAR: OSGO and OSSOCFAR

It is necessary for automatic detection radars to be adaptive to variations in background clutter in order to maintain a constant false alarm rate (CFAR). A CFAR based on an ordered statistic technique (OS CFAR) has some advantages over the cell-averaging technique (CA CFAR), especially in clutter edges or multiple target environments; unfortunately the large processing time required by this technique limits its use. The authors present two new OS CFARs that require only ahlf the processing time. One is an ordered statistic greatest of CFAR (OSGO), while the other is an ordered statistic smallest of CFAR (OSSO). The OSGO CFAR has the advantages of the OS CFAR with only a negligible increment to the CFAR loss     

Architectures and algorithms for track association and fusion

Target tracking using multiple sensors can provide better performance than using a single sensor. One approach to multiple target tracking with multiple sensors is to first perform single sensor tracking and then fuse the tracks from the different sensors. Two processing architectures for track fusion are presented: sensor to sensor track fusion, and sensor to system track fusion. Technical issues related to the statistical correlation between track estimation errors are discussed. Approaches for associating the tracks and combining the track state estimates of associated tracks that account for this correlation are described and compared by both theoretical analysis and Monte Carlo simulations     

The Detection Performance of the Siebert and Dicke-Fix CFAR Radar Detectors

The Siebert and the Dicke-fix CFAR radar detectors, used to maintain a constant false alarm rate (CFAR) in radar receivers under very similar circumstances, are considered. The Siebert detector represents the maximum-likelihood detection procedure for a signal in Gaussian noise of unknown power level, whereas the Dicke-fix makes use of a bandpass limiter to normalize the input and thus ensure a constant false alarm rate. The detection performance of the two detectors is determined and a comparison shows that over a wide range of parameters, the Dicke-fix introduces a loss which is approximately 1 B larger than for the Siebert detector.     

Renewal models for maneuvering targets

Most model-based tracking algorithms represent the temporal dynamics of a maneuver acceleration with a Markov process. The sample paths so generated may not be plausible. A renewal process model is shown to be more realistic, but a tracker based upon it is seen to be more complicated to implement. The response of the renewal-model tracker is compared with a simpler estimator based upon a Markov model both for the case in which the tracker utilizes an imager, and the case where it does not. It is shown in the latter case that performance improvement is not commensurate with algorithmic complexity. For an image-enhanced tracker, a sophisticated model of target dynamics promises significant performance improvement     

OS-CFAR theory for multiple targets and nonuniform clutter

The performance of a cell averaging constant false-alarm rate (CA-CFAR) detector degrades rapidly in nonideal conditions caused by multiple targets and nonuniform clutter. The ordered-statistic CFAR (OS-CFAR) is an alternative to the CA-CFAR. The OS-CFAR trades a small loss in detection performance relative to the CA-CFAR in ideal conditions for much less performance degradation in nonideal conditions. A formula is given for the detection probability of the OS-CFAR when there are multiple Swerling I targets in the CFAR window, and a formula is given for the probability of false alarm in nonuniform Raleigh clutter     

Extended PGA for range migration algorithms

The phase gradient autofocus (PGA) algorithm is extended to work for synthetic aperture radar (SAR) spotlight images processed with range migration (w-k) algorithms. Several pre-processing steps are proposed for aligning the range-compressed phase-history data needed for successful autofocusing of the data. The proposed algorithm gave good results for both data with large point targets and data without point targets.     

Radar measurement accuracy for fluctuating targets

The impact of target radar cross-section (RCS) fluctuations on the thermal noise limited accuracy of radar measurements of range, range rate, and angle are evaluated for the Swerling fluctuation models. For large signal-to-noise ratios (SNRs), the accuracy criterion used is the measurement error with the same probability span as the one corresponding to the standard deviation points of the measurement error for the nonfluctuating model.<>     

Filters and algorithms for rotation rate detection in fiber-opticgyroscopes

A digital filter structure and processing scheme is being presented, featuring a minimum hardware effort and efficient means of computing rotation rates in fiber-optic gyroscopes. Its advantages over current analog and digital detection methods are pointed out. The problem of aliasing and quantization in digital filters limiting system performance is addressed. Test results document successful implementation of algorithms introduced     

Fast alignment and calibration algorithms for inertial navigation system

Algorithms for fast estimating the azimuth misalignment angle and calibrating gyro drift rates are approached from the point of view of control theory. By introducing the Lyapunov transformation, the equivalence of Strapdown Inertial Navigation System (SINS) and Gimbaled Inertial Navigation System (GINS) is discussed, and it shows that the analysis results of GINS can be applied to SINS directly by using such kind of equivalence. A similar transformation that based on physical essence is introduced, so that the true states can be replaced by the so-called pseudo-states, and then the observable states of INS can be dynamically decoupled with the unobservable states. Consequently, the best completely observable subsystem model of INS can be obtained. Based on the simplified subsystem model of INS, the algorithms for fast estimating the azimuth misalignment angle and calibrating gyro drift rates are proposed. The proposed algorithms show that the azimuth misalignment angle and gyro drift rates can be estimated from the rates of leveling misalignment angles without using the gyro output signals.     

GLRT subspace detection for range and Doppler distributed targets

A generalized likelihood ratio test (GLRT) is derived for adaptive detection of range and Doppler-distributed targets. The clutter is modeled as a spherically invariant random process (SIRP) and its texture component is range dependent (heterogeneous clutter). We suppose here that the speckle component covariance matrix is known or estimated thanks to a secondary data set. Thus, unknown parameters to be estimated are local texture values, the complex amplitudes and Doppler frequencies of all scattering centers. To do so, we use superresolution methods. The proposed detector assumes a priori knowledge on the spatial distribution of the target and has the precious property of having a constant false alarm rate (CFAR) with the assumption of a known speckle covariance matrix or by the use of frequency agility.     

Eigenstructure-based algorithms for direction finding withtime-varying arrays

This paper considers the problem of finding the directions of narrowband signals using a time-varying array whose elements move during the observation interval in an arbitrary but known way. We derive two eigenstructure-based algorithms for this problem, which are modifications of techniques developed originally for time-invariant arrays. The first uses array interpolation, and the second uses focusing matrices. Like other eigenstructure-based methods, these algorithms require a modest amount of computations in comparison with the maximum likelihood (ML) estimator. The performance of the algorithms is evaluated by Monte-Carlo simulations, and is compared with the Cramer Rao Bound (CRB). Although both techniques were successful for wideband array processing with time-invariant arrays, we found that only the interpolated array algorithm is useful for direction finding (DF) with time-varying arrays