2012
DOI: 10.1109/tgrs.2012.2185056
|View full text |Cite
|
Sign up to set email alerts
|

New Improvements in Parallel Implementation of N-FINDR Algorithm

Abstract: Endmember extraction (EE) is the first step in hyperspectral data unmixing. N-FINDR is one of the most commonly used EE algorithms. Nevertheless, its computational complexity is high, particularly, for a large data set. Following a parallel version of N-FINDR, i.e., P-FINDR, further improvements are presented in this paper. First, generic endmember re-extraction operation (GERO) and multiple search paths are introduced such that multiple endmembers are extracted in parallel. Second, by making full use of the a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Similar partitioning strategies have been adopted in previous studies [23], [43]. In addition, this strategy can be easily implemented in parallel [44], [45]. Such subblock processing is also quite suitable when images cover large areas [2].…”
Section: B Multiple Algorithm Integration: Strategy Designmentioning
confidence: 94%
“…Similar partitioning strategies have been adopted in previous studies [23], [43]. In addition, this strategy can be easily implemented in parallel [44], [45]. Such subblock processing is also quite suitable when images cover large areas [2].…”
Section: B Multiple Algorithm Integration: Strategy Designmentioning
confidence: 94%
“…3 LMMs can be categorized as either unsupervised-or semisupervised-based unmixing algorithms. Unsupervised-based unmixing methods require endmember extraction and abundance estimation steps, 4,5 which can be classified as geometric-, [6][7][8][9][10][11][12][13][14][15][16][17][18] statistic-, [19][20][21][22][23][24] or spatial-informationbased. [25][26][27][28][29] Geometric-based algorithms usually assume that desired pure pixels exist in an image, but they usually fail if the image mixing degree is high.…”
Section: Introductionmentioning
confidence: 99%