Abstract
N-FINDR has been widely used for endmember extraction in hyperspectral imagery. Due to its high computational complexity developing fast computing N-FINDR has become interest. One approach is to design field programmable gate array (FPGA) architecture for N-FINDR to reduce computing time. However, two major issues still need to be addressed. One is that the number of endmembers must be fixed regardless of applications. The other is computation of simplex volumes. This paper investigates a progressive version of N-FINDR, previously known as simplex growing algorithm (SGA) for its FPGA implementation which basically resolves these two issues.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
