检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学电子科学与工程学院,湖南长沙410073
出 处:《现代电子技术》2007年第7期4-6,共3页Modern Electronics Technique
基 金:国防预研项目(No.4130304-01)
摘 要:为解决异地配置的雷达和红外传感器数据关联问题,建立了数学模型将数据关联问题转化成运筹学中的分配问题。分析了经典的匈牙利算法存在的缺点,结合代价矩阵的特点,提出了求解分配问题的一种新的算法——差额法。该算法在代价矩阵差额最大的行或列中优先寻找最小元素,符合全局优化思想。算法简单易懂,克服了经典的匈牙利解法实现难、处理速度慢等缺点。实际应用表明,本文数据关联模型以及差额法适合于处理背景杂波不太强和目标不太密集情况下的异地多传感器数据关联问题。To solve the data association problem of radar and infrared sensor when two sensors are located at different sites, the mathematical model is established and then the data association problem is converted into assignment problem in operations research. After analyzing disadvantage of the classic Hungary method, a new method, maximum difference method,is presented to solve the assignment problem considering the characteristics of cost matrix. According to the idea of global optimization,this method precedently locates the least element that is in the row or the column of maximum difference in the cost matrix. This is easy to understand. It avoids tbe hardly achieving and slowly processing disadvantage existing in the classic Hungary method. The practical results show that the method in this paper is suitable to deal with data association of week clutters and sparse targets environment.
分 类 号:TP212[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.60.117