基于相位相关的部分可辨编队精细起始算法

针对部分可辨条件下编队目标的精细起始难题,提出了一种基于相位相关的部分可辨编队精细起始算法。首先,采用基于坐标映射距离差分的快速群分割与基于编队中心点的预互联对雷达量测进行预处理;然后,利用图像匹配中相位相关特性,将相邻时刻编队结构进行补偿对准,解决了低目标发现概率情况下的编队结构对准问题;最后,采用增加虚拟量测并后验判决的方式,结合最近邻法做编队航迹精细互联,在填补航迹缺失、增加正确航迹的同时抑制虚假航迹的产生。经仿真验证,与修正的逻辑法、基于相对位置矢量的灰色编队精细起始算法相比,本文所提算法在提高航迹正确起始率、抑制虚假航迹方面性能优势显著,且对环境杂波与雷达精度具有较好的鲁棒性,对目标发现概率具有较好的适应性。     

基于相对位置矢量的群目标灰色精细航迹起始算法

为解决群内目标精细航迹起始的难题,基于对传统航迹起始算法及现有群目标航迹起始算法优缺点的分析,给出了完整的群目标航迹起始框架,并提出了一种基于相对位置矢量的群目标灰色精细航迹起始算法。首先基于循环阈值模型、群中心点进行群的预分割、预关联,然后对预关联成功的群搜索对应坐标系,建立群中各量测的相对位置矢量,基于灰色精细互联模型完成群内量测的互联,最后基于航迹确认规则得到群目标状态矩阵。经仿真数据验证,与修正的逻辑法、基于聚类和Hough变换的多编队航迹起始算法相比,该算法在起始真实航迹、抑制虚假航迹及杂波鲁棒性等方面综合性能更优。     

基于小波变换与粗糙集的雷达目标识别方法

雷达目标识别是防空武器系统雷达信息处理的一个关键环节.在小波变换与粗糙集基础上提出一种雷达目标识别方法.小波变换能够提高了时--频分频率;粗糙集理论是一种新型的处理不确定性知识的数学工具.利用小波变换对目标原始信息进行分解,得到目标的能量特征向量;通过粗糙集简化关系表,删去冗余信息,用逻辑推理算法表示判别规则.应用小波变换与粗糙集能够满足利用不精确信息进行目标识别的需要.     

一种基于新三维随机Hough变换的航迹起始算法

针对雷达跟踪多目标时,目标点迹受杂波、噪声等因素影响,航迹起始难度大的问题,利用三维空间直线表示方法提出了一种4参数三维Hough变换算法.该算法是对传统二维Hough变换的拓展,它结合了传统的二维随机Hough变换理论,是一种新的三维随机Hough变换算法.通过该算法对理论数据和实测数据进行验证,结果表明,对于航迹区别较大的目标,该算法的航迹起始成功概率为98.5％;对于空间航迹相近的目标,该算法可成功将目标航迹从杂波中提取出来,虽然可能会出现航迹混淆,但利用目标先验信息可解决该问题,实现航迹起始.     

纯方位二维目标跟踪的航迹起始算法

 针对传统航迹起始算法在纯方位目标定位和跟踪系统应用中存在的弊端,提出了一种完全基于角度量测的快速航迹起始算法。该方法通过深入分析目标在角度坐标下的运动特性,给出了全新的关联门构造方法。该波门技术有效提高了纯方位二维目标真实量测的确认效率,极大限制了虚假航迹随密集杂波的扩张。利用此波门,通过基于逻辑的方法对仅有角度量测的目标航迹进行扩展。该方法有效地解决了角度坐标系下机动目标的航迹起始分辨率下降的问题,为基于单个被动传感器纯方位跟踪系统进行快速、准确的航迹起始提供了新的思路。仿真结果及实际应用表明了此算法的有效性和实用性。     

基于数据库的收缩型航迹聚类模型仿真研究

针对传统聚类算法只能选取少量数据源进行仿真分析,得到的聚类效果不能真实体现数据流的宏观特征的问题,考虑了海量航迹数据中的离群点检测以及离群点剔除,提出一种新的基于数据库的收缩型航迹聚类仿真模型,将三维空间网格化,建立K-means聚类和层次聚类双重交互算法,对网格中的离群点进行识别并剔除.解决了航迹聚类中的关键技术问题.通过对西北地区3 G海量二次雷达数据的聚类仿真分析,使航迹聚类仿真的耗时从h级降低至s级,并且得到的航迹分布特征清晰,验证了新模型对于海量数据宏观特征提取具有可行性和优越性,模型和算法对全国二次雷达航迹数据仿真具有借鉴意义.     

基于视频识别数据融合的场面监视增强方法

针对场面监视雷达、多点等传统机场场面监视传感器探测机场场面航空器、车辆等目标,出现目标虚假、分裂等现象,造成空管系统目标航迹不可靠影响机场管制运行安全问题。提出了一种基于视频识别数据融合的机场场面目标监视增强方法,方法采用YOLO v5网络模型的深度学习智能视频识别技术识别场面航空器、车辆、行人目标,并对存疑目标再利用云台相机捕捉特写,对初次比对分析的结果进行二次对比分析确认,然后与A-SMGCS系统中传统监视数据融合对比处理,自动对场面目标做真伪、增减处理,剔除虚假目标、弥补丢失目标,增加场面目标监视的可信度、可靠性。为塔台管制员提供真实、可靠、全面的场面航空器、车辆、人员运行态势“一幅图”,提高航班管制运行安全。     

基于自适应遗传BP算法神经网络数据融合的空中目标识别

空中目标识别是现代防空作战的重要研究内容。本文利用不同类型目标产生的多类型传感器的数据信息对目标进行识别。为了训练神经网络目标识别分类器，将遗传算法和BP算法相结合，提出了一种新的自适应遗传BP算法，利用这种神经网络来确定指标的权值。仿真试验结果表明，基于自适应遗传BP算法神经网络的识别是一种简单、可靠的目标识别方法，具有很好的目标识别效果。     

基于状态方程的雷达目标航迹模拟方法

雷达目标模拟航迹产生的数据是进行各种雷达数据处理研究的前提。文章提出了一种基于状态方程的航迹模拟方法,该方法是利用目标运动的状态方程及最优控制理论来进行航迹模拟,最大的优点在于产生的数据符合目标运动的特性,更真实地接近空中目标实际运动的轨迹。仿真实验结果表明了该算法的有效性。     

一种基于 KFCM的 SVM遥感图像机场目标分类算法

在遥感图像机场目标分类方面,支持向量机(SVM)有着广泛的应用,但由于样本不平衡问题以及不确定性数据的存在,传统SVM算法的分类精度与效果还无法令人满意。为提高传统SVM分类器的性能,文章将建立在模糊理论基础上的模糊核C-均值聚类算法(KFCM)用于处理遥感数据的不确定性问题,并通过聚类分析后的目标子图,剔除非目标样本的同时保留了目标样本,较好地解决了样本不平衡问题。将基于KFCM的SVM分类算法用于遥感图像机场目标的分类,实验结果和性能分析表明该算法分类性能优于传统SVM算法。     

Passive ranging of a low observable ballistic missile in agravitational field

In this paper we present an estimation algorithm for tracking the motion of a low-observable target in a gravitational field, for example, an incoming ballistic missile (BM), using angle-only measurements. The measurements, which are obtained from a single stationary sensor, are available only for a short time. Also, the low target detection probability and high false alarm density present a difficult low-observable environment. The algorithm uses the probabilistic data association (PDA) algorithm in conjunction with maximum likelihood (ML) estimation to handle the false alarms and the less-than-unity target detection probability. The Cramer-Rao lower bound (CRLB) in clutter, which quantifies the best achievable estimator accuracy for this problem in the presence of false alarms and nonunity detection probability, is also presented. The proposed estimator is shown to be efficient, that is, it meets the CRLB, even for low-observable fluctuating targets with 6 dB average signal-to-noise ratio (SNR). For a BM in free flight with 0.6 single-scan detection probability, one can achieve a track detection probability of 0.99 with a negligible probability of false track acceptance     

Bayesian and Dempster-Shafer target identification for radarsurveillance

This paper considers the problem of target track identification in a radar surveillance system. To build a target identifier alongside a tracker, four features which are available for real-time processing in an air surveillance system are used here: target identity (TID) from a friend-and-foe identification (IFF) system, elevation measurement from the radar, target speed, and acceleration estimated by a tracker. These four features are combined to classify air targets into five different air target categories: friendly commercial, friendly military, hostile commercial (or unknown airline), hostile military, and false targets (clutter). Two popular statistic-based techniques, namely, the Bayesian and Dempster-Shafer methods, are applied to develop radar target identification algorithms for our application. Real-life as well as simulated air surveillance radar data are used to evaluate the practicality and effectiveness of this track identification approach in a radar surveillance system     

Interacting multiple model tracking with target amplitude feature

A recursive tracking algorithm is presented which uses the strength of target returns to improve track formation performance and track maintenance through target maneuvers in a cluttered environment. This technique combines the interacting multiple model (IMM) approach with a generalized probabilistic data association (PDA), which uses the measured return amplitude in conjunction with probabilistic models for the target and clutter returns. Key tracking decisions can be made automatically by assessing the probabilities of target models to provide rapid and accurate decisions for both true track acceptance and false track dismissal in track formation. It also provides the ability to accurately continue tracking through coordinated turn target maneuvers     

Tracking in Clutter using IMM-IPDA?Based Algorithms

We describe three single-scan probabilistic data association (PDA) based algorithms for tracking manoeuvering targets in clutter. These algorithms are derived by integrating the interacting multiple model (IMM) estimation algorithm with the PDA approximation. Each IMM model a posteriori state estimate probability density function (pdf) is approximated by a single Gaussian pdf. Each algorithm recursively updates the probability of target existence, in the manner of integrated PDA (IPDA). The probability of target existence is a track quality measure, which can be used for false track discrimination. The first algorithm presented, IMM-IPDA, is a single target tracking algorithm. Two multitarget tracking algorithms are also presented. The IMM-JIPDA algorithm calculates a posteriori probabilities of all measurement to track allocations, in the manner of the joint IPDA (JIPDA). The number of measurement to track allocations grows exponentially with the number of shared measurements and the number of tracks which share the measurements. Therefore, IMM-JIPDA can only be used in situations with a small number of crossing targets and low clutter measurement density. The linear multitarget IMM-IPDA (IMM-LMIPDA) is also a multitarget tracking algorithm, which achieves the multitarget capabilities by integrating linear multitarget (LM) method with IMM-IPDA. When updating one track using the LM method, the other tracks modulate the clutter measurement density and are subsequently ignored. In this fashion, LM achieves multitarget capabilities using the number of operations which are linear in the: number of measurements and the number of tracks, and can be used in complex scenarios, with dense clutter and a large number of targets.     

Multiple scan joint probabilistic data association

This paper presents a multiple scan or n-scan-back joint probabilistic data association (JPDA) algorithm which addresses the problem of measurement-to-track data association in a multiple target and clutter environment. The standard single scan JPDA algorithm updates a track with weighted sum of the measurements which could have reasonably originated from the target in track. The only information the standard JPDA algorithm uses is the measurements on the present scan and the state vectors and covariance matrices of the present targets. The n-scan-back algorithm presented here uses multiple scans of measurements along with the present target information to produce better weights for data association. The standard JPDA algorithm can utilize a formidable amount of processing power and the n-scan-back version only worsens the problem. Therefore, along with the algorithm presentation, implementations which make this algorithm practical are discussed and referenced. An example is also shown for a few n-scan-back window lengths     

EM-ML algorithm for track initialization using possibly noninformative data

Initializing and maintaining a track for a low observable (LO) (low SNR, low target detection probability and high false alarm rate) target can be very challenging because of the low information content of measurements. In addition, in some scenarios, target-originated measurements might not be present in many consecutive scans because of mispointing, target maneuvers, or erroneous preprocessing. That is, one might have a set of noninformative scans that could result in poor track initialization and maintenance. In this paper an algorithm based on the expectation-maximization (EM) algorithm combined with maximum likelihood (ML) estimation is presented for tracking slowly maneuvering targets in heavy clutter and possibly noninformative scans. The adaptive sliding-window EM-ML approach, which operates in batch mode, tries to reject or weight down noninformative scans using the Q-function in the M-step of the EM algorithm. It is shown that target features in the form of, for example, amplitude information (AI), can also be used to improve the estimates. In addition, performance bounds based on the supplemented EM (SEM) technique are also presented. The effectiveness of new algorithm is first demonstrated on a 78-frame long wave infrared (LWIR) data sequence consisting of an Fl Mirage fighter jet in heavy clutter. Previously, this scenario has been used as a benchmark for evaluating the performance of other track initialization algorithms. The new EM-ML estimator confirms the track by frame 20 while the ML-PDA (maximum likelihood estimator combined with probabilistic data association) algorithm, the IMM-MHT (interacting multiple model estimator combined with multiple hypothesis tracking) and the EVIM-PDA estimator previously required 28, 38, and 39 frames, respectively. The benefits of the new algorithm in terms of accuracy, early detection, and computational load are illustrated using simulated scenarios as well.     

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.     

Optimization of waveform and detection threshold for range and range-rate tracking in clutter

We address an optimization problem to obtain the combined sequence of waveform parameters (pulse amplitudes and lengths, and FM sweep rates) and detection thresholds for optimal range and range-rate tracking in clutter. The optimal combined sequence minimizes a tracking performance index under a set of parameter constraints. The performance index includes the probability of track loss and a function of estimation error covariances. The track loss probability and the error covariances are predicted using a hybrid conditional average algorithm. The effect of the false alarms and clutter interference is taken into account in the prediction. A measurement model in explicit form is also presented which is developed based on the resolution cell in the delay-Doppler plane for a single Gaussian pulse. Numerical experiments were performed to solve the optimization problem for several examples.     

一种基于多支持向量机的增量式并行训练算法

为了改进传统算法,利用支持向量的特性,提出了一种基于多支持向量机的增量式并行训练算法(PMSVM)。选择对分类超平面有影响的样本点作为支持向量,以增加单个分类器的训练时间为代价换取整体训练和分类的精度。考虑到训练样本的分布对最终结果的影响,加入反馈向量进行适当的重复训练,以调整各分类器的学习性能。通过在测试数据集上进行的实验表明,该算法与批学习增量BSVM算法相比,在提高训练效率和分类精度的前提下,大大降低了训练时间。