扩展目标检测通常采用距离像能量积累检测的方法,由于距离像信息掌握不完备,陷落损失会降低检测性能。本文提出一种距离像先验引导的扩展目标检测方法,通过利用距离像包络模先验,对信号进行积累以提升检测性能。该方法考虑了复距离像与...扩展目标检测通常采用距离像能量积累检测的方法,由于距离像信息掌握不完备,陷落损失会降低检测性能。本文提出一种距离像先验引导的扩展目标检测方法,通过利用距离像包络模先验,对信号进行积累以提升检测性能。该方法考虑了复距离像与复高斯白噪声的相干叠加与相位预测不准的因素,采用将观测数据取模的检测模型,基于似然比检测(Likelihood Ratio Test,LRT)理论推导了低信噪比下的特征平方匹配检测器。该检测器将目标复距离像的包络模与观测数据的包络模进行平方匹配,并通过门限判决来判断目标是否存在。包络模先验的获取是通过从ISAR图像提取二维散射中心,向对应姿态角下的雷达视线方向进行投影,来获得目标近似的一维散射中心模型,再由该模型进一步生成目标距离像的包络模先验。同时,本文从理论与实验两方面分析了能量检测器和特征平方匹配检测器之间的关系,通过散射中心模型重构与暗室测量的方法获取数据进行了实验验证。实验结果表明:在低信噪比下,距离像先验引导的特征平方匹配检测器能有效提升目标的检测性能,并且对先验模型失配的情况具有良好的适应性。展开更多
文章研究了背景为子空间干扰加高斯杂波的距离扩展目标方向检测问题。杂波是均值为零协方差矩阵未知但具有斜对称特性的高斯杂波,目标与干扰分别通过具备斜对称特性的目标子空间和干扰子空间描述。针对方向检测问题,利用上述斜对称性,...文章研究了背景为子空间干扰加高斯杂波的距离扩展目标方向检测问题。杂波是均值为零协方差矩阵未知但具有斜对称特性的高斯杂波,目标与干扰分别通过具备斜对称特性的目标子空间和干扰子空间描述。针对方向检测问题,利用上述斜对称性,根据广义似然比检验(Generalized Likeli-hood Ratio Test,GLRT)准则的一步与两步设计方法,设计了基于GLRT的一步法与两步法的距离扩展目标方向检测器。通过理论推导证明了这2种检测器相对于未知杂波协方差矩阵都具有恒虚警率。对比相同背景下已有检测器,特别是在辅助数据有限的场景下,文章提出的2个检测器表现出了优越的检测性能。展开更多
Count data is almost always over-dispersed where the variance exceeds the mean. Several count data models have been proposed by researchers but the problem of over-dispersion still remains unresolved, more so in the c...Count data is almost always over-dispersed where the variance exceeds the mean. Several count data models have been proposed by researchers but the problem of over-dispersion still remains unresolved, more so in the context of change point analysis. This study develops a likelihood-based algorithm that detects and estimates multiple change points in a set of count data assumed to follow the Negative Binomial distribution. Discrete change point procedures discussed in literature work well for equi-dispersed data. The new algorithm produces reliable estimates of change points in cases of both equi-dispersed and over-dispersed count data;hence its advantage over other count data change point techniques. The Negative Binomial Multiple Change Point Algorithm was tested using simulated data for different sample sizes and varying positions of change. Changes in the distribution parameters were detected and estimated by conducting a likelihood ratio test on several partitions of data obtained through step-wise recursive binary segmentation. Critical values for the likelihood ratio test were developed and used to check for significance of the maximum likelihood estimates of the change points. The change point algorithm was found to work best for large datasets, though it also works well for small and medium-sized datasets with little to no error in the location of change points. The algorithm correctly detects changes when present and fails to detect changes when change is absent in actual sense. Power analysis of the likelihood ratio test for change was performed through Monte-Carlo simulation in the single change point setting. Sensitivity analysis of the test power showed that likelihood ratio test is the most powerful when the simulated change points are located mid-way through the sample data as opposed to when changes were located in the periphery. Further, the test is more powerful when the change was located three-quarter-way through the sample data compared to when the change point is closer (quarter-way) to the first observation.展开更多
文摘扩展目标检测通常采用距离像能量积累检测的方法,由于距离像信息掌握不完备,陷落损失会降低检测性能。本文提出一种距离像先验引导的扩展目标检测方法,通过利用距离像包络模先验,对信号进行积累以提升检测性能。该方法考虑了复距离像与复高斯白噪声的相干叠加与相位预测不准的因素,采用将观测数据取模的检测模型,基于似然比检测(Likelihood Ratio Test,LRT)理论推导了低信噪比下的特征平方匹配检测器。该检测器将目标复距离像的包络模与观测数据的包络模进行平方匹配,并通过门限判决来判断目标是否存在。包络模先验的获取是通过从ISAR图像提取二维散射中心,向对应姿态角下的雷达视线方向进行投影,来获得目标近似的一维散射中心模型,再由该模型进一步生成目标距离像的包络模先验。同时,本文从理论与实验两方面分析了能量检测器和特征平方匹配检测器之间的关系,通过散射中心模型重构与暗室测量的方法获取数据进行了实验验证。实验结果表明:在低信噪比下,距离像先验引导的特征平方匹配检测器能有效提升目标的检测性能,并且对先验模型失配的情况具有良好的适应性。
文摘文章研究了背景为子空间干扰加高斯杂波的距离扩展目标方向检测问题。杂波是均值为零协方差矩阵未知但具有斜对称特性的高斯杂波,目标与干扰分别通过具备斜对称特性的目标子空间和干扰子空间描述。针对方向检测问题,利用上述斜对称性,根据广义似然比检验(Generalized Likeli-hood Ratio Test,GLRT)准则的一步与两步设计方法,设计了基于GLRT的一步法与两步法的距离扩展目标方向检测器。通过理论推导证明了这2种检测器相对于未知杂波协方差矩阵都具有恒虚警率。对比相同背景下已有检测器,特别是在辅助数据有限的场景下,文章提出的2个检测器表现出了优越的检测性能。
基金supported by the National Natural Science Foundation of China(Grant No.72161009)the Natural Science Foundation of Hainan Province of China(Grant Nos.122MS057,124MS055).
文摘Count data is almost always over-dispersed where the variance exceeds the mean. Several count data models have been proposed by researchers but the problem of over-dispersion still remains unresolved, more so in the context of change point analysis. This study develops a likelihood-based algorithm that detects and estimates multiple change points in a set of count data assumed to follow the Negative Binomial distribution. Discrete change point procedures discussed in literature work well for equi-dispersed data. The new algorithm produces reliable estimates of change points in cases of both equi-dispersed and over-dispersed count data;hence its advantage over other count data change point techniques. The Negative Binomial Multiple Change Point Algorithm was tested using simulated data for different sample sizes and varying positions of change. Changes in the distribution parameters were detected and estimated by conducting a likelihood ratio test on several partitions of data obtained through step-wise recursive binary segmentation. Critical values for the likelihood ratio test were developed and used to check for significance of the maximum likelihood estimates of the change points. The change point algorithm was found to work best for large datasets, though it also works well for small and medium-sized datasets with little to no error in the location of change points. The algorithm correctly detects changes when present and fails to detect changes when change is absent in actual sense. Power analysis of the likelihood ratio test for change was performed through Monte-Carlo simulation in the single change point setting. Sensitivity analysis of the test power showed that likelihood ratio test is the most powerful when the simulated change points are located mid-way through the sample data as opposed to when changes were located in the periphery. Further, the test is more powerful when the change was located three-quarter-way through the sample data compared to when the change point is closer (quarter-way) to the first observation.
