Constrained Nonnegative Matrix Factorization for Blind Hyperspectral Unmixing incorporating Endmember Independence

• URL: http://arxiv.org/abs/2003.01041v5
• Date: Sat, 7 Aug 2021 04:42:34 GMT
• Title: Constrained Nonnegative Matrix Factorization for Blind Hyperspectral Unmixing incorporating Endmember Independence
• Authors: E.M.M.B. Ekanayake, H.M.H.K. Weerasooriya, D.Y.L. Ranasinghe, S. Herath, B. Rathnayake, G.M.R.I. Godaliyadda, M.P.B. Ekanayake, H.M.V.R. Herath
• Abstract summary: This paper presents a novel blind HU algorithm, referred to as Kurtosis-based Smooth Nonnegative Matrix Factorization (KbSNMF) It incorporates a novel constraint based on the statistical independence of the probability density functions of endmember spectra. It exhibits superior performance especially in terms of extracting endmember spectra from hyperspectral data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hyperspectral unmixing (HU) has become an important technique in exploiting hyperspectral data since it decomposes a mixed pixel into a collection of endmembers weighted by fractional abundances. The endmembers of a hyperspectral image (HSI) are more likely to be generated by independent sources and be mixed in a macroscopic degree before arriving at the sensor element of the imaging spectrometer as mixed spectra. Over the past few decades, many attempts have focused on imposing auxiliary constraints on the conventional nonnegative matrix factorization (NMF) framework in order to effectively unmix these mixed spectra. As a promising step toward finding an optimum constraint to extract endmembers, this paper presents a novel blind HU algorithm, referred to as Kurtosis-based Smooth Nonnegative Matrix Factorization (KbSNMF) which incorporates a novel constraint based on the statistical independence of the probability density functions of endmember spectra. Imposing this constraint on the conventional NMF framework promotes the extraction of independent endmembers while further enhancing the parts-based representation of data. Experiments conducted on diverse synthetic HSI datasets (with numerous numbers of endmembers, spectral bands, pixels, and noise levels) and three standard real HSI datasets demonstrate the validity of the proposed KbSNMF algorithm compared to several state-of-the-art NMF-based HU baselines. The proposed algorithm exhibits superior performance especially in terms of extracting endmember spectra from hyperspectral data; therefore, it could uplift the performance of recent deep learning HU methods which utilize the endmember spectra as supervisory input data for abundance extraction.

Related papers

• Robust spectral clustering with rank statistics [0.3823356975862007]
  We consider eigenvector-based clustering applied to a matrix of nonparametric rank statistics that is derived entrywise from the raw, original data matrix. Our main theoretical contributions are threefold and hold under flexible data generating conditions. For a dataset of human connectomes, our approach yields parsimonious dimensionality reduction and improved recovery of ground-truth neuroanatomical cluster structure.
  arXiv  Detail & Related papers  (2024-08-19T16:33:44Z)
• Rethinking Clustered Federated Learning in NOMA Enhanced Wireless Networks [60.09912912343705]
  This study explores the benefits of integrating the novel clustered federated learning (CFL) approach with non-independent and identically distributed (non-IID) datasets. A detailed theoretical analysis of the generalization gap that measures the degree of non-IID in the data distribution is presented. Solutions to address the challenges posed by non-IID conditions are proposed with the analysis of the properties.
  arXiv  Detail & Related papers  (2024-03-05T17:49:09Z)
• Datacube segmentation via Deep Spectral Clustering [76.48544221010424]
  Extended Vision techniques often pose a challenge in their interpretation. The huge dimensionality of data cube spectra poses a complex task in its statistical interpretation. In this paper, we explore the possibility of applying unsupervised clustering methods in encoded space. A statistical dimensional reduction is performed by an ad hoc trained (Variational) AutoEncoder, while the clustering process is performed by a (learnable) iterative K-Means clustering algorithm.
  arXiv  Detail & Related papers  (2024-01-31T09:31:28Z)
• Spectral Unmixing of Hyperspectral Images Based on Block Sparse Structure [1.491109220586182]
  This paper presents an innovative spectral unmixing approach for hyperspectral images (HSIs) based on block-sparse structure and sparse Bayesian learning strategy.
  arXiv  Detail & Related papers  (2022-04-10T09:37:41Z)
• Constrained non-negative matrix factorization enabling real-time insights of $\textit{in situ}$ and high-throughput experiments [0.0]
  Non-negative Matrix Factorization (NMF) methods offer an appealing unsupervised learning method for real-time analysis of streaming spectral data. We show how constraining NMF weights or components, provided as known or assumed priors, can provide significant improvement in revealing true underlying phenomena.
  arXiv  Detail & Related papers  (2021-04-02T03:04:24Z)
• Regularization by Denoising Sub-sampled Newton Method for Spectral CT Multi-Material Decomposition [78.37855832568569]
  We propose to solve a model-based maximum-a-posterior problem to reconstruct multi-materials images with application to spectral CT. In particular, we propose to solve a regularized optimization problem based on a plug-in image-denoising function. We show numerical and experimental results for spectral CT materials decomposition.
  arXiv  Detail & Related papers  (2021-03-25T15:20:10Z)
• Feature Weighted Non-negative Matrix Factorization [92.45013716097753]
  We propose the Feature weighted Non-negative Matrix Factorization (FNMF) in this paper. FNMF learns the weights of features adaptively according to their importances. It can be solved efficiently with the suggested optimization algorithm.
  arXiv  Detail & Related papers  (2021-03-24T21:17:17Z)
• Entropy Minimizing Matrix Factorization [102.26446204624885]
  Nonnegative Matrix Factorization (NMF) is a widely-used data analysis technique, and has yielded impressive results in many real-world tasks. In this study, an Entropy Minimizing Matrix Factorization framework (EMMF) is developed to tackle the above problem. Considering that the outliers are usually much less than the normal samples, a new entropy loss function is established for matrix factorization.
  arXiv  Detail & Related papers  (2021-03-24T21:08:43Z)
• Hyperspectral Unmixing via Nonnegative Matrix Factorization with Handcrafted and Learnt Priors [14.032039261229853]
  We propose an NMF based unmixing framework which jointly uses a handcrafting regularizer and a learnt regularizer from data. We plug learnt priors of abundances where the associated subproblem can be addressed using various image denoisers.
  arXiv  Detail & Related papers  (2020-10-09T14:40:20Z)
• Residual-driven Fuzzy C-Means Clustering for Image Segmentation [152.609322951917]
  We elaborate on residual-driven Fuzzy C-Means (FCM) for image segmentation. Built on this framework, we present a weighted $ell_2$-norm fidelity term by weighting mixed noise distribution. The results demonstrate the superior effectiveness and efficiency of the proposed algorithm over existing FCM-related algorithms.
  arXiv  Detail & Related papers  (2020-04-15T15:46:09Z)
• Blind Source Separation for NMR Spectra with Negative Intensity [0.0]
  We benchmark several blind source separation techniques for analysis of NMR spectral datasets containing negative intensity. FastICA, SIMPLISMA, and NNMF are top-performing techniques. The accuracy of FastICA and SIMPLISMA degrades quickly if excess (unreal) pure components are predicted.
  arXiv  Detail & Related papers  (2020-02-07T20:57:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.