基于小波区域扩张聚类算法的炮阵地选取  

A Wavelet Region Growing Clustering Algorithm for Siting Artillery Position

作　　者：刘旭红[1] 张国英[1] 刘玉树[1] 陈云飞[1] 

机构地区：[1]北京理工大学计算机科学与工程系,北京100081

出　　处：《复旦学报（自然科学版）》2004年第5期827-829,共3页Journal of Fudan University：Natural Science

摘　　要：小波变换的特性之一是变换后的数据边界更加清晰,使数据的聚类变得相对容易.将这种思想引入野战辅助决策的炮阵地选取中,提出小波区域扩张聚类算法.相比于传统算法,该算法有效地提高了炮阵地选取的效率.One of the properties of the wavelet is that the boundaries of the transformed data become more distinct, so it is easier to cluster the data. According to this property. It is introduced WaveCluster idea to siting artillery position and produces a new algorithm——wavelet region growing. As compared with traditional algorithm for siting artillery position, this algorithm has higher efficiency.

关 键 词：阵地 选取 区域 清晰 思想 数据 传统 域扩张 小波 聚类算法 

分 类 号：N02[自然科学总论—科学技术哲学] O152[理学—数学]