Efficient robust AMF using the FRACTA algorithm

The FRACTA algorithm has been shown to be an effective space-time adaptive processing (STAP) methodology for the airborne radar configuration in which there exists nonhomogeneous clutter, jamming, and dense target clusters. Further developments of the FRACTA algorithm are presented here in which the focus is on the robust, efficient implementation of the FRACTA algorithm. Enhancements to the FRACTA algorithm include a censoring stopping mechanism, an alternative data blocking approach for adaptive power residue (APR) censoring, and a fast reiterative censoring (RC) procedure. Furthermore, a coherent processing interval (CPI) segmentation scheme for computing the adaptive weights is presented as an alternative approach to computing the adaptive matched filter (AMF) weight vector that allows for lower sample support and reduced computational complexity. The enhanced FRACTA algorithm, denoted as FRACTA.E, is applied to the KASSPER I challenge datacube which possesses dense ground target clusters that are known to have a significant deleterious effect on standard adaptive matched filtering (AMF) processors. It is shown that the FRACTA.E algorithm outperforms and is considerably more computationally efficient than both the original FRACTA algorithm and the standard sliding window processing (SWP) approach. Furthermore, using the KASSPER I datacube, the FRACTA.E algorithm is shown to have the same detection performance as the clairvoyant algorithm where the exact range-dependent clutter covariance matrices are known.     

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).     

基于先验知识及其定量评估的自适应杂波抑制研究

 为了改善训练样本数受限的非均匀杂波环境中的系统检测性能,研究了基于先验知识及其定量评估的自适应杂波抑制算法。提出了使用经真实杂波信息白化后的先验杂波协方差矩阵与单位矩阵之差的谱范数,来定量评估杂波先验知识的准确程度,并给出了真实杂波协方差矩阵未知时的矩阵谱范数估计方法。结合先验知识定量评估结果,获得了具有先验知识约束时的杂波协方差矩阵最大似然估计方法。分别基于多脉冲相参雷达以及空时自适应雷达进行了杂波建模,在此基础之上分析了算法性能。仿真结果证实了该算法优于使用样本协方差矩阵及先验杂波信息形成杂波抑制权值的性能。     

An effect of range-heterogeneous clutter on adaptive Dopplerfilters

The practical implementation of adaptive Doppler filters requires estimates of clutter parameters to determine the adaptive weights. A method of deriving the estimate via the sample matrix inversion (SMI) algorithm using multiple data snapshots from adjacent range cells is presented. For homogeneous clutter environments, the results of this technique asymptotically approach the optimum (a priori known covariance matrix) as the number of snapshots approaches infinity; this asymptotic behavior does not occur for heterogeneous clutter environments. An equation for the decrease in improvement factor is derived. To promote understanding, the simplified special case of narrowband clutter is considered in detail. In almost all cases, the loss is small     

Airborne/spacebased radar STAP using a structured covariance matrix

It is shown that partial information about the airborne/spacebased (A/S) clutter covariance matrix (CCM) can be used effectively to significantly enhance the convergence performance of a block-processed space/time adaptive processor (STAP) in a clutter and jamming environment. The partial knowledge of the CCM is based upon the simplified general clutter model (GCM) which has been developed by the airborne radar community. A priori knowledge of parameters which should be readily measurable (but not necessarily accurate) by the radar platform associated with this model is assumed. The GCM generates an assumed CCM. The assumed CCM along with exact knowledge of the thermal noise covariance matrix is used to form a maximum likelihood estimate (MLE) of the unknown interference covariance matrix which is used by the STAP. The new algorithm that employs the a priori clutter and thermal noise covariance information is evaluated using two clutter models: 1) a mismatched GCM, and 2) the high-fidelity Research Laboratory STAP clutter model. For both clutter models, the new algorithm performed significantly better (i.e., converged faster) than the sample matrix inversion (SMI) and fast maximum likelihood (FML) STAP algorithms, the latter of which uses only information about the thermal noise covariance matrix.     

An approach to knowledge-aided covariance estimation

This paper introduces a parametric covariance estimation scheme for use with space-time adaptive processing (STAP) methods operating in heterogeneous clutter environments. The approach blends both a priori knowledge and data observations within a parameterized model to capture instantaneous characteristics of the cell under test (CUT) and reduce covariance errors leading to detection performance loss. We justify this method using both measured and synthetic data. Performance potential for the specific operating conditions examined herein include: 1) averaged behavior within roughly 2 dB of the optimal filter, 2) 1 dB improvement in exceedance characteristic relative to the optimal filter, highlighting improved instantaneous capability, and 3) impervious ness to corruptive target-like signals in the secondary data (no additional signal-to-interference-plus-noise ratio (SINK) loss, compared with 10 dB or greater loss for the standard STAP implementation), with corresponding detections comparable to the optimal filter case     

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.     

Adaptive Radar Detection in Doubly Nonstationary Autoregressive Doppler Spread Clutter

The problem of adaptive radar detection in clutter which is nonstationary both in slow and fast time is addressed. Nonstationarity within a coherent processing interval (CPI) often precludes target detection because of the masking induced by Doppler spreading of the clutter. Across range bins (i.e., fast time), nonstationarity severely limits the amount of training data available to estimate the noise covariance matrix required for adaptive detection. Such difficult clutter conditions are not uncommon in complex multipath propagation conditions where path lengths can change abruptly in dynamic scenarios. To mitigate nonstationary Doppler spread clutter, an approximation to the generalized likelihood ratio test (GLRT) detector is presented wherein the CPI from the hypothesized target range is used for both clutter estimation and target detection. To overcome the lack of training data, a modified time-varying autoregressive (TVAR) model is assumed for the clutter return. In particular, maximum likelihood (ML) estimates of the TVAR parameters, computed from a single snapshot of data, are used in a GLRT for detecting stationary targets in possibly abruptly nonstationary clutter. The GLRT is compared with three alternative methods including a conceptually simpler ad hoc approach based on extrapolation of quasi-stationary data segments. Detection performance is assessed using simulated targets in both synthetically-generated and real radar clutter. Results suggest the proposed GLRT with TVAR clutter modeling can provide between 5–8 dB improvement in signal-to-clutter plus noise ratio (SCNR) when compared with the conventional methods.     

Adaptive detection schemes in compound-Gaussian clutter

Radar detection of coherent pulse trains embedded in compound-Gaussian disturbance with partially known statistics is discussed. We first give a thorough derivation of two recently proposed adaptive detection structures. Next, we derive a different detection scheme exploiting the assumption that the clutter is wide-sense stationary. Resorting to the theory of circulant matrices, in fact, we demonstrate that the estimation of the structure of the clutter covariance matrix can be reduced to the estimation of its eigenvalues, which in turn can be (efficiently) done via fast Fourier transform codes. After a thorough performance assessment, mostly carried on via computer simulations, the results show that the newly proposed detector achieves better performance than the two previously introduced adaptive detectors. Moreover, a sensitivity analysis shows that, even though this detector does not strictly guarantee the constant false alarm rate property with respect to the clutter covariance matrix, it is robust, in the sense that its performance is only slightly affected by variations in the clutter temporal correlation     

Space-time autoregressive filtering for matched subspace STAP

Practical space-time adaptive processing (STAP) implementations rely on reduced-dimension processing, using techniques such as principle components or partially adaptive filters. The dimension reduction not only decreases the computational load, it also reduces the sample support required for estimating the interference statistics. This results because the clutter covariance is implicitly assumed to possess a certain (nonparametric) structure. We demonstrate how imposing a parametric structure on the clutter and jamming can lead to a further reduction in both computation and secondary sample support. Our approach, referred to as space-time autoregressive (STAR) filtering, is applied in two steps: first, a structured subspace orthogonal to that in which the clutter and interference reside is found, and second, a detector matched to this subspace is used to determine whether or not a target is present. Using a realistic simulated data set for circular array STAP, we demonstrate that this approach achieves significantly lower signal-to-interference plus noise ratio (SINR) loss with a computational load that is less than that required by other popular approaches. The STAR algorithm also yields excellent performance with very small secondary sample support, a feature that is particularly attractive for applications involving nonstationary clutter.     

Space-time adaptive radar performance in heterogeneous clutter

Traditional analysis of space-time adaptive radar generally assumes the ideal condition of statistically independent and identically distributed (IID) secondary data. To the contrary, measured data suggests realistic clutter environments appear heterogeneous and so the secondary data is no longer IID. Heterogeneity leads to mismatch between actual and estimated covariance matrices, thereby magnifying the loss between the adaptive implementation and optimum condition. Concerns regarding the impact of clutter heterogeneity on space-time adaptive processing (STAP) warrant further study. To this end, we propose space-time models of amplitude and spectral clutter heterogeneity, with operational airborne radar in mind, and then characterize expected STAP performance loss under such heterogeneous scenarios. Simulation results reveal loss in signal-to-interference plus noise ratio (SINR) ranging between a few tenths of a decibel to greater than 16 dB for specific cases     

无需辅助数据的分布式目标自适应检测器

在非高斯背景和没有辅助数据的条件下,研究了高分辨率雷达分布式目标的自适应检测问题.首先采用有序检测理论和协方差矩阵的迭代估计方法粗略估计散射点集合,进一步利用迭代估计方法获得协方差矩阵的近似最大似然估计,提出了无需辅助数据的自适应检测器(ADWSD).ADWSD在非高斯背景下具有近似恒虚警率特性,且检测性能远好于修正的...     

基于先验门限优化准则的探测阈值自适应选择

针对 2维测量和 4 -sigma确认门 ,把先验检测门限优化准则和修正 Riccati方程的解析近似表示相结合 ,得到了在瑞利起伏环境下使跟踪性能优化的信号探测阈值解析表示式 ,从而使在线求解自适应信号探测阈值能比较容易地实现。通过研究和仿真发现 :在滤波稳定阶段 ,本文给出的自适应信号检测门限方法的跟踪性能优于固定虚警率方法的跟踪性能 ;基于先验检测门限优化准则实现检测 -跟踪的联合优化要求信噪比要大于一定的门限 ,在瑞利起伏环境下 ,对 2维测量和 4 -sigma确认门 ,该门限为 1 .57     

Reduced-rank STAP for high PRF radar

Due to the range ambiguity of high pulse-repetition frequency (HPRF) radars, echoes from far-range fold over near-range returns. This effect may cause low Doppler targets to compete with near-range strong clutter. Another consequence of the range ambiguity is that the sample support for estimating the array covariance matrix is reduced, leading to degraded performance. It is shown that space-time adaptive processing (STAP) techniques are required to reject the clutter in HPRF radar. Four STAP methods are studied in the context of the HPRF radar problem: low rank approximation sample matrix inversion (SMI), diagonally loaded SMI, eigencanceler, and element-space post-Doppler. These three methods are evaluated in typical HPRF radar scenarios and for various training conditions, including when the target is present in the training data     

基于稀疏贝叶斯学习的字典失配杂波空时谱估计方法

杂波谱稀疏恢复空时自适应处理（STAP）是一种有效减少杂波样本数需求的机载雷达杂波抑制方法。然而,空时平面被离散地划分为若干个网格点来构建空时导向矢量字典,当字典在失配时,杂波脊不能准确落在预先离散化的网格点上,稀疏恢复STAP性能严重下降。提出了一种基于稀疏贝叶斯学习的字典失配杂波空时谱估计方法,首先利用二维泰勒级数建立空时动态字典模型,然后将字典失配误差作为待估超参数构建贝叶斯稀疏恢复模型,并利用失配误差估计值对空时导向矢量字典进行修正,最后利用修正后的空时导向矢量字典重构杂波协方差矩阵,进而计算杂波空时谱。实验证明,该方法能够有效提高字典失配情况下的杂波谱稀疏恢复精度,杂波抑制性能优于已有字典预先离散化的稀疏贝叶斯学习STAP方法。     

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     

Stochastic-constraints method in nonstationary hot-cluttercancellation. II. Unsupervised training applications

For pt. I see ibid., vol. 34, pp. 1271-1292 (1998). This paper considers the use of “stochastically constrained” spatial and spatio-temporal adaptive processing in multimode nonstationary interference (“hot clutter”) mitigation for scenarios that do not allow access to a group of range cells that are free from the backscattered sea/terrain signal (“cold clutter”). Since supervised training methods for interference covariance matrix estimation using the cold-clutter-free ranges are inappropriate in this case, we introduce and analyze adaptive routines which can operate on range cells containing a mixture of hot and cold clutter and possible targets (unsupervised training samples). Theoretical and simulation results are complemented by surface-wave over-the-horizon data processing, recently collected during experimental trials in northern Australia     

Adaptive detection threshold optimization for tracking in clutter

The adaptive optimization of detection thresholds for tracking in clutter is investigated for the probabilistic data association (PDA) filter. Earlier work on this problem by T.E. Fortmann et al. (1985) involved an approximate steady-state analysis of the state error covariance and is only suitable for time-invariant systems. Furthermore, the method requires numerous assumptions and approximations about the error covariance update equation, and uses a cumbersome graphical optimization algorithm. In this work we propose two adaptive schemes for threshold optimization, namely prior and posterior optimization algorithms which minimize the mean-square state estimation error over detection thresholds which depend on data up to the previous and current time-step, respectively. These algorithm are suitable for real-time implementation in time-varying systems. Some simulation results are presented     

Fast converging adaptive processor or a structured covariance matrix

The use of adaptive linear techniques to solve signal processing problems is needed particularly when the interference environment external to the signal processor (such as for a radar or communication system) is not known a priori. Due to this lack of knowledge of an external environment, adaptive techniques require a certain amount of data to cancel the external interference. The number of statistically independent samples per input sensor required so that the performance of the adaptive processor is close (nominally within 3 dB) to the optimum is called the convergence measure of effectiveness (MOE) of the processor. The minimization of the convergence MOE is important since in many environments the external interference changes rapidly with time. Although there are heuristic techniques in the literature that provide fast convergence for particular problems, there is currently not a general solution for arbitrary interference that is derived via classical theory. A maximum likelihood (ML) solution (under the assumption that the input interference is Gaussian) is derived here for a structured covariance matrix that has the form of the identity matrix plus an unknown positive semi-definite Hermitian (PSDH) matrix. This covariance matrix form is often valid in realistic interference scenarios for radar and communication systems. Using this ML estimate, simulation results are given that show that the convergence is much faster than the often-used sample matrix inversion method. In addition, the ML solution for a structured covariance matrix that has the aforementioned form where the scale factor on the identity matrix is arbitrarily lower-bounded, is derived. Finally, an efficient implementation is presented.     

Performance bounds for hot and cold clutter mitigation

A new method is presented for describing the theoretical interference space-time covariance matrix that will be observed in an adaptive airborne radar system under specific topographical conditions. Both hot clutter that is induced by interfering sources and cold clutter that results from the radar transmitter are considered. This method incorporates phenomenology observed under site specific conditions as well as system effects such as array geometry, receiver filtering, and system bandwidth. Use of this formulation rather than sample data analyses that are generally employed enables one to infer performance bounds for site-specific, and thus generally, heterogeneous terrain that are tighter and therefore more meaningful than the thermal noise floor limit