By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chein-I Chang ; Dept. of Comput. Sci. & Electr. Eng., Univ. of Maryland, Baltimore, MD, USA ; Wei Xiong ; Chao-Cheng Wu

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.

Published in:

Geoscience and Remote Sensing, IEEE Transactions on  (Volume:51 ,  Issue: 3 )