By Topic

On the Convergence of N-FINDR and Related Algorithms: To Iterate or Not to Iterate?

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

2 Author(s)
Dowler, S. ; Dept. of Electr. & Comput. Eng., Univ. of Auckland, Auckland, New Zealand ; Andrews, M.

A popular algorithm for unmixing hyperspectral data, namely, Winter's N-FINDR algorithm, is frequently used to benchmark other algorithms or as the basis for new algorithms. The interpretations of this algorithm within the literature are not consistent, and some of these differences have significant impact on the convergence of the algorithm. Despite this, the differences in implementation have not been explicitly acknowledged within the literature, which means that many studies are now ambiguous or incomparable. An examination of various implementations of the N-FINDR algorithm highlights that not all interpretations possess the properties asserted by Winter and that interpretations that consider each pixel multiple times generate much larger simplexes. Regardless of which implementation researchers choose to use, if they are explicit in their choice, this would allow for unambiguous comparisons.

Published in:

Geoscience and Remote Sensing Letters, IEEE  (Volume:8 ,  Issue: 1 )