基于改进动态规划的高速机动弱目标检测算法

    A Detection Algorithm for High-speed Maneuvering Weak Target Based on Improved Dynamic Programming

    • 摘要: 为获取高速、高机动微小目标的稳健检测能力,文中提出了一种基于动态规划(DP)的快速混合积累检测算法,采用马尔可夫运动模型,允许目标在给定加速度范围内做任意形式的机动,并通过Keystone算法实现了段内相参积累,通过DP实现了段间非相参积累,而且在DP的实现过程中,对原有算法进行了改进,将运算量控制在了合理范围内。通过雷达回波仿真数据对所提算法和其他典型算法进行了对比分析,对于高速、高机动目标,在检测性能方面所提算法较常用的相参、非相参和混合积累检测算法具有明显的优势,仅稍弱于基于严格DP求解的Radon傅里叶变换-DP-二值积累算法;在运算量方面,所提算法具有显著的优势,且在积累时间较长时,优于常用的相参积累及混合积累算法。测试结果表明,该方法实现了检测性能和运算量的有效平衡,能够较好地适用于高速高机动微弱目标检测。

       

      Abstract: In order to obtain the robust detection capabilities of high-speed and high maneuvering weak targets, in this paper a fast hybrid integration detection algorithm is proposed based on dynamic programming(DP). The algorithm adopts Markov motion model, allowing targets to maneuver in any form within a given acceleration range. The coherent integration within the segment is realized through Keystone algorithm, then the non-coherent integration between segments is realized through DP. In the implementation process of DP, the original algorithm is improved, and the amount of computation is kept within a reasonable range. Comparing the proposed algorithm with other typical algorithms through radar echo simulation data, in terms of detection performances the proposed algorithm has obvious advantages over other commonly used coherent, non-coherent and hybrid integration detection algorithms for high-speed and high maneuvering targets, and is only slightly weaker than the Radon-Fourier transform-DP-binary integration algorithm based on strict DP solution. In terms of computational complexities, the proposed algorithm has obvious advantages, and it outperforms coherent integration and hybrid integration algorithms when the integration time is long. The test results show that the proposed method achieves an effective balance between detection performance and computational complexity, and can be well applied to high-speed and high maneuvering weak target detection.

       

    /

    返回文章
    返回