Iterative method for deblurring problem based on the least squared criterion

Research output: Contribution to journalArticlepeer-review

Abstract

In order to obtain more effective result, this paper proposes an iterative algorithm for solving the least squared criterion based image deblurring problem subject to nonnegative constraints. This iterative algorithm is proposed based on Generalized Kuhn-Tucker Theorem. It is shown that every function in the sequence is nonnegative and that the sequence converges monotonically to a minimum. The experiments verify that our iterative algorithm is superior to the developed iterative algorithm by Snyder in the identical problem and iterations.

Original languageEnglish
Pages (from-to)2443-2448
Number of pages6
JournalICIC Express Letters
Volume7
Issue number8
StatePublished - 2013
Externally publishedYes

Keywords

  • Deblurring
  • Iterative algorithm
  • Least squared criterion

Fingerprint

Dive into the research topics of 'Iterative method for deblurring problem based on the least squared criterion'. Together they form a unique fingerprint.

Cite this