A Nonadaptive Processing of Radar Pulse Trains for Clutter Rejection

The problem of detecting coherent pulse trains with uniform amplitude in a clutter-plus-noise environment is considered. A radar processor for detecting targets moving radially with respect to the clutter is proposed. The minimum interpulse spacing of the transmitted signal is assumed long enough that returns are not received simultaneously from different ranges within a region of extended clutter, and the central frequency of the clutter power spectrum is postulated to be known. The processor is singled out as the linear filter, orthogonal to the clutter central frequency component, which yields the maximum ratio of peak signal power to average noise power. The filter can be implemented by slightly modifying the structure of the conventional matched filter. The performance of such a filter is compared with that achievable if full a priori knowledge of the input interference were available and with that of the conventional matched filter. This comparison is made on a signal-to-interference power ratio basis after assuming a transmitted signal consisting of equally spaced pulses and an interference characterized by an exponential covariance matrix.     

A class of near optimal JPDA algorithms

The crucial problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information If an incorrect hit is associated with a track, that track could diverge and prematurely terminate or cause other tracks to also diverge. Most methods for hit-to-track data association fall into two categories: multiple hypothesis tracking (MHT) and joint probabilistic data association (JPDA). Versions of MHT use all or some reasonable hits to update a track and delay the decision on which hit was correct. JPDA uses a weighted sum of the reasonable hits to update a track. These weights are the probability that the hit originated from the target in track. The computational load for the joint probabilities increases exponentially as the number of targets increases and therefore, is not an attractive algorithm when expecting to track many targets. Reviewed here is the JPDA filter and two simple approximations of the joint probabilities which increase linearly in computational load as the number of targets increase. Then a new class of near optimal JPDA algorithms is introduced which run in polynomial time. The power of the polynomial is an input to the algorithm. This algorithm bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms     

一种机动多目标雷达视频信号模拟器的设计

给出了一种机动多目标雷达视频信号模拟器的软硬件设计方案,它可实时输出所需的多个动目标雷达视频信号,雷达信号的类型、目标的数量、目标的回波特性、目标的运动特性、杂波的类型及参数等均可方便地进行设置。该模拟器可满足各种雷达信号处理算法(如杂波抑制、恒虚警检测、动目标跟踪、多基地数据融合等)的测试与效果分析,以及对雷达信号处理机等进行性能调试与测试的需要。     

Vector subspace detection in compound-Gaussian clutter. Part I: survey and new results

Deals with the problem of detecting subspace random signals against correlated non-Gaussian clutter exploiting different degrees of knowledge on target and clutter statistical characteristics. The clutter process is modeled by the compound-Gaussian distribution. In the first part of the paper, the optimum Neyman-Pearson (NP) detector, the generalized likelihood ratio test (GLRT), and a constant false-alarm rate (CFAR) detector are sequentially derived both for the Gaussian and the compound-Gaussian scenarios. Different interpretations of the various detectors are provided to highlight the relationships and the differences among them. In particular, we show how the GLRT detector may be recast into an estimator-correlator form and into another form, namely a generalized whitening-matched filter (GWMF), which is the GLRT detector against Gaussian disturbance, compared with a data-dependent threshold. In the second part of this paper, the proposed detectors are tested against both simulated data and measured high resolution sea clutter data to investigate the dependence of their performance on the various clutter and signal parameters.     

A Multistage Processing Algorithm for Disturbance Removal and Target Detection in Passive Bistatic Radar

The paper examines the problem of cancellation of direct signal, multipath and clutter echoes in passive bistatic radar (PBR). This problem is exacerbated as the transmitted waveform is not under control of the radar designer and the sidelobes of the ambiguity function can mask targets including those displaced in either (or both) range and Doppler from the disturbance. A novel multistage approach is developed for disturbance cancellation and target detection based on projections of the received signal in a subspace orthogonal to both the disturbance and previously detected targets. The resulting algorithm is shown to be effective against typical simulated scenarios with a limited number of stages, and a version with computational savings is also introduced. Finally its effectiveness is demonstrated with the application to real data acquired with an experimental VHF PBR system.     

基于约束序贯M估计的时空域融合红外杂波抑制

针对红外弱小目标检测中的强背景杂波干扰抑制问题进行研究,提出了一种基于参数约束序贯M估计的时空域融合自适应杂波抑制算法.该算法首先在分析序列图像帧间失配的基础上建立了一种改进的时空域融合背景预测模型,结合二维离散傅里叶快速变换图像配准和双线性插值方法进行灰度值估计;然后,基于约束序贯M估计方法进行模型参数的自适应估计,...     

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.     

Multiframe detector/tracker: optimal performance

We develop the optimal Bayes multiframe detector/tracker for rigid extended targets that move randomly in clutter. The performance of this optimal algorithm provides a bound on the performance of any other suboptimal detector/tracker. We determine by Monte Carlo simulations the optimal performance under a variety of scenarios including spatially correlated Gaussian clutter and non-Gaussian (K and Weibull) clutter. We show that, for similar tracking performance, the optimal Bayes tracker can achieve peak signal-to-noise ratio gains possibly larger than 10 dB over the commonly used combination of a spatial matched filter (spatial correlator) and a linearized Kalman-Bucy tracker. Simulations using real clutter data with a simulated target suggest similar performance gains when the clutter model parameters are unknown and estimated from the measurements     

PDAF with multiple clutter regions and target models

This paper presents the theory of a new multiple model probabilistic data association filter (PDAF). The analysis is generalized for the case of multiple nonuniform clutter regions within the measurement data that updates each model of the filter. To reduce the possibility of clutter measurements forming established tracks, the solution includes a model for a visible target. That is, a target that gives sensor measurements that satisfy one of the target models. Other features included in the algorithm are the selection of a fixed number of nearest measurements and the addition of signal amplitude to the target state vector. The nonuniform clutter model developed here is applicable to tracking signal amplitude. Performance of this algorithm is illustrated using experimentally recorded over-the-horizon radar (OTHR) data.     

Radar maneuvering target tracking algorithm based on human cognition mechanism

Radar Maneuvering Targets Tracking(RMTT) in clutter is a quite challenging issue due to the errors in the models and the varying dynamics of the processes. Modern radar tracking system calls for the adaptive signal and data processing algorithm urgently to adapt the uncertainty of the environment. The mechanism of human cognition can help persons cope with the similar diffi-culties in visual tracking. Inspired by human cognition mechanism, a comprehensive method for RMTT is proposed. In the method, the model transition probability in Interacting Multiple Model(IMM) and the validation gate can be adjusted dynamically with target maneuver; the waveform in radar transmitter can vary with the perception of the environment. Experimental results in cluttered scenes show that the proposed algorithm is more accurate for perceiving the environment and targets, and the waveform selection algorithm is better than that with fixed waveform.     

密集杂波环境下的数据关联快速算法

基于联合概率数据互联（JPDA）的思想,提出了一种新的数据关联快速算法（Fast Al-gorithm for Data Association,简称FAFDA算法）.该方法不需象在最优JPDA算法中那样生成所有可能的联合互联假设,因而具有计算量小,易于工程实现的特点。仿真结果表明,与最优JPDA算法相比,FAFDA算法的跟踪性能令人满意,并且在密集杂波环境下可实时、有效地跟踪100批次以上的目标。     

An improved multiple model GM-PHD filter for maneuvering target tracking

In this paper, an improved implementation of multiple model Gaussian mixture probability hypothesis density (MM-GM-PHD) filter is proposed. For maneuvering target tracking, based on joint distribution, the existing MM-GM-PHD filter is relatively complex. To simplify the filter, model conditioned distribution and model probability are used in the improved MM-GM-PHD filter. In the algorithm, every Gaussian components describing existing, birth and spawned targets are estimated by multiple model method. The final results of the Gaussian components are the fusion of multiple model estimations. The algorithm does not need to compute the joint PHD distribution and has a simpler computation procedure. Compared with single model GM-PHD, the algorithm gives more accurate estimation on the number and state of the targets. Compared with the existing MM-GM-PHD algorithm, it saves computation time by more than 30%. Moreover, it also outperforms the interacting multiple model joint probabilistic data association (IMMJPDA) filter in a relatively dense clutter environment.     

Automatic target recognition of time critical moving targets using1D high range resolution (HRR) radar

Synthetic Aperture Radar (SAR) imaging and Automatic Target Recognition (ATR) of moving targets pose a significant challenge due to the inherent difficulty of focusing moving targets. As a result, ATR of moving targets has recently received increased interest. High Range Resolution (HRR) radar mode offers an approach for recognizing moving targets by forming focused HRR profiles with significantly enhanced target-to-(clutter+noise) (T/(C+N)) via Doppler filtering and/or clutter cancellation. A goal of HRR ATR transition is the implementation and evaluation of algorithms exhibiting robustness under extended operating conditions (EOC). The public domain Moving and Stationary Target Acquisition and Recognition (MSTAR) data set was used to study 1D template-based ATR development and performance. Due to the unavailability of a statistically significant moving ground target data set, this approach was taken as an interim step in assessing the separability of ground targets when using range only discriminants. This report summarizes the data and algorithm methodology, simulated performance results, and recommendations     

圆台阵列杂波模型及空时二维自适应处理

针对圆台共形阵列,建立了空时二维自适应处理(STAP)的杂波模型,给出了圆台阵列杂波抑制最优权值的计算方法。在此基础之上,为了实现可应用到实际环境中的自适应处理方法,进一步讨论了将局部联合域(JDL)降维算法推广至圆台阵列中的问题。得出了圆台阵列JDL算法降维变换矩阵的表达形式,研究了参考波束的数目选取、波束指向等因素对降维损失的影响。理论分析以及仿真结果表明,通过合理选择通道数、波束方位向指向间隔等参数,该算法能够减少自适应波束形成的计算量,而且可以用较少的训练样本获得较好的处理性能。     

Clutter Suppression by Complex Weighting of Coherent Pulse Trains

Uniform coherent pulse trains offer a practical solution to the problem of designing a radar signal possessing both high range and range-rate resolution. The Doppler sensitivity provides some rejection of off-Doppler (clutter) returns in the matched filter receiver. This paper considers the use of a processor in which members of the received pulse train are selectively weighted in amplitude and phase to improve clutter suppression. The techniques described are particularly suitable for rejecting interference entering the processor through ambiguous responses (range sidelobes) of the signal. The complex weights which are derived are optimum in the sense that they produce the maximum clutter suppression for a given detection efficiency. In determining these weights, it is assumed that the distribution of clutter in range and range rate relative to targets of interest is known. Thus, clutter suppression is achieved by reducing the sidelobe levels in specified regions of the receiver response. These techniques are directly applicable to array antennas; the analogous antenna problem would be to reduce sidelobe levels in a particular sector while preserving gain. Complex weighting is most successful when the clutter is limited in both range and velocity.     

A novel target detection approach based on adaptive radar waveform design

To resolve problems of complicated clutter, fast-varying scenes, and low signal-clutterratio (SCR) in application of target detection on sea for space-based radar (SBR), a target detection approach based on adaptive waveform design is proposed in this paper. Firstly, complicated sea clutter is modeled as compound Gaussian process, and a target is modeled as some scatterers with Gaussian reflectivity. Secondly, every dwell duration of radar is divided into several sub-dwells. Regular linear frequency modulated pulses are transmitted at Sub-dwell 1, and the received signal at this sub-dwell is used to estimate clutter covariance matrices and pre-detection. Estimated matrices are updated at every following sub-dwell by multiple particle filtering to cope with fast-varying clutter scenes of SBR. Furthermore, waveform of every following sub-dwell is designed adaptively according to mean square optimization technique. Finally, principal component analysis and generalized likelihood ratio test is used for mitigation of colored interference and property of constant false alarm rate, respectively. Simulation results show that, considering configuration of SBR and condition of complicated clutter, 9 dB is reduced for SCR which reliable detection requires by this target detection approach. Therefore, the work in this paper can markedly improve radar detection performance for weak targets.     

Neural solution to the multitarget tracking data associationproblem

The problem of tracking multiple targets in the presence of clutter is addressed. The joint probabilistic data association (JPDA) algorithm has been previously reported to be suitable for this problem in that it makes few assumptions and can handle many targets as long as the clutter density is not very high. However, the complexity of this algorithm increases rapidly with the number of targets and returns. An approximation of the JPDA that uses an analog computational network to solve the data association problem is suggested. The problem is viewed as that of optimizing a suitably chosen energy function. Simple neural-network structures for the approximate minimization of such functions have been proposed by other researchers. The analog network used offers a significant degree of parallelism and thus can compute the association probabilities more rapidly. Computer simulations indicate the ability of the algorithm to track many targets simultaneously in the presence of moderately dense clutter     

基于高斯混合概率假设密度滤波的扫描型光学传感器像平面多目标跟踪算法

高斯混合概率假设密度(GM-PHD)滤波是一种基于随机有限集理论的次优贝叶斯多目标跟踪方法,本文研究了该算法在扫描型光学传感器像平面的多目标跟踪问题.针对典型的锥扫模式和推扫模式,根据其扫描特性建立目标的运动模型和测量模型.介绍高斯混合概率假设密度滤波的基本原理.针对原算法在强杂波环境中的低效率问题,借鉴传统多目标跟踪...     

基于标签多伯努利滤波的衍生目标跟踪算法

针对现有随机有限集(RFS)滤波器在低信噪比环境下对衍生目标跟踪性能严重下降的问题,提出了一种基于Delta扩展标签多伯努利(δ-GLMB)滤波器的改进算法。基于随机集理论和伯努利衍生模型,推导了新的预测方程,并采用了假设裁剪及分组手段和多伯努利近似技术以降低算法的计算量。针对假设增多引起的虚警问题,将多帧平滑思想和算法相结合,利用标签信息对新目标进行回溯处理。仿真结果表明,所提算法能对目标数目进行无偏估计,在低探测概率和强杂波环境下性能明显优于概率假设密度(PHD)算法,计算开销在衍生初始阶段增长快于PHD,目标较分散时低于PHD。     

Sequential track extraction

Sensors like radar or sonar usually produce data on the basis of a single frame of observation: target detections. The detection performance is described by quantities like detection probability Pd and false alarm density f. A different task of detection is formation of tracks of targets unknown in number from data of multiple consecutive frames of observation. This leads to quantities which are of a higher level of abstraction: extracted tracks. This again is a detection process. Under benign conditions (high Pd, low f and well separated targets) conventional methods of track initiation are recommended to solve a simple task. However, under hard conditions the process of track extraction is known to be difficult. We here concentrate on the case of well separated targets and derive an optimal combinatorial method which can be used under hard operating conditions. The method relates to MHT (multiple hypothesis tracking), uses a sequential likelihood ratio test and derives benefit from processing signal strength information. The performance of the track extraction method is described by parameters such as detection probability and false detection rate on track level, while Pd and f are input parameters which relate to the signal-to-noise interference ratio (SNIR), the clutter density, and the threshold set for target detection. In particular the average test lengths are analyzed parametrically as they are relevant for a user to estimate the time delay for track formation under hard conditions