| Title |
Benchmark for hyperspectral unmixing algorithm evaluation / |
| Authors |
Paura, Vytautas ; Marcinkevičius, Virginijus |
| DOI |
10.15388/23-INFOR522 |
| Full Text |
|
| Is Part of |
Informatica.. Vilnius : Vilniaus universiteto leidykla. 2023, vol. 34, no. 2, p. 285-315.. ISSN 0868-4952. eISSN 1822-8844 |
| Keywords [eng] |
hyperspectral unmixing ; benchmark ; matrix factorization ; autoencoders ; linear mixture models |
| Abstract [eng] |
Over the past decades, many methods have been proposed to solve the linear or nonlinear mixing of spectra inside the hyperspectral data. Due to a relatively low spatial resolution of hyperspectral imaging, each image pixel may contain spectra from multiple materials. In turn, hyperspectral unmixing is finding these materials and their abundances. A few main approaches to performing hyperspectral unmixing have emerged, such as nonnegative matrix factorization (NMF), linear mixture modelling (LMM), and, most recently, autoencoder networks. These methods use different approaches in finding the endmember and abundance of information from hyperspectral images. However, due to the huge variation of hyperspectral data being used, it is difficult to determine which methods perform sufficiently on which datasets and if they can generalize on any input data to solve hyperspectral unmixing problems. By trying to mitigate this problem, we propose a hyperspectral unmixing algorithm testing methodology and create a standard benchmark to test already available and newly created algorithms. A few different experiments were created, and a variety of hyperspectral datasets in this benchmark were used to compare openly available algorithms and to determine the best-performing ones. |
| Published |
Vilnius : Vilniaus universiteto leidykla |
| Type |
Journal article |
| Language |
English |
| Publication date |
2023 |
| CC license |
|
