Nonnegative Matrix Factorization (NMF) is an unsupervised learning method that has been already applied to many applications of spectral signal unmixing. However, its efficiency in some applications strongly depends on optimization algorithms used for estimating the underlying nonnegatively constrained subproblems. In this paper, we attempt to tackle the optimization tasks with the inexact Interior-Point (IP) algorithm that has been successfully applied to image deblurring [S. Bonettini, T. Serafini, 2009]. The experiments demonstrate that the proposed NMF algorithm considerably outperforms the well-known NMF algorithms for blind unmixing of the Raman spectra. © 2012 Springer-Verlag.
CITATION STYLE
Zdunek, R. (2012). Spectral signal unmixing with interior-point nonnegative matrix factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7552 LNCS, pp. 65–72). https://doi.org/10.1007/978-3-642-33269-2_9
Mendeley helps you to discover research relevant for your work.