Benchmark for Hyperspectral Unmixing Algorithm Evaluation

نویسندگان

چکیده

Over the past decades, many methods have been proposed to solve linear or nonlinear mixing of spectra inside hyperspectral data. Due a relatively low spatial resolution imaging, each image pixel may contain from multiple materials. In turn, unmixing is finding these materials and their abundances. A few main approaches performing emerged, such as nonnegative matrix factorization (NMF), mixture modelling (LMM), and, most recently, autoencoder networks. These use different in endmember abundance information images. However, due huge variation data being used, it difficult determine which perform sufficiently on datasets if they can generalize any input problems. By trying mitigate this problem, we propose algorithm testing methodology create standard benchmark test already available newly created algorithms. experiments were created, variety used compare openly algorithms best-performing ones.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A parallel unmixing algorithm for hyperspectral images

We present a new algorithm for feature extraction in hyperspectral images based on source separation and parallel computing. In source separation, given a linear mixture of sources, the goal is to recover the components by producing an unmixing matrix. In hyperspectral imagery, the mixing transform and the separated components can be associated with endmembers and their abundances. Source separ...

متن کامل

An Algorithm Taxonomy for Hyperspectral Unmixing

In this paper, we introduce a set of taxonomies that hierarchically organize and specify algorithms associated with hyperspectral unmixing. Our motivation is to collectively organize and relate algorithms in order to assess the current state-of-the-art in the field and to facilitate objective comparisons between methods. The hyperspectral sensing community is populated by investigators with dis...

متن کامل

Dependent Component Analysis: A Hyperspectral Unmixing Algorithm

Linear unmixing decomposes a hyperspectral image into a collection of reflectance spectra of the materials present in the scene, called endmember signatures, and the corresponding abundance fractions at each pixel in a spatial area of interest. This paper introduces a new unmixing method, called Dependent Component Analysis (DECA), which overcomes the limitations of unmixing methods based on In...

متن کامل

Analysis of Hyperspectral Imagery for Oil Spill Detection Using SAM Unmixing Algorithm Techniques

Oil spill is one of major marine environmental challenges. The main impacts of this phenomenon are preventing light transmission into the deep water and oxygen absorption, which can disturb the photosynthesis process of water plants. In this research, we utilize SpecTIR airborne sensor data to extract and classify oils spill for the Gulf of Mexico Deepwater Horizon (DWH) happened in 2010. For t...

متن کامل

Unmixing Hyperspectral Data

In hyperspectral imagery one pixel typically consists of a mixture of the re ectance spectra of several materials, where the mixture coe cients correspond to the abundances of the constituting materials. We assume linear combinations of re ectance spectra with some additive normal sensor noise and derive a probabilistic MAP framework for analyzing hyperspectral data. As the material reectance c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informatica (lithuanian Academy of Sciences)

سال: 2023

ISSN: ['1822-8844', '0868-4952']

DOI: https://doi.org/10.15388/23-infor522