Non-negative matrix factorization approach to blind image deconvolution

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

Abstract

A novel approach to single frame multichannel blind image deconvolution is formulated recently as non-negative matrix factorization (NMF) problem with sparseness constraint imposed on the unknown mixing vector. Unlike most of the blind image deconvolution algorithms, the NMF approach requires no a priori knowledge about the blurring kernel and original image. The experimental performance evaluation of the NMF algorithm is presented with the degraded image by the out-offocus blur. The NMF algorithm is compared to the state-of-the-art single frame blind image deconvolution algorithm: blind Richardson-Lucy algorithm and single frame multichannel independent component analysis based algorithm. It has been demonstrated that NMF approach outperforms mentioned blind image deconvolution methods. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Kopriva, I., & Nuzillard, D. (2006). Non-negative matrix factorization approach to blind image deconvolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3889 LNCS, pp. 966–973). https://doi.org/10.1007/11679363_120

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