Hyperspectral image unmixing algorithm based on endmember-constrained nonnegative matrix factorization
- 32 Downloads
The objective function of classical nonnegative matrix factorization (NMF) is non-convexity, which affects the obtaining of optimal solutions. In this paper, we proposed a NMF algorithm, and this algorithm was based on the constraint of endmember spectral correlation minimization and endmember spectral difference maximization. The size of endmember spectral overall-correlation was measured by the correlation function, and correlation function was defined as the sum of the absolute values of every two correlation coefficient between the spectra. In the difference constraint of the endmember spectra, the mutation of matrix trace was slowed down by introducing the natural logarithm function. Combining the image decomposition error with the influences of endmember spectra, in the objective function the projection gradient was used to achieve NMF. The effectiveness of algorithm was verified by the simulated hyperspectral images and real hyperspectral images.
Keywordshyperspectral image unmixing nonnegative matrix factorization (NMF) correlation logarithm function
Unable to display preview. Download preview PDF.
- 10.Luo W F, Zhong L, Zhang B, Gao L R. Independent component analysis for spectral unmixing in hyperspectral remote sensing image. Spectroscopy and Spectral Analysis, 2010, 30(6): 1628–1633 (in Chinese)Google Scholar
- 11.Wu B, Zhao Y, Zhou X. Unmixing mixture pixels of hyperspectral imagery using endmember constrained nonnegative matrix factorization. Computer Engineering, 2008, 34(22): 229–231Google Scholar
- 15.Clark R N, Swayze G A. Evolution in imaging spectroscopy analysis and sensor signal-to-noise: an examination of how far we have come. In: Proceedings of The 6th Annual JPL Airborne Earth Science Workshop, 1996Google Scholar