Unmixing of Hyperspectral Images using Bayesian Non-negative Matrix Factorization with Volume Prior
- 597 Downloads
Hyperspectral imaging can be used in assessing the quality of foods by decomposing the image into constituents such as protein, starch, and water. Observed data can be considered a mixture of underlying characteristic spectra (endmembers), and estimating the constituents and their abundances requires efficient algorithms for spectral unmixing. We present a Bayesian spectral unmixing algorithm employing a volume constraint and propose an inference procedure based on Gibbs sampling. We evaluate the method on synthetic and real hyperspectral data of wheat kernels. Results show that our method perform as good or better than existing volume constrained methods. Further, our method gives credible intervals for the endmembers and abundances, which allows us to asses the confidence of the results.
KeywordsBayesian source separation Hyperspectral image analysis Volume regularization Gibbs sampling
- 1.Arngren, M., Schmidt, M., & Larsen, J. (2009). Bayesian nonnegative matrix factorization with volume prior for unmixing of hyperspectral images. In Machine learning for signal processing, IEEE workshop on (MLSP). doi: 10.1109/MLSP.2009.5306262.
- 2.Arngren, M., Schmidt, M. N., & Larsen, J. (2010). Unmixing of hyperspectral images using Bayesian nonnegative matrix factorization with volume prior. Technical note. http://www.imm.dtu.dk/pubdb/p.php?5836.
- 3.Arngren, M., Schmidt, M. N., & Larsen, J. (2010). Unmixing of hyperspectral images using bayesian nonnegative matrix factorization with volume prior, Matlab toolbox. http://www.imm.dtu.dk/pubdb/p.php?5834.
- 6.Boardman, J. W., Kruse, F. A., & Green, R. O. (1995). Mapping target signatures via partial unmixing of aviris data. In Summaries of JPL airborne earth science workshop.Google Scholar
- 10.Dobigeon, N., & Tourneret, J. Y. (2007). Efficient sampling according to a multivariate Gaussian distribution truncated on a simplex. Tech. Rep., IRIT/ENSEEIHT/TeSA.Google Scholar
- 14.Geweke, J. (1991). Efficient simulation from the multivariate normal and student-t distributions subject to linear constraints and the evaluation of constraint probabilities. In Proceedings the 23rd symposium on the interface between computer sciences and statistics (pp. 571–578). doi: 10.1.1.26.6892.
- 15.Hoyer, P. O. (2002). Non-negative sparse coding. Neural Networks for Signal Processing, 7, 557–565.Google Scholar
- 16.Masalmah, Y. M. (2007). Unsupervised unmixing of hyperspectral imagery using the constrained positive matrix factorization. Ph.D. thesis, Computing And Information Science And Engineering, University Of Puerto Rico, Mayagez Campus.Google Scholar
- 17.Mazet, V., Brie, D., & Idier, J. (2005). Simulation of postive normal variables using several proposal distributions. In IEEE workshop on statistical signal processing (pp. 37–42). doi: 10.1109/SSP.2005.1628560.
- 23.Parra, L., Spence, C., Sajda, P., Ziehe, A., & Mller, K. R. (1999). Unmixing hyperspectral data. Neural Information Processing Systems, 12, 942–948.Google Scholar
- 26.Sajda, P., Du, S., & Parra, L. (2003). Recovery of constituent spectra using non-negative matrix factorization. Proceedings of the SPIE - The International Society for Optical Engineering, 5207(1), 321–331.Google Scholar
- 28.Schmidt, M. N. (2009). Linearly constrained bayesian matrix factorization for blind source separation. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, & A. Culotta (Eds.), Advances in neural information processing systems (Vol. 22, pp. 1624–1632).Google Scholar
- 29.Schmidt, M. N., & Laurberg, H. (2008). Nonnegative matrix factorization with Gaussian process priors. Computational Intelligence and Neuroscience p. Article ID 361705.Google Scholar
- 30.Schmidt, M. N., Winther, O., & Hansen, L. K. (2009). Bayesian non-negative matrix factorization. In Independent component analysis and signal separation, international conference on lecture notes in computer science (LNCS) (Vol. 5441, pp. 540–547).Google Scholar
- 31.Winter, M. E. (1999). N-findr: An algorithm for fast autonomous spectral end-member determination in hyperspectral data. Proceedings of SPIE - The International Society for Optical Engineering, 3753, 266–275.Google Scholar