A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood d...A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.展开更多
In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used t...In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.展开更多
复杂电磁环境下卫星信号往往淹没在背景和噪声中,传统的信号检测算法在没有准确先验知识的情况下性能急剧降低,目前基于深度学习的信号检测算法往往需要依赖专家经验的数据后处理步骤,无法对信号进行端到端检测.针对上述缺陷,提出一种基...复杂电磁环境下卫星信号往往淹没在背景和噪声中,传统的信号检测算法在没有准确先验知识的情况下性能急剧降低,目前基于深度学习的信号检测算法往往需要依赖专家经验的数据后处理步骤,无法对信号进行端到端检测.针对上述缺陷,提出一种基于DETR_S(DEtection with TRansformer on Signal)的卫星信号智能检测方法.DETR_S以编码器-解码器架构为基础,利用Transformer网络全局建模能力捕获频谱信息,采用多头自注意力机制有效改善频谱信息长距离依赖的问题.基于匈牙利算法的预测框匹配模块摒弃了非极大值抑制的数据后处理步骤,将信号检测问题转变为集合预测问题,使模型并行输出检测结果.引入信号重构模块,将频谱重构损失函数加入损失函数中,辅助模型挖掘频谱深层表征,提升信号检测性能.实验结果表明,在仅使用信号频谱幅度信息条件下,DETR_S能够在信噪比等于0dB及以上对卫星信号进行精确检测(>95%),优于典型的目标检测方法.展开更多
基金This project was supported by the National Natural Science Foundation of China (60272024).
文摘A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.
文摘In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.
文摘复杂电磁环境下卫星信号往往淹没在背景和噪声中,传统的信号检测算法在没有准确先验知识的情况下性能急剧降低,目前基于深度学习的信号检测算法往往需要依赖专家经验的数据后处理步骤,无法对信号进行端到端检测.针对上述缺陷,提出一种基于DETR_S(DEtection with TRansformer on Signal)的卫星信号智能检测方法.DETR_S以编码器-解码器架构为基础,利用Transformer网络全局建模能力捕获频谱信息,采用多头自注意力机制有效改善频谱信息长距离依赖的问题.基于匈牙利算法的预测框匹配模块摒弃了非极大值抑制的数据后处理步骤,将信号检测问题转变为集合预测问题,使模型并行输出检测结果.引入信号重构模块,将频谱重构损失函数加入损失函数中,辅助模型挖掘频谱深层表征,提升信号检测性能.实验结果表明,在仅使用信号频谱幅度信息条件下,DETR_S能够在信噪比等于0dB及以上对卫星信号进行精确检测(>95%),优于典型的目标检测方法.
