Endmember Extraction For Hyperspectral Imagery Research Articles

Hyperspectral Endmember Extraction Using Spatially Weighted Simplex Strategy

Spatial information is increasingly becoming a vital factor in the field of hyperspectral endmember extraction, since it takes into consideration the spatial correlation of pixels, which generally involves jointing spectral information for preprocessing and/or endmember extraction in hyperspectral imagery (HSI). Generally, simplex-based endmember extraction algorithms (EEAs) identify endmembers without considering spatial attributes, and the spatial preprocessing strategy is an independently executed module that can provide spatial information for the endmember search process. Despite this interest, to the best of our knowledge, no one has studied the integration framework of the spatial information-embedded simplex for hyperspectral endmember extraction. In this paper, we propose a spatially weighted simplex strategy, called SWSS, for hyperspectral endmember extraction that investigates a novel integration framework of the spatial information-embedded simplex for identifying endmember. Specifically, the SWSS generates the spatial weight scalar of each pixel by determining its corresponding spatial neighborhood correlations for weighting itself within the simplex framework to regularize the selection of the endmembers. The SWSS could be implemented in the traditional simplex-based EEAs, such as vertex component analysis (VCA), to introduce spatial information into the data simplex framework without the computational complexity excessively increasing or endmember extraction accuracy loss. Based on spectral angle distance (SAD) and root-mean-square-error (RMSE) evaluation criteria, experimental results on both synthetic and C u p r i t e real hyperspectral datasets indicate that the simplex-based EEA re-implemented by the SWSS has a significant improvement on endmember extraction performance over the techniques on their own and without re-implementing.

Field-Programmable Gate Array Design of Implementing Simplex Growing Algorithm for Hyperspectral Endmember Extraction

N-finder algorithm (N-FINDR) has been widely used for endmember extraction in hyperspectral imagery. Due to its high computational complexity, developing fast computing N-FINDR has received considerable interest, specifically to take advantage of field-programmable gate array (FPGA) architecture in hardware implementation to realize N-FINDR. However, there are two severe drawbacks arising in the nature of N-FINDR design, the number of endmembers, p, which must be fixed once its value is determined in FPGA design and inconsistency in final extracted endmembers caused by different selections of initial endmembers. This paper investigates a progressive version of N-FINDR, previously known as simplex growing algorithm for its FPGA implementation which can resolve these two issues.

Real-time N-finder processing algorithms for hyperspectral imagery

N-finder algorithm (N-FINDR) is probably one of most popular and widely used algorithms for endmember extraction in hyperspectral imagery. When it comes to practical implementation, four major obstacles need to be overcome. One is the number of endmembers which must be known a priori. A second one is the use of random initial endmembers to initialize N-FINDR, which generally results in different sets of final extracted endmembers. Consequently, the results are inconsistent and not reproducible. A third one is requirement of dimensionality reduction (DR) where different used DR techniques produce different results. Finally yet importantly, it is the very expensive computational cost caused by an exhaustive search for endmembers all together simultaneously. This paper re-designs N-FINDR in a real time processing fashion to cope with these issues. Four versions of Real Time (RT) N-FINDR are developed, RT Iterative N-FINDR (RT IN-FINDR), RT SeQuential N-FINDR (RT SQ N-FINDR), RT Circular N-FINDR, RT SuCcessive N-FINDR (RT SC N-FINDR), each of which has its own merit for implementation. Experimental results demonstrate that real time processing algorithms perform as well as their counterparts with no real-time processing.