Skip to Main Content
N-FINDR is a widely used endmember extraction algorithm in hyperspectral imagery. Nevertheless, its computational complexity is high. Plaza's parallel implementation of N FINDR, namely, P-FINDR, demonstrates an excellent way to improve the computing performance of N-FINDR by incorporating with parallel computing technique. In this paper, three parallel implementation patterns, i.e., synchronous, asynchronous and grouping asynchronous pattern, are presented. Two versions of N-FINDR, i.e. iterative N-FINDR and successive N-FINDR, are considered to be implemented in parallel by these patterns respectively. Thus obtains six parallel N-FINDR algorithms. In experiment, both solution quality and parallel performance of these algorithms are compared and suitable patterns for parallel implementation of N-FINDR are obtained.