.png){kind=icon}
返回
A new growing method for simplex-based endmember extraction algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TGRS.2006.881803.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new growing method for simplex-based endmemher extraction algorithms (EEAs), called simplex growing algorithm (SGA), is presented in this paper. It is a sequential algorithm to find a simplex with the maximum volume every time a new vertex is added. In order to terminate this algorithm a recently developed concept, virtual dimensionality (VD), is implemented as a stopping rule to determine the number of vertices required for the algorithm to generate. The SGA improves one commonly used EEA, the N-finder algorithm (N-FINDR) developed by Winter, by including a process of growing simplexes one vertex at a time until it reaches a desired number of vertices estimated by the VD, which results in a tremendous reduction of computational complexity. Additionally, it also judiciously selects an appropriate initial vector to avoid a dilemma caused by the use of random vectors as its initial condition in the N-FINDR where the N-FINDR generally produces different sets of final endmembers if different sets of randomly generated initial endmembers are used. In order to demonstrate the performance of the proposed SGA, the N-FINDR and two other EEAs, pixel purity index, and vertex component analysis are used for comparison.
Keyword:
endmember extraction
N-finder algorithm (N-FINDR)
pixel purity index (PPI)
sequential endmember extraction algorithm (SQEEA)
simplex growing algorithm (SGA)
simultaneous endmember extraction algorithm (SMEEA)
vertex component analysis (VCA)
virtual dimensionality (VD)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.6
论文数:
2.1W
被引数:
10.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容