Multiplicative updates algorithm to minimize the generalized Total Variation functional with a non-negativity constraint

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

We propose an efficient algorithm to solve the generalized Total Variation (TV) functional with a non-negativity constraint. This algorithm, which does not involve the solution of a linear system, but rather multiplicative updates only, can be used to solve the denoising and deconvolution problems. The derivation of our method is straightforward once the generalized TV functional is cast as a Non-negative Quadratic Programming (NQP) problem. The proposed algorithm offers a fair computational performance to solve the ℓ2-TV and ℓ1-TV denoising and deconvolution problems and it is the fastest algorithm of which we are aware for general inverse problems involving a nontrivial forward linear operator and a non-negativity constraint.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Image Processing, ICIP 2010 - Proceedings
Pages2509-2512
Number of pages4
DOIs
StatePublished - 2010
Event2010 17th IEEE International Conference on Image Processing, ICIP 2010 - Hong Kong, Hong Kong
Duration: 26 Sep 201029 Sep 2010

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference2010 17th IEEE International Conference on Image Processing, ICIP 2010
Country/TerritoryHong Kong
CityHong Kong
Period26/09/1029/09/10

Keywords

  • Non-negative quadratic programming
  • Total Variation

Fingerprint

Dive into the research topics of 'Multiplicative updates algorithm to minimize the generalized Total Variation functional with a non-negativity constraint'. Together they form a unique fingerprint.

Cite this