A new simplex growing endmember extraction algorithm and its fast implementation
The simplex growing algorithm (SGA) suffers from two issues in its practical implementation.One is that it needs to reduce the original data’s dimensionality in advance.The other one is its excessive computation.In order to solve the first issue,a new simplex growing algorithm (N-SGA) which uses a new simplex volume formula with no need for dimension reduction is proposed in this paper.Furthermore,a developed approach called Fast N-SGA is put forward to reduce the computation complexity.The conducted experiments demonstrate that the proposed algorithms N-SGA and Fast N-SGA perform better than the tradition SGA.
photogrammetry and remote Sensing endmember extraction N-SGA fast N-SGA dimension reduction computation complexity
Lijiao Wang Xiaorun Li Jiantao Cui Liaoying Zhao
Zhejiang University,College of Electrical Engineering,Hangzhou,310027,China Institute of Computer Application Technology,Hangzhou Dianzi University,Hangzhou,310027,China
国内会议
北京
英文
1-14
2013-12-01(万方平台首次上网日期,不代表论文的发表时间)