Back to Search
Start Over
Unmixing of large-scale hyperspectral data based on projected mini-batch gradient descent.
- Source :
-
International Journal of Wavelets, Multiresolution & Information Processing . Nov2017, Vol. 15 Issue 6, p-1. 15p. - Publication Year :
- 2017
-
Abstract
- The minimization problem of reconstruction error over large hyperspectral image data is one of the most important problems in unsupervised hyperspectral unmixing. A variety of algorithms based on nonnegative matrix factorization (NMF) have been proposed in the literature to solve this minimization problem. One popular optimization method for NMF is the projected gradient descent (PGD). However, as the algorithm must compute the full gradient on the entire dataset at every iteration, the PGD suffers from high computational cost in the large-scale real hyperspectral image. In this paper, we try to alleviate this problem by introducing a mini-batch gradient descent-based algorithm, which has been widely used in large-scale machine learning. In our method, the endmember can be updated pixel set by pixel set while abundance can be updated band set by band set. Thus, the computational cost is lowered to a certain extent. The performance of the proposed algorithm is quantified in the experiment on synthetic and real data. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02196913
- Volume :
- 15
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- International Journal of Wavelets, Multiresolution & Information Processing
- Publication Type :
- Academic Journal
- Accession number :
- 126461402
- Full Text :
- https://doi.org/10.1142/S021969131750059X