模拟退火机制下优化离散粒子群的端元提取算法  

Endmember Extraction Algorithm on Hyperspectral Imagery by Simulated Annealing Discrete Particle Swarm Optimization

作　　者：刘飞[1] 杨可明[1] 魏华锋 孙阳阳[1] 史钢强 

机构地区：[1]中国矿业大学(北京)地球科学与测绘工程学院,北京100083

出　　处：《测绘与空间地理信息》2015年第7期37-40,共4页Geomatics & Spatial Information Technology

基　　金：国家自然科学基金项目(41271436)资助

摘　　要：针对离散粒子群优化(Discrete Particle Swarm Optimization,DPSO)端元提取算法初始种群质量差、收敛性能低且易于陷入局部最优,本文将模拟退火算法引入到DPSO的不同阶段,模拟退火算法能以一定的概率接受和舍弃新状态,使种群内粒子渐趋有序、达到平衡,收敛到全局最优,有效避免了搜索陷入局部最优。因此,该算法不仅保持了DPSO的全局组合优化特点,克服了初始种群质量差、易陷入局部最优等缺点,而且还提高了收敛速度和端元提取精度。In view of the existing endmember extraction research defects that the Discrete Particle Swarm Optimization （DPSO） algo- rithm has poor quality of initial particle swarm, low convergence performance and easily falls into the local optimum. So simulated an- nealing algorithm is introduced into the different stages of DPSO. Using the Simulated Annealing algorithm can accept and give up a new state at a certain probability so that the particles can be gradually ordered to achieve balance and ultimately converged to global optimum, thus it can avoid search falling into the local optimum. Therefore, the new algorithm can keep the DPSO characteristics of global combinatorial optimization, also overcomes the disadvantages of poor quality of initial particle swarm and easily failing into the local optimum, as well as improves the convergence speed and the precision of endmember extraction.

关 键 词：高光谱遥感 粒子群优化 端元提取 模拟退火 

分 类 号：P208[天文地球—地图制图学与地理信息工程]