基于聚类和最佳指数的快速高光谱波段选择方法  

Rapid hyperspectral band selection approach based on clustering and optimal index algorithm

作　　者：郭彤[1] 华文深[1] 刘恂[1] 刘晓光[1] GUO Tong HUA Wenshen LIU Xun LIU Xiaoguang(Department of electronic and Optical Engineering, Mechanical Engineering College, Shijiazhuang 050003, Hebei, Chin)

机构地区：[1]军械工程学院电子与光学工程系,河北石家庄050003

出　　处：《光学技术》2016年第6期496-500,共5页Optical Technique

摘　　要：最佳指数法是常用的高光谱图像数据波段选择方法,但存在运算时间过长的问题。运用K-means聚类算法,对最佳指数方法进行了改进,提出了聚类最佳指数法,并进行了一系列伪装目标识别的对比实验。实验结果表明,与最佳指数法相比,改进后的方法在保证目标分类精度的前提下,运算速度提高了数十倍;与单纯使用K-means聚类运算相比,不仅运算时间缩短,而且分类精度有所提高。利用改进算法能够在伪装环境下更加快速有效地识别目标。Optimal index algorithm is a frequently-used hyperspectral band selection approach, but it takes too much computation time. Using the concept of K-means clustering algorithm, the clustering optimal index algorithm is presented to improve the optimal index algorithm and a series of contrast experiments for camouflage target recognition are conducted. The results indicate that, compared with optimal index method, in guarantee the premise of target classification accuracy, computational speed of the improved method increases dozens of times. Meanwhile, compared with K-means clustering algorithm, the operation time is shortened, the classification accuracy is improved. In camouflage environment, the target can be identified more quickly and effectively by the modified algorithm.

关 键 词：高光谱 波段选择 图像分类 最佳指数法 K-MEANS聚类 

分 类 号：TP751[自动化与计算机技术—检测技术与自动化装置]