Speed-up for N-FINDR algorithm
摘要
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 likelihood based on pixel purity index (PPI) concept. Then, initial EMs can be selected well-founded and a fast searching for EMs is achieved. Numerical experiments show that the two measures speed up the original algorithm hundreds of times as the number of EMs is more than ten.