期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Novel method for ambiguity elimination in the LFMCW radar
1
作者 Du Yuming Yang Jianyu Xiong Jintao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第1期91-95,共5页
Aimed at solving the distance and vetocity decoupling problems of a moving target in LFMCW radar signal processing, a multiple repetition frequency waveform is adopted and a Doppler frequency duster algorithm is propo... Aimed at solving the distance and vetocity decoupling problems of a moving target in LFMCW radar signal processing, a multiple repetition frequency waveform is adopted and a Doppler frequency duster algorithm is proposed, which is capable of recovering true velocity form the coupled velocity estimation directly. For the resolution of multiple targets, a match algorithm based on mean square error is also proposed. The combination of the above two methods realizes distance and velocity decoupling of multiple moving targets. The result of simulation verifies the effectiveness of the methods, the velocity estimation performance of DFS algorithm is improved by 2.5 dB compared with Chinese remiander theorem. 展开更多
关键词 LFMCW radar Doppler frequency cluster resolution of multiple targets
下载PDF
A Necessary Condition about the Optimum Partition on a Finite Set of Samples and Its Application to Clustering Analysis
2
作者 叶世伟 史忠植 《Journal of Computer Science & Technology》 SCIE EI CSCD 1995年第6期545-556,共12页
This paper presents another necessary condition about the optimum parti-tion on a finite set of samples. From this condition, a corresponding generalized sequential hao f k-means (GSHKM) clustering algorithm is built ... This paper presents another necessary condition about the optimum parti-tion on a finite set of samples. From this condition, a corresponding generalized sequential hao f k-means (GSHKM) clustering algorithm is built and many well-known clustering algorithms are found to be included in it. Under some assumptions the well-known MacQueen's SHKM (Sequential Hard K-Means)algorithm, FSCL (Frequency Sensitive Competitive Learning) algorithm and RPCL (Rival Penalized Competitive Learning) algorithm are derived. It is shown that FSCL in fact still belongs to the kind of GSHKM clustering algth rithm and is more suitable for producing means of K-partition of sample data,which is illustrated by numerical experiment. Meanwhile, some improvements on these algorithms are also given. 展开更多
关键词 cluster analysis MacQueen's sequential hard K-means clustering algorithm frequency sensitive competitive learning adaptive frequency K-means clustering
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部