Orthogonal nonnegative matrix factorization for blind image separation

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 propos...

Full description

Saved in:
Bibliographic Details
Main Author: Mirzal, Andri
Format: Conference or Workshop Item
Published: 2013
Subjects:
Online Access:http://eprints.utm.my/id/eprint/51230/
http://dx.doi.org/10.1007/978-3-319-02958-0_3
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
id my.utm.51230
record_format eprints
spelling my.utm.512302017-06-12T04:37:51Z http://eprints.utm.my/id/eprint/51230/ Orthogonal nonnegative matrix factorization for blind image separation Mirzal, Andri QA75 Electronic computers. Computer science 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 Conference or Workshop Item PeerReviewed Mirzal, Andri (2013) Orthogonal nonnegative matrix factorization for blind image separation. In: 3rd International Visual Informatics Conference, IVIC 2013, 13 - 15 November 2013, Selangor; Malaysia. http://dx.doi.org/10.1007/978-3-319-02958-0_3
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Mirzal, Andri
Orthogonal nonnegative matrix factorization for blind image separation
description 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.
format Conference or Workshop Item
author Mirzal, Andri
author_facet Mirzal, Andri
author_sort Mirzal, Andri
title Orthogonal nonnegative matrix factorization for blind image separation
title_short Orthogonal nonnegative matrix factorization for blind image separation
title_full Orthogonal nonnegative matrix factorization for blind image separation
title_fullStr Orthogonal nonnegative matrix factorization for blind image separation
title_full_unstemmed Orthogonal nonnegative matrix factorization for blind image separation
title_sort orthogonal nonnegative matrix factorization for blind image separation
publishDate 2013
url http://eprints.utm.my/id/eprint/51230/
http://dx.doi.org/10.1007/978-3-319-02958-0_3
_version_ 1643652978489425920