Orthogonal nonnegative matrix factorization for blind image separation

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes an application of orthogonal nonnegative matrix factorization (NMF) algorithm in blind image separation (BIS) problem. The algorithm itself has been presented in our previous work as an attempt to provide a simple and convergent algorithm for orthogonal NMF, a type of NMF proposed to improve clustering capability of the standard NMF. When we changed the application domain of the algorithm to the BIS problem, surprisingly good results were obtained; the reconstructed images were more similar to the original ones and pleasant to view compared to the results produced by other NMF algorithms. Good results were also obtained when another dataset that consists of unrelated images was used. This practical use along with its convergence guarantee and implementation simplicity demonstrate the benefits of our algorithm. © 2013 Springer International Publishing.

Cite

CITATION STYLE

APA

Mirzal, A. (2013). Orthogonal nonnegative matrix factorization for blind image separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8237 LNCS, pp. 25–35). https://doi.org/10.1007/978-3-319-02958-0_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free