A non-negative quadratic programming approach to minimize the generalized vector-valued total variation functional

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

We propose a simple but flexible method for solving the generalized vector-valued TV (VTV) functional with a nonnegativity constraint. One of the main features of this recursive algorithm is that it is based on multiplicative updates only and can be used to solve the denoising and deconvolution problems for vector-valued (color) images. This algorithm is the vectorial extension of the IRN-NQP (Iteratively Reweighted Norm Non-negative Quadratic Programming) algorithm [1] originally developed for scalar (grayscale) images, and to the best of our knowledge, it is the only algorithm that explicitly includes a non-negativity constraint for color images within the TV framework.

Original languageEnglish
Pages (from-to)314-318
Number of pages5
JournalEuropean Signal Processing Conference
StatePublished - 2010
Event18th European Signal Processing Conference, EUSIPCO 2010 - Aalborg, Denmark
Duration: 23 Aug 201027 Aug 2010

Fingerprint

Dive into the research topics of 'A non-negative quadratic programming approach to minimize the generalized vector-valued total variation functional'. Together they form a unique fingerprint.

Cite this