检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]江苏科技大学电子信息学院,江苏镇江212003
出 处:《计算机应用与软件》2016年第1期278-281,306,共5页Computer Applications and Software
基 金:船舶行业预研基金项目(11J2.5.1)
摘 要:模糊函数可以对信号结构信息进行较为完整的描述,找出不同信号之间的差异,但搜索信号主脊切面的计算量较大。提出一种混沌优化与差分进化算法相结合的搜索模糊函数主脊AFMR(Ambiguity Function Main Ridge)切面,先差分进化全局搜索,再混沌局部搜索,有效避免了算法陷入局部最优。将提取的信号主脊切面对比穷举法提取的主脊切面,保证正确性的同时显著提高搜索速度。将提取的主脊切面特征进行近邻传播聚类分析,针对聚类算法中偏向参数的不确定,提出动态调整偏向参数的构建式,提高算法性能。实验结果表明,该算法改进的近邻传播聚类准确率在低信噪比的情况下能达到90%以上,明显高于传统近邻传播算法。Ambiguity function can describe the information of signal structure completely and identify" differences between the signals. But it requires huge computational complexity in searching the main ridge slice of signal. In this paper we propose an algorithm combining the differential evolutionary with chaos optimisation for searching the slice of ambiguity function main ridge ( AFMR), first the global search with differential evolution algorithm, then the local search using chaos, thus effectively avoids falling into local optimum. We contrast signal' s main ridge slice extracted by the proposed algorithm with the main ridge slice extracted by exhaustive algorithm, this one ensures the correctness while significantly improves search speed. Affinity propagation clustering analysing is made on the feature of the extracted main ridge slice, we propose the constructive means of dynamic bias parameter adjustment to improve algorithm performance. Experimental results show that the accuracy of the improved affinity propagation clustering can reach 90% and above at low SNR, it is clearly higher than the traditional affinity propagation algorithm.
关 键 词:混沌 差分进化算法 主脊切面 近邻传播聚类 信号分选
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222