A branch-and-bound algorithm applied to optimal radar search pattern

In the article, the radar acquisition problem, e.g. the determination of a directional energy allocation sequence, is studied. The radar search pattern goal is the detection of a moving target whose initial location is approximately known. We have turned towards the general search theory where the observer allocates indivisible search efforts while the target presence probability spreads due to its dynamics. A few years ago, a Branch and Bound algorithm was proposed to determine the optimal sequence for a conditionally deterministic target. This operational research algorithm supposes a negative exponential detection function and a one over N detection logic, meaning that the target is declared detected if it has been detected once over a horizon of N looks. We have applied it to a narrow-beam tracking radar attempting to acquire a ballistic target. Non-trivial search patterns, such as expanding-contracting spirals, are obtained.     

基于点集合并的修正Hough变换TBD算法

在低信噪比条件下,基于Hough变换的检测前跟踪算法是进行强杂波背景下目标航迹检测的一种手段。本文针对Hough变换后一个目标产生多条可能航迹以及航迹内可能存在杂波点的问题,提出了一种基于能量最大点和点集合并的修正Hough变换检测前跟踪算法。该算法利用量测点时序、能量信息及目标速度先验信息对Hough变换后点迹进行关联和剔除,能够有效的对目标原始航迹进行回溯。针对高斯噪声背景下的飞行目标,仿真结果表明该算法能够对微弱目标进行有效检测,在目标数目、杂波密度、信噪比发生变化的条件下仍能保持较高的检测概率。     

New assignment-based data association for tracking move-stop-move targets

We present a new assignment-based algorithm for data association in tracking ground targets employing evasive move-stop-move maneuvers using ground moving target indicator (GMTI) reports obtained from an airborne sensor. To avoid detection by the GMTI sensor, the targets deliberately stop for some time before moving again. The sensor does not detect a target when the latter's radial velocity (along the line-of-sight from the sensor) falls below a certain minimum detectable velocity (MDV). Even in the absence of move-stop-move maneuvers, the detection has a less-than-unity probability (P/sub D/<1) due to obscuration and thresholding. Then, it is of interest, when a target is not detected, to develop a systematic technique that can distinguish between lack of detection due to P/sub D/<1 and lack of detection due to a stop (or a near stop). Previously, this problem was solved using a variable structure interacting multiple model (VS-IMM) estimator with a stopped target model (VS-IMM-ST) without explicitly addressing data association. We develop a novel "two-dummy" assignment approach for move-stop-move targets that considers both the problem of data association as well as filtering. Typically, in assignment-based data association a "dummy" measurement is used to denote the nondetection event. The use of the standard single-dummy assignment, which does not handle move-stop-move motion explicitly, can result in broken tracks. The new algorithm proposed here handles the evasive move-stop-move motion by introducing a second dummy measurement to represent nondetection due to the MDV. We also present a likelihood-ratio-based track deletion scheme for move-stop-move targets. Using this two-dummy data association algorithm, the track corresponding to a move-stop-move target is kept "alive' during missed detections both due to MDV and due to P/sub D/<1. In addition, one can obtain reductions in both rms estimation errors as well as the total number of track breakages.     

The optimal distribution of search effort: existence, uniquenessand the minimax solution

The detection search problem, one of distributing limited resources so as to maximize the detection probability in the single-try search for a concealed target with known probability density, is analyzed. Under fairly general assumptions, the optimal search density uniquely exists when the detection index is governed by the law of diminishing returns and another simple regularity condition. Numerical procedure based on the bisection method, which is guaranteed to converge if the solution uniquely exists, may be used to solve for the optimal search density and the associated Lagrange multiplier. When it is not possible to confidently estimate the target a priori probability density, the minimax solution guarantees a positive detection probability at the expense of degradation in performance     

基于深度学习的突防控制博弈对象匹配方法CSCD

针对基于博弈理论设计应对多枚拦截弹的协同突防控制方案时需要确定博弈对象的问题,提出了一种基于长短时记忆(LSTM)网络的拦截弹攻击对象匹配方法。基于传统防空导弹飞行时序与流程构建拦截弹飞行轨迹库,以轨迹库为训练样本对LSTM网络进行训练,并以此为基础构建航迹预测模型与对象匹配模型,实现对拦截弹攻击对象的识别。仿真结果表明,该方法能够有效识别拦截弹拦截目标,为后续的巡航弹突防研究提供支撑。     

Uniform versus nonuniform sampling when tracking in clutter

Many target tracking subsystems have the ability to schedule their own data rates; essentially they can "order" new information whenever they need it, and the cost is in terms of the sensor resource. But among the unmanaged schemes, uniform sampling, in which a new measurement is requested periodically and regularly, is the most commonly-used sampling scheme; deliberately nonuniform schemes are seldom given serious consideration. In this paper, however, we show that such schemes may have been discarded prematurely: a nonuniform sampling can have its benefits. Specifically, the nonuniform and uniform sampling schemes are compared for two kind of trackers: the probabilistic data association filter (PDAF), which updates its track based on a single scan of information at a time; and N-D assignment (an optimization-based implementation of the multi-hypothesis tracker (MHT)), in which the sliding window involves many scans of observations. We find that given the ground rule of maintenance of the same overall scan rate (i.e., the same sensor effort) uniform sampling is always optimal for the single-scan tracker in the sense of track life. However, nonuniform sampling can outperform uniform sampling if a more sophisticated multi-scan tracker is used, particularly when 1) the target has a high process noise, and/or 2) the false alarm density is high, and/or 3) the probability of detection is high.     

Multiple target detection using modified high order correlations

This work is concerned with the problem of multiple target track detection in heavy clutter. Using the “modified high order correlation” (HOC) process and a track scoring mechanism a new method is developed to perform data association and track identification in the presence of heavy clutter. Using this new scheme any number of very close, crossing or splitting target tracks can be resolved without increasing the computational complexity of the algorithm. The applicability of the method for continuous detection of target tracks that can originate and terminate at any scan is also demonstrated, In addition, the operating characteristics as a function of the clutter density are also provided. Simulation results on all the cases are presented     

Radar Waveform Selection-A Simplified Approach

Radar measurement and resolution performance, as well as target detection in clutter, depend largely on the transmitted waveform. This explains the sizable effort that has gone into studies of radar waveforms, including attempts at the synthesis of optimum waveforms. This paper shows that, despite the unlimited variety of radar signals, waveform selection is a straightforward process. There are only four classes of waveforms, each with distinct resolution properties. When the target environment is analyzed for a particular application, it is rather evident which of these classes will fit the situation best. Choice of the specific waveform within the selected class then is merely a matter of practical implementation. Although the facts used in developing the unified theory of this paper are not new, it is demonstrated that these facts can be combined into an extremely simple theory of waveform design. Much of today's work is guided by past approaches to a particular problem, and when a design is completed there may be a question as to how close to the optimum it is. The theory presented here permits a systematic approach to waveform selection, with the important benefit that the designer knows exactly where and how much he may have deviated from the best design, and why this was done.     

Directed Subspace Search ML-PDA with Application to Active Sonar Tracking

The maximum likelihood probabilistic data association (ML-PDA) tracking algorithm is effective in tracking Very Low Observable targets (i.e., very low signal-to-noise ratio (SNR) targets in a high false alarm environment). However, the computational complexity associated with obtaining the track estimate in many cases has precluded its use in real-time scenarios. Previous ML-PDA implementations used a multi-pass grid (MPG) search to find the track estimate. Two alternate methods for finding the track estimate are presented-a genetic search and a newly developed directed subspace (DSS) search algorithm. Each algorithm is tested using active sonar scenarios in which an autonomous underwater vehicle searches for and tracks a target. Within each scenario, the problem parameters are varied to illustrate the relative performance of each search technique. Both the DSS search and the genetic algorithm are shown to be an order of magnitude more computationally efficient than the MPG search, making possible real-time implementation. In addition, the DSS search is shown to be the most effective technique at tracking a target at the lowest SNR levels-reliable tracking down to 5 dB (postprocessing SNR in a resolution cell) using a 5-frame sliding window is demonstrated, this being 6 dB better than the MPG search.     

Track labeling and PHD filter for multitarget tracking

Multiple target tracking requires data association that operates in conjunction with filtering. When multiple targets are closely spaced, the conventional approaches (as, e.g., MHT/assignment) may not give satisfactory results. This is mainly because of the difficulty in deciding what the number of targets is. Recently, the probability hypothesis density (PHD) filter has been proposed and particle filtering techniques have been developed to implement the PHD filter. In the particle PHD filter, the track labeling problem is not considered, i.e., the PHD is obtained only for a frame at a time, and it is very difficult to perform the multipeak extraction, particularly in high clutter environments. A track labeling method combined with the PHD approach, as well as considering the finite resolution, is proposed here for multitarget tracking, i.e., we keep a separate tracker for each target, use the PHD in the resolution cell to get the estimated number and locations of the targets at each time step, and then perform the track labeling ("peak-to-track" association), whose results can provide information for PHD peak extraction at the next time step. Besides, by keeping a separate tracker for each target, our approach provides more information than the standard particle PHD filter. For example, in group target tracking, if we are interested in the motion of a specific target, we can track this target, which is not possible for the standard particle PHD filter, since the standard particle PHD filter does not keep track labels. Using our approach, multitarget tracking can be performed with automatic track initiation, maintenance, spawning, merging, and termination     

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.     

航空发动机主供油计量活门故障主动容错控制器设计

针对航空发动机主供油计量活门执行机构发生故障时,系统的输出将会发生跳变,不能很好地跟踪系统期望输出的现象,采用模型参考自适应方法设计了主动容错控制器来解决这一问题.首先针对执行机构故障问题进行了数学描述.其次,选取系统的标称模型为参考模型,以输出误差最小化为优化目标,基于李雅普诺夫稳定性原理,寻找合适的自适应调节律,设计了自适应容错控制器.最后,针对发动机某一工况点进行了不同故障情况下的数值仿真.仿真结果表明:在主供油计量活门发生跳变故障和卡死故障时,自适应容错控制器可以通过参数自动调节,使得系统的输出能够很好地跟踪模型的输出,跟踪误差最终逼近于零.      

弹道并行计算的设计与实现

多条弹道并行计算是目前作战仿真，多目标探测等领域所急需解决的问题，利用面向对象的软件设计方法，将弹道计算过程抽象化为多个对象，分别对各种对象进行封装，有效地解决了并行弹道计算中内存混乱，可靠性差等问题，实现了多条弹道并行计算。     

Performance Analysis of a Target Detection System Using Infrared Imagery

The automatic detection of targets in cluttered infrared imagery is considered. The environment for the problem is that of a "fire-and-forget" weapon, and the mission philosophy for such a weapon dictates that the weapon has to find one and only one target in the automatic detection phase. A detection system that meets this requirement is presented. The system uses techniques of image processing and pattern recognition, with the extension that ranking methods are used instead of thresholds to accommodate the requirement of finding one and only one target. A probability model of the system is developed to determine the system performance as a function of throughput and expressions derived for the probability that the object chosen by the system as the target is actually a target. In order to validate the theoretical results, the actual performance of the detection system on a database of 68 infrared images is determined and compared with the predicted performance of the system. It is shown that there is good correspondence between the empirical results and the theoretical performance.     

基于伪彩色的感兴趣目标检测方法

若获取的灰度图像中含有较大噪声时,传统Itti算法经常会出现漏检以及错检的情况。为此,提出了基于伪彩色的感兴趣目标检测方法。首先对灰度图像添加相应的彩色信息,生成一幅目标细节较为清晰的伪彩图;其次根据Itti算法进行显著性计算;最后通过模板匹配检测出感兴趣目标。实验结果表明：算法能够达到补偿由于噪声问题引起的显著性目标无法检测的问题。     

多目标跟踪的概率假设密度粒子滤波

在多目标跟踪中,当目标数很大时,目标状态的联合分布的计算量会非常大。如果目标独立运动,可用各目标分别滤波来代替,但这要求考虑数据互联问题。文章介绍一种可以解决计算量问题的方法,只需计算联合分布的一阶矩——概率假设密度(PHD),PHD在任意区域S上的积分是S内目标数的期望值。因未记录目标身份,避免了数据互联问题。仿真中,传感器为被动雷达,目标观测值为距离、角度及速度时,对上述的PHD滤波进行了粒子实现,并对观测值是否相关的不同情况进行比较。PHD粒子滤波应用在非线性模型的多目标跟踪,实验结果表明,滤波可以稳健跟踪目标数为变数的情况,得到了接近真实情况的结果。     

Automatic spectral target recognition in hyperspectral imagery

Automatic target recognition (ATR) in hyperspectral imagery is a challenging problem due to recent advances of remote sensing instruments which have significantly improved sensor's spectral resolution. As a result, small and subtle targets can be uncovered and extracted from image scenes, which may not be identified by prior knowledge. In particular, when target size is smaller than pixel resolution, target recognition must be carried out at subpixel level. Under such circumstance, traditional spatial-based image processing techniques are generally not applicable and may not perform well if they are applied. The work presented here investigates this issue and develops spectral-based algorithms for automatic spectral target recognition (ASTR) in hyperspectral imagery with no required a priori knowledge, specifically, in reconnaissance and surveillance applications. The proposed ASTR consists of two stage processes, automatic target generation process (ATGP) followed by target classification process (TCP). The ATGP generates a set of targets from image data in an unsupervised manner which will subsequently be classified by the TCP. Depending upon how an initial target is selected in ATGP, two versions of the ASTR can be implemented, referred to as desired target detection and classification algorithm (DTDCA) and automatic target detection and classification algorithm (ATDCA). The former can be used to search for a specific target in unknown scenes while the latter can be used to detect anomalies in blind environments. In order to evaluate their performance, a comparative and quantitative study using real hyperspectral images is conducted for analysis.     

Search radar detection and track with the Hough transform. I.system concept

A method of viewing search radar signals and data is described and analyzed in which the image processing technique of the Hough transform is used to extract detections and simultaneous tracks from multi-dimensional data maps. System design concepts are considered and simulation examples are given that illustrate the concept. The technique offers many advantages when compared with more traditional techniques. These advantages include improved detection, a solution to the range walk problem, flexibility of implementation, elimination of slow scan-rate latency and automatic track acquisition without revisit. The concept is similar to track-before-detect algorithms that use preliminary information from previous scans to aid in target declarations     

Modeling and parameter optimization of agile beam radar tracking

In the work presented here, we address parameter optimization for agile beam radar tracking to minimize the radar resources that are required to maintain a target under track. The parameters to be optimized include the track-revisit interval as well as the sequence of pairs of target signal strengths and detection thresholds associated with successive illumination attempts in each track-revisit. The effects of false alarms and clutter interference are taken into account in the modeling of target detection and in the characterization of tracking performance. Based on the detection model and tracker characterization, the parameter optimization problem is formulated. Typical examples of the optimization problem are numerically solved. The optimal solution gives an off-line scheduling of the parameter set. It also provides insight into the selection of a near-optimal parameter set that is appropriate for real-time implementation.