Minimum Dispersion Constrained Nonnegative Matrix Factorization to Unmix Hyperspectral Data

2010 ◽  
Vol 48 (6) ◽  
pp. 2590-2602 ◽  
Author(s):  
Alexis Huck ◽  
Mireille Guillaume ◽  
Jacques Blanc-Talon
Keyword(s):  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Hyperspectral Data

scholarly journals Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization

2012 ◽  
Vol 24 (4) ◽  
pp. 1085-1105 ◽  
Author(s):  
Nicolas Gillis ◽  
François Glineur
Keyword(s):  
Data Analysis ◽  
Least Squares ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Computational Cost ◽  
Nonnegative Matrix ◽  
Careful Analysis ◽  
Hyperspectral Data ◽  
Projected Gradient Method ◽  
Multiplicative Updates

Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing, hyperspectral data analysis, computational biology, and clustering. In this letter, we consider two well-known algorithms designed to solve NMF problems: the multiplicative updates of Lee and Seung and the hierarchical alternating least squares of Cichocki et al. We propose a simple way to significantly accelerate these schemes, based on a careful analysis of the computational cost needed at each iteration, while preserving their convergence properties. This acceleration technique can also be applied to other algorithms, which we illustrate on the projected gradient method of Lin. The efficiency of the accelerated algorithms is empirically demonstrated on image and text data sets and compares favorably with a state-of-the-art alternating nonnegative least squares algorithm.

scholarly journals Sparse Nonnegative Matrix Factorization for Hyperspectral Unmixing Based on Endmember Independence and Spatial Weighted Abundance

2021 ◽  
Vol 13 (12) ◽  
pp. 2348
Author(s):  
Jingyan Zhang ◽  
Xiangrong Zhang ◽  
Licheng Jiao
Keyword(s):  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Hyperspectral Image ◽  
Nonnegative Matrix ◽  
Hyperspectral Data ◽  
Underlying Structure ◽  
Mixed Pixel ◽  
Hyperspectral Unmixing ◽  
Autocorrelation Matrix ◽  
Sparse Nonnegative Matrix Factorization

Hyperspectral image unmixing is an important task for remote sensing image processing. It aims at decomposing the mixed pixel of the image to identify a set of constituent materials called endmembers and to obtain their proportions named abundances. Recently, number of algorithms based on sparse nonnegative matrix factorization (NMF) have been widely used in hyperspectral unmixing with good performance. However, these sparse NMF algorithms only consider the correlation characteristics of abundance and usually just take the Euclidean structure of data into account, which can make the extracted endmembers become inaccurate. Therefore, with the aim of addressing this problem, we present a sparse NMF algorithm based on endmember independence and spatial weighted abundance in this paper. Firstly, it is assumed that the extracted endmembers should be independent from each other. Thus, by utilizing the autocorrelation matrix of endmembers, the constraint based on endmember independence is to be constructed in the model. In addition, two spatial weights for abundance by neighborhood pixels and correlation coefficient are proposed to make the estimated abundance smoother so as to further explore the underlying structure of hyperspectral data. The proposed algorithm not only considers the relevant characteristics of endmembers and abundances simultaneously, but also makes full use of the spatial-spectral information in the image, achieving a more desired unmixing performance. The experiment results on several data sets further verify the effectiveness of the proposed algorithm.

Nonnegative matrix factorization with region sparsity learning for hyperspectral unmixing

2017 ◽  
Vol 15 (06) ◽  
pp. 1750063
Author(s):  
Bin Qian ◽  
Lei Tong ◽  
Zhenmin Tang ◽  
Xiaobo Shen
Keyword(s):  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Spatial Information ◽  
State Of The Art ◽  
Nonnegative Matrix ◽  
Hyperspectral Data ◽  
Optimization Scheme ◽  
Hyperspectral Unmixing ◽  
Relationship Of ◽  
The Relationship

Hyperspectral unmixing is one of the most important techniques in the remote sensing image analysis tasks. In recent decades, nonnegative matrix factorization (NMF) has been shown to be effective for hyperspectral unmixing due to the strong discovery of the latent structure. Most NMFs put emphasize on the spectral information, but ignore the spatial information, which is very crucial for analyzing hyperspectral data. In this paper, we propose an improved NMF method, namely NMF with region sparsity learning (RSLNMF), to simultaneously consider both spectral and spatial information. RSLNMF defines a new sparsity learning model based on a small homogeneous region that is obtained via the graph cut algorithm. Thus RSLNMF is able to explore the relationship of spatial neighbor pixels within each region. An efficient optimization scheme is developed for the proposed RSLNMF, and its convergence is theoretically guaranteed. Experiments on both synthetic and real hyperspectral data validate the superiority of the proposed method over several state-of-the-art unmixing approaches.

Sign in / Sign up

Export Citation Format

Share Document