scholarly journals Deep Nonnegative Dictionary Factorization for Hyperspectral Unmixing

2020 ◽  
Vol 12 (18) ◽  
pp. 2882
Author(s):  
Wenhong Wang ◽  
Hongfu Liu
Keyword(s):  
Nonnegative Matrix Factorization ◽  
State Of The Art ◽  
Nonnegative Matrix ◽  
Single Layer ◽  
Spectral Unmixing ◽  
Hyperspectral Unmixing ◽  
Hyperspectral Remote Sensing Images ◽  
Relationship Of ◽  
Structured Representation ◽  
Significant Superiority

As a powerful blind source separation tool, Nonnegative Matrix Factorization (NMF) with effective regularizations has shown significant superiority in spectral unmixing of hyperspectral remote sensing images (HSIs) owing to its good physical interpretability and data adaptability. However, the majority of existing NMF-based spectral unmixing methods only adopt the single layer factorization, which is not favorable for exploiting the complex and structured representation relationship of endmembers implied in HSIs. In order to overcome such an issue, we propose a novel two-stage Deep Nonnegative Dictionary Factorization (DNDF) approach with a sparseness constraint and self-supervised regularization for HSI unmixing. Beyond simply extending one-layer factorization to multi-layer, DNDF conducts fuzzy clustering to tackle the mixed endmembers of HSIs. Moreover, self-supervised regularization is integrated into our DNDF model to impose an effective constraint on the endmember matrix. Experimental results on three real HSIs demonstrate the superiority of DNDF over several state-of-the-art methods.

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.

scholarly journals Parameterized Nonlinear Least Squares for Unsupervised Nonlinear Spectral Unmixing

2019 ◽  
Vol 11 (2) ◽  
pp. 148 ◽  
Author(s):  
Risheng Huang ◽  
Xiaorun Li ◽  
Haiqiang Lu ◽  
Jing Li ◽  
Liaoying Zhao
Keyword(s):  
Least Squares ◽  
Optimization Problem ◽  
Nonnegative Matrix Factorization ◽  
Optimization Problems ◽  
State Of The Art ◽  
Synthetic Data ◽  
Nonnegative Matrix ◽  
Nonlinear Least Squares ◽  
Hyperspectral Data ◽  
Spectral Unmixing

This paper presents a new parameterized nonlinear least squares (PNLS) algorithm for unsupervised nonlinear spectral unmixing (UNSU). The PNLS-based algorithms transform the original optimization problem with respect to the endmembers, abundances, and nonlinearity coefficients estimation into separate alternate parameterized nonlinear least squares problems. Owing to the Sigmoid parameterization, the PNLS-based algorithms are able to thoroughly relax the additional nonnegative constraint and the nonnegative constraint in the original optimization problems, which facilitates finding a solution to the optimization problems . Subsequently, we propose to solve the PNLS problems based on the Gauss–Newton method. Compared to the existing nonnegative matrix factorization (NMF)-based algorithms for UNSU, the well-designed PNLS-based algorithms have faster convergence speed and better unmixing accuracy. To verify the performance of the proposed algorithms, the PNLS-based algorithms and other state-of-the-art algorithms are applied to synthetic data generated by the Fan model and the generalized bilinear model (GBM), as well as real hyperspectral data. The results demonstrate the superiority of the PNLS-based algorithms.

Hyperspectral unmixing via deep matrix factorization

2017 ◽  
Vol 15 (06) ◽  
pp. 1750058 ◽  
Author(s):  
Lei Tong ◽  
Jing Yu ◽  
Chuangbai Xiao ◽  
Bin Qian
Keyword(s):  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
State Of The Art ◽  
Nonnegative Matrix ◽  
Real Data ◽  
Hyperspectral Unmixing ◽  
The Past ◽  
Factorization Model ◽  
Layer Structures ◽  
Hyperspectral Remote Sensing Image

Hyperspectral unmixing is one of the most important techniques in hyperspectral remote sensing image analysis. During the past decades, many models have been widely used in hyperspectral unmixing, such as nonnegative matrix factorization (NMF) model, sparse regression model, etc. Most recently, a new matrix factorization model, deep matrix, is proposed and shows good performance in face recognition area. In this paper, we introduce the deep matrix factorization (DMF) for hyperspectral unmixing. In this method, the DMF method is applied for hyperspectral unmixing. Compared with the traditional NMF-based unmixing methods, DMF could extract more information with multiple-layer structures. An optimization algorithm is also proposed for DMF with two designed processes. Results on both synthetic and real data have validated the effectiveness of this method, and shown that it has outperformed several state-of-the-art unmixing approaches.

Nonnegative matrix factorization with entropy regularization for hyperspectral unmixing

2021 ◽  
Vol 42 (16) ◽  
pp. 6362-6393
Author(s):  
Junmin Liu ◽  
Shuai Yuan ◽  
Xuehu Zhu ◽  
Yifan Huang ◽  
Qian Zhao
Keyword(s):  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Hyperspectral Unmixing

scholarly journals Adaptive Structure Concept Factorization for Multiview Clustering

2018 ◽  
Vol 30 (4) ◽  
pp. 1080-1103 ◽  
Author(s):  
Kun Zhan ◽  
Jinhui Shi ◽  
Jing Wang ◽  
Haibo Wang ◽  
Yuange Xie
Keyword(s):  
Nonnegative Matrix Factorization ◽  
State Of The Art ◽  
Nonnegative Matrix ◽  
Adaptive Method ◽  
Data Sets ◽  
Clustering Methods ◽  
Normalized Mutual Information ◽  
Adaptive Structure ◽  
Concept Factorization ◽  
Multiview Clustering

Most existing multiview clustering methods require that graph matrices in different views are computed beforehand and that each graph is obtained independently. However, this requirement ignores the correlation between multiple views. In this letter, we tackle the problem of multiview clustering by jointly optimizing the graph matrix to make full use of the data correlation between views. With the interview correlation, a concept factorization–based multiview clustering method is developed for data integration, and the adaptive method correlates the affinity weights of all views. This method differs from nonnegative matrix factorization–based clustering methods in that it can be applicable to data sets containing negative values. Experiments are conducted to demonstrate the effectiveness of the proposed method in comparison with state-of-the-art approaches in terms of accuracy, normalized mutual information, and purity.

Sign in / Sign up

Export Citation Format

Share Document