| 注册

Speed-up for N-FINDR algorithm

WANG Li-guo ZHANG Ye

哈尔滨工业大学学报(英文版)2008,Vol.15Issue(1):141-144,4.
哈尔滨工业大学学报(英文版)2008,Vol.15Issue(1):141-144,4.

Speed-up for N-FINDR algorithm

Speed-up for N-FINDR algorithm

WANG Li-guo 1ZHANG Ye2

作者信息

  • 1. Dept. of Information Engineering, Harbin Institute of Technology, Harbin 150001, China
  • 2. College of Information and Conmunications Engineering, Harbin Engineering University, Hanbin 150001, China
  • 折叠

摘要

Abstract

N-FINDR is a very popular algorithm of endmember (EM) extraction for its automated property and high efficiency. Unfortunately, innumerable volume calculation, initial random selection of EMs and blind searching for EMs lead to low speed of the algorithm and limit the applications of the algorithm. So in this paper two measures are proposed to speed up the algorithm. One of the measures is substituting distance calculation for volume calculation. Thus the avoidance of volume calculation greatly decreases the computational cost. The other measure is resorting dataset in terms of pixel purity hkelihood based on pixel purity index (PPI) concept. Then, initial EMs can be selected well-founded and a fast searching for EMs is achieved. Numerical experi-ments show that the two measures speed up the original algorithm hundreds of times as the number of EMs is more than ten.

关键词

endmember extraction/ N-FINDR algorithm/ PPI algorithm/ spectral unmixing

Key words

endmember extraction/ N-FINDR algorithm/ PPI algorithm/ spectral unmixing

分类

信息技术与安全科学

引用本文复制引用

WANG Li-guo,ZHANG Ye..Speed-up for N-FINDR algorithm[J].哈尔滨工业大学学报(英文版),2008,15(1):141-144,4.

基金项目

Sponsored by the National Natural Science Foundation of China (Grant No. 60402025 and 60302019). (Grant No. 60402025 and 60302019)

哈尔滨工业大学学报(英文版)

1005-9113

访问量0
|
下载量0
段落导航相关论文