Tracking considerations in selection of radar waveform for rangeand range-rate measurements

The conventional approach for tracking system design is to treat the detection and tracking subsystems as completely independent units. However, the two subsystems can be designed jointly to improve system (tracking) performance. It is known that different radar signal waveforms result in very different resolution cell shapes (for example, a rectangle versus an eccentric parallelogram) in the range/range-rate space, and that there are corresponding differences in overall tracking performance. We develop a framework for the analysis of this performance. An imperfect detection process, false alarms, target dynamics, and the matched filter sampling grid are all accounted for, using the Markov chain approach of Li and Bar-Shalom. The role of the grid is stressed, and it is seen that the measurement-extraction process from contiguous radar "hits" is very important. A number of conclusions are given, perhaps the most interesting of which is the corroboration in the new measurement space of Fitzgerald's result for delay-only (i.e., range) measurements, that a linear FM upsweep offers very good tracking performance     

Searching tracks

Search theory is the discipline that studies the problem of how best to search for an object when the amount of searching efforts is limited and only probabilities of the possible position of the object are given. Then, the problem is to find the optimal distribution of this total effort that maximizes the probability of detection. Although the general formalism of search theory will be used subsequently, we consider now a radically different problem. The problem is to detect target tracks. In the "classical" search theory, the target is said detected if a detection occurs during any time of the time frame. Here, on the contrary, the target track will be said to be detected if elementary detections occur at various times. That means that there is a test for acceptance (or detection) of a target track and that the problem is to optimize the allocation of the search effort for track detection. So, specific optimization problems are solved by means of the primal-dual formalism, in an original setup. Other aspects concern Markovian targets and two-sided search for which simple and efficient algorithms are derived.     

改进的 YOLOv4在飞机蒙皮损伤检测中的应用

针对飞机蒙皮检测中存在的小目标检测欠佳、漏检等问题,提出了 1种基于增强特征融合和 ATSS的 YO. LOv4飞机蒙皮图像目标检测算法。首先,增加用于目标预测的大尺度浅层特征层,以提高模型对小目标的检测效果;其次,增加特征融合网络层数,通过浅层与深层特征层的深度融合,丰富多尺度特征图中的特征信息;然后,通过 K-means++聚类算法对数据集的真实框聚类,获得更具代表性的先验框尺寸,以提高预测框对目标的定位准确度;最后,引入 ATSS对 YOLOv4的样本选择策略进行优化,通过自适应获取最优的 IoU阈值,实现正负样本自动划分,提升模型的检测性能。实验表明,在增加少量计算成本的情况下,算法的检测性能得到有效提升,mAP提升 7.7%,检 测的准确率达到 80%以上。     

基于改进多元优化算法的动态路径规划

为满足动态路径规划实时性强和动态跟踪精度高的需求,提出一种基于能够同时发现并追踪多条最优以及次优路径的改进多元优化算法(IMOA)的求解方法。首先,通过利用贝赛尔曲线描述路径的方法把动态路径规划问题转化为动态优化问题;然后,把相似性检测操作引入到多元优化算法(MOA)中,增加算法同时跟踪多个不同最优以及次优解的概率;最后,用IMOA对贝赛尔曲线的控制点进行寻优。实验结果表明:当最优路径由于环境变化而变为非优或者不可行时,利用IMOA对多个最优以及次优解动态跟踪的特点,能够快速调整寻优策略对其他次优路径进行寻优以期望再次找到最优路径;其综合离线性能较其他方法也有一定的提高。因此,IMOA满足动态路径规划的实际需求,适用于解决动态环境中的路径规划问题。     

Effectiveness of the Nash strategies in competitive multi-team target assignment problems

The Nash strategy in game theory has often been criticized as being ineffective in competitive multi-team target assignment problems, especially when compared with other simplistic strategies such as the random or greedy targeting strategies. This criticism arises from the fact that the Nash strategies may yield unpredictable results when paired with non-Nash strategies in non-zero sum games. In addition, the Nash equilibrium is generally more difficult to compute than strategies which do not attempt to anticipate the strategy of the other side. The authors seek to show that in multi-team target assignment problems the Nash strategy is superior to such simplistic strategies while also remaining computationally feasible. To demonstrate this point, an attrition model was considered, consisting of two teams of nonhomogeneous fighting units simultaneously targeting each other and compare the outcomes when various combinations of four targeting strategies are used on each side. The four strategies are: 1) the random strategy where each unit selects its target randomly, 2) the unit greedy strategy where each unit chooses the target that optimizes its own performance only, 3) the team optimal strategy where the units coordinate their choice of targets so as to optimize the overall team performance while ignoring the possible strategy choices by the other team, and 4) the team Nash strategy, calculated under the assumption that the other team is also using a Nash strategy. Because the computational requirements for calculating the team Nash strategies may become unfeasibly large, an efficient method was discussed for approximating the Nash strategies using a neighborhood search algorithm called unit level team resource allocation (ULTRA). The results were compared for all 16 possible combinations of these four targeting strategies and show that for each team the Nash strategy outperforms all other strategies irrespective of the strategy employed by the other team     

Waveform Design for Multistatic Radar Detection

We derive the optimal Neyman-Pearson (NP) detector and its performance, and then present a methodology for the design of the transmit signal for a multistatic radar receiver. The detector assumes a Swerling I extended target model as well as signal-dependent noise, i.e., clutter. It is shown that the NP detection performance does not immediately lead to an obvious signal design criterion so that as an alternative, a divergence criterion is proposed for signal design. A simple method for maximizing the divergence, termed the maximum marginal allocation algorithm, is presented and is guaranteed to find the global maximum. The overall approach is a generalization of previous work that determined the optimal detector and transmit signal for a monostatic radar.     

Moving target detection via airborne HRR phased array radar

We study moving target detection in the presence of temporally and spatially correlated ground clutter for airborne high range resolution (HRR) phased array radar. We divide the HRR range profiles into large range segments to avoid the range migration problems that occur in the HRR radar data. Since each range segment contains a sequence of HRR range bins, no information is lost due to the division and hence no loss of resolution occurs. We show how to use a vector autoregressive (VAR) filtering technique to suppress the ground clutter. Then a moving target detector based on a generalized likelihood ratio test (GLRT) detection strategy is derived. The detection threshold is determined according to the desired false alarm rate, which is made possible via an asymptotic statistical analysis. After the target Doppler frequency and spatial signature vectors are estimated from the VAR-filtered data as if a target were present, a simple detection variable is computed and compared with the detection threshold to render a decision on the presence of a target. Numerical results are provided to demonstrate the performance of the proposed moving target detection algorithm     

Studies of target detection algorithms that use polarimetric radardata

Algorithms are described which make use of polarimetric radar information in the detection and discrimination of targets in a ground clutter background. The optimal polarimetric detector (OPD) is derived. This algorithm processes the complete polarization scattering matrix (PSM) and provides the best possible detection performance from polarimetric radar data. Also derived is the best linear polarimetric detector, the polarimetric matched filter (PMF), and the structure of this detector is related to simple polarimetric target types. New polarimetric target and clutter models are described and used to predict the performance of the OPD and the PME. The performance of these algorithms is compared with that of simpler detectors that use only amplitude information to detect targets. The ability to discriminate between target types by exploring differences in polarimetric properties is discussed     

Difference beam aided target detection in monopulse radar

The classical detection step in a monopulse radar system is based on the sum beam only,the performance of which is not optimal when target is not at the beam center. Target detection aided by the difference beam can improve the performance at this case. However, the existing difference beam aided target detectors have the problem of performance deterioration at the beam center, which has limited their application in real systems. To solve this problem, two detectors are proposed in this paper. Assuming the monopulse ratio is known, a generalized likelihood ratio test(GLRT) detector is derived, which can be used when targeting information on target direction is available. A practical dual-stage detector is proposed for the case that the monopulse ratio is unknown. Simulation results show that performances of the proposed detectors are superior to that of the classical detector.     

Analysis of multiframe target detection using pixel statistics

Current track-before-detect (TBD) algorithms are developed and analyzed using a path statistic for each potential object trajectory. However this path statistic does not characterize overall performance gain. We propose a pixel-based statistic. This allows the TBD approach to be characterized as an image enhancement algorithm with detection gains compared with single frame detections. It is shown that for the TBD approach to have superior detection over single frame detection the target signal-to-noise ratio (SNR) must be greater than a threshold SNR in order to overcome the uncertainty in the target path. Tradeoffs are made for a class of velocity constrained target paths in terms of the detection gain with respect to the maximum target velocity and number of frames integrated     

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     

飞行力学在图像制导导弹设计中的应用

为满足作战需要 ,改善导弹的总体性能 ,又有利于降低研制成本 ,对图像制导导弹的导引头最大跟踪角速度、极限框架角、搜索方案以及导弹的速度方案 ,进行了分析设计。以此为例 ,对飞行力学在导弹总体与分系统设计中的应用进行了说明。研究结果表明 :飞行力学是协调导弹总体与各分系统之间关系的重要手段 ,在导弹总体和各分系统的设计过程中 ,积极主动地应用飞行力学进行综合设计 ,可获得最佳的总体性能。     

Multiple hypothesis track confirmation for infrared surveillancesystems

An overall methodology is described for the application of a multiple hypothesis tracking (MHT) algorithm to the infrared (IR) surveillance system problem of establishing tracks on dim targets in a heavy clutter or false alarm background. The authors discuss the manner in which the detection and tracking systems are jointly designed to optimize performance. They present approximate methods that can conveniently be used for preliminary system design and performance prediction. They discuss the use of a detailed Monte Carlo simulation for final system evaluation and present results illustrating the proposed methods and comparing predicted and simulation performance     

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.     

基于蒙特卡洛树搜索的机载雷达编队策略优化

多机雷达协同探测是飞机协同作战研究的重要内容,编队策略影响着多机雷达协同探测的探测效能针对机载雷达编队策略的优化,基于部分可观察马尔可夫决策过程(POMDP)模型描述了编队策略优化问题,提出了一种基于蒙特卡洛树搜索(MCTS)的最优策略求解方法。以对敌方目标的探测性能为指标,将该方法与多种其他编队方法的结果进行了比较。试验结果表明,该方法很好地平衡了 MCTS 中利用与探索的关系,可以在规模较大的搜索空间内有效完成编队策略优化,在编队探测能力提升方面展示出了比其它方法更加优越的性能。     

Design and application of quadratic correlation filters for target detection

We introduce a method for designing and implementing quadratic correlation filters (QCFs) for shift-invariant target detection in imagery. The QCFs are a quadratic classifier that operates directly on the image data without feature extraction or segmentation. In this sense, the QCFs retain the main advantages of conventional linear correlation filters while offering significant improvements in other respects. Not only is more processing required to detect peaks in the outputs of multiple linear filters, but choosing a winner among them is an error prone task. On the other hand, all channels in a QCF work together to optimize the same performance metric and produce a combined output that leads to considerable simplification of the postprocessing scheme. In addition, QCFs also yield better performance than their linear counterparts for comparable throughput requirements. Two different methods for designing basis functions that optimize the QCF performance criterion are presented. An efficient architecture for implementing QCFs is discussed along with a case study of the proposed approach for detecting targets in LADAR imagery.     

Discrete-time min-max tracking

The problem of optimal state estimation of linear discrete-time systems with measured outputs that are corrupted by additive white noise is addressed. Such estimation is often encountered in problems of target tracking where the target dynamics is driven by finite energy signals, whereas the measurement noise is approximated by white noise. The relevant cost function for such tracking problems is the expected value of the standard H/sub /spl infin// performance index, with respect to the measurement noise statistics. The estimator, serving as a tracking filter, tries to minimize the mean-square estimation error, and the exogenous disturbance, which may represent the target maneuvers, tries to maximize this error while being penalized for its energy. The solution, which is obtained by completing the cost function to squares, is shown to satisfy also the matrix version of the maximum principle. The solution is derived in terms of two coupled Riccati difference equations from which the filter gains are derived. In the case where an infinite penalty is imposed on the energy of the exogenous disturbance, the celebrated discrete-time Kalman filter is recovered. A local iterations scheme which is based on linear matrix inequalities is proposed to solve these equations. An illustrative example is given where the velocity of a maneuvering target has to be estimated utilizing noisy measurements of the target position.     

On the performance of polarimetric target detection algorithms

The performance of six polarimetric target detection algorithms is analyzed. The detection performance of the optimal polarimetric detector (OPD), the identity-likelihood-ratio-test (ILRT), the polarimetric whitening filter (PWF), the single-polarimetric channel detector, the span detector, and the power maximization synthesis (PMS) detector is compared. Results are presented for both probabilistic and deterministic targets in the presence of complex Gaussian clutter. The results indicate that the PWF and the ILRT typically achieve near optimal performance. The remaining detection algorithms typically yield performance that is degraded compared to the performance of the OPD, the PWF, and the ILRT     

Asynchronous distributed detection

Binary parallel distributed-detection architectures employ a bank of local detectors to observe a common volume of surveillance, and form binary local decisions about the existence or nonexistence of a target in that volume. The local decisions are transmitted to a central detector, the data fusion center (DEC), which integrates them to a global target or no target decision. Most studies of distributed-detection systems assume that the local detectors are synchronized. In practice local decisions are made asynchronously and the DFC has to update its global decision continually. In this study the number of local decisions observed by the central detector within any observation period is Poisson distributed. An optimal fusion rule is developed and the sufficient statistic is shown to be a weighted sum of the local decisions collected by the DFC within the observation interval. The weights are functions of the individual local detector performance probabilities (i.e., probabilities of false alarm and detection). In this respect the decision rule is similar to the one developed by Chair and Varshney for the synchronized system. Unlike the Chair-Varshney rule, however, the DFC's decision threshold in the asynchronous system is time varying. Exact expressions and asymptotic approximations are developed for the detection performance with the optimal rule. These expressions allow performance prediction and assessment of tradeoffs in realistic decision fusion architectures which operate over modern communication networks     

Optimal Detection and Performance of Distributed Sensor Systems

Global optimization of a distributed sensor detection system withfusion is considered, where the fusion rule and local detectors aresolved to obtain overall optimal performance. This yields coupledequations for the local detectors and the fusion center.The detection performance of the distributed system with fusionis developed. The globally optimal system performance is comparedwith two suboptimal systems. Receiver operating characteristics(ROCs) are computed numerically for the problem of detecting aknown signal embedded in non-Gaussian noise.