<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Archives</journal-id>
<journal-title-group>
<journal-title>The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Archives</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9034</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprs-archives-XLII-4-W18-571-2019</article-id>
<title-group>
<article-title>ASSESSING AND COMPARING THE PERFORMANCE OF ENDMEMBER EXTRACTION METHODS IN MULTIPLE CHANGE DETECTION USING HYPERSPECTRAL DATA</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Jafarzadeh</surname>
<given-names>H.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Hasanlou</surname>
<given-names>M.</given-names>
<ext-link>https://orcid.org/0000-0002-7254-4475</ext-link>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran, Iran</addr-line>
</aff>
<pub-date pub-type="epub">
<day>18</day>
<month>10</month>
<year>2019</year>
</pub-date>
<volume>XLII-4/W18</volume>
<fpage>571</fpage>
<lpage>575</lpage>
<permissions>
<copyright-statement>Copyright: &#x000a9; 2019 H. Jafarzadeh</copyright-statement>
<copyright-year>2019</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri"  xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-archives.copernicus.org/articles/XLII-4-W18/571/2019/isprs-archives-XLII-4-W18-571-2019.html">This article is available from https://isprs-archives.copernicus.org/articles/XLII-4-W18/571/2019/isprs-archives-XLII-4-W18-571-2019.html</self-uri>
<self-uri xlink:href="https://isprs-archives.copernicus.org/articles/XLII-4-W18/571/2019/isprs-archives-XLII-4-W18-571-2019.pdf">The full text article is available as a PDF file from https://isprs-archives.copernicus.org/articles/XLII-4-W18/571/2019/isprs-archives-XLII-4-W18-571-2019.pdf</self-uri>
<abstract>
<p>Endmember extraction is a process to identify the hidden pure source signals from the mixture. Endmember finding has become increasingly important in hyperspectral data exploitation because endmembers can be used to specify unknown particular spectral classes. This paper evaluates the change detection problem in bi-temporal hyperspectral remote sensing images using the unmixing process. A complete spectral unmixing process contains estimating the number of endmembers, endmember extraction and abundance estimation. Endmember extraction is a vital step in spectral unmixing of hyperspectral images. Hyperspectral change detection by unmixing has the potential to provide subpixel information from hyperspectral images. In this study, four methods including Simplex Identification via variable Splitting and Augmented Lagrangian (SISAL), N-finder algorithm (N-FINDR), Vertex Component Analysis (VCA), and Fast algorithm for linearly Unmixing (FUN) are used to produce multiple change detection maps. This paper explores and compares the performance of these methods in multiple change detection. The empirical results reveal the superiority of the FUN method in providing multiple change map with an overall accuracy of 87% and a kappa coefficient of 0.70.</p>
</abstract>
<counts><page-count count="5"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>