Dual constrained TV-based regularization on graphsReport as inadecuate

Dual constrained TV-based regularization on graphs - Download this document for free, or read online. Document in PDF available to download.

1 Direction Technologie, Informatique et Mathématiques appliquées 2 Research & Development Redwood City 3 LIGM - Laboratoire d-Informatique Gaspard-Monge

Abstract : Algorithms based on Total Variation TV minimization are prevalent in image processing. They play a key role in a variety of applications such as image denoising, compressive sensing and inverse problems in general. In this work, we extend the TV dual framework that includes Chambolle-s and Gilboa-Osher-s projection algorithms for TV minimization. We use a flexible graph data representation that allows us to generalize the constraint on the projection variable. We show how this new formulation of the TV problem may be solved by means of fast parallel proximal algorithms. On denoising and deblurring examples, the proposed approach is shown not only to perform better than recent TV-based approaches, but also to perform well on arbitrary graphs instead of regular grids. The proposed method consequently applies to a variety of other inverse problems including image fusion and mesh filtering.

Keywords : Proximal methods inverse problem image denoising convex optimization parallel algorithms image restoration bounded variation mesh smoothing discrete calculus

Author: Camille Couprie - Leo Grady - Laurent Najman - Jean-Christophe Pesquet - Hugues Talbot -

Source: https://hal.archives-ouvertes.fr/


Related documents