2002
DOI: 10.1117/12.454162
|View full text |Cite
|
Sign up to set email alerts
|

<title>Automated identification of endmembers from hyperspectral data using mathematical morphology</title>

Abstract: One of the most widely used approaches to analyze hyperspectral data is pixel unmixing, which relies on the identification of the purest spectra from the data cube. Once these elements, known as "endmembers", are extracted, several methods can be used to map their spatial distributions, associations and abundances. A large variety of methodologies have been recently proposed with the purpose of extracting endmembers from hyperspectral data. Nevertheless, most of them only rely on the spectral response; spatial… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2002
2002
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…In this case, the kernel size increases exponentially, which results in an exponential complexity ( in asymptotical notation). We have tested some variations of the previous implementation in order to reduce the computational complexity of the proposed approach, and a constrained implementation through cascade dilation operations and nonoverlapping kernel sizes [43] proved to be considerably faster than the previous approach. The constraints imposed result in a computational complexity ( in asymptotical notation).…”
Section: (12)mentioning
confidence: 99%
“…In this case, the kernel size increases exponentially, which results in an exponential complexity ( in asymptotical notation). We have tested some variations of the previous implementation in order to reduce the computational complexity of the proposed approach, and a constrained implementation through cascade dilation operations and nonoverlapping kernel sizes [43] proved to be considerably faster than the previous approach. The constraints imposed result in a computational complexity ( in asymptotical notation).…”
Section: (12)mentioning
confidence: 99%
“…In order to circumvent the need for a priori endmember choice from a region-specific spectral selection, a number of methods for automated endmember determination has been developed (Tompkins et al 1997, Winter 1999. The algorithm by Plaza et al (2001) appears particularly suited for AVIRIS data. Inclusion of automated endmember determination would represent an elegant extension for the ARIA method, completely removing the need for a priori assumptions on endmember spectra.…”
Section: Discussionmentioning
confidence: 98%
“…Even the most modern satellite images will not allow to obtain the necessary information without the fast and reliable decryption methods found in most modern specialized software products. Techniques for automated decoding of images developed by a number of international research institutes and research institutes of Ukraine, including classification, contouring and recognition of images of topographic objects [9,10,11,12], allow to maximize the efficiency of decryption, in comparison with traditional non-automated methods. However, the developers of these techniques emphasize that the presence of a number of interactive processes, such as contouring, searching for reference information, classification of images by texture and brightness characteristics, significantly reduces labor productivity during decryption.…”
Section: A R C H I T E C T U R E C I V I L E N G I N E E R I N G E N V I R O N M E N Tmentioning
confidence: 99%