Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T23:51:10.069Z Has data issue: false hasContentIssue false

A Convex and Exact Approach to Discrete Constrained TV-L1 Image Approximation

Published online by Cambridge University Press:  28 May 2015

Jing Yuan*
Affiliation:
Computer Science Department, Middlesex College, University of Western Ontario, London, Ontario, N6A 5B7, UK
Juan Shi*
Affiliation:
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore
Xue-Cheng Tai*
Affiliation:
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, SingaporeDepartment of Mathematics, University of Bergen, Norway
*
Corresponding author. Email: cn.yuanjing@gmail.com
Corresponding author. Email: shij0004@e.ntu.edu.sg
Corresponding author. Email: tai@mi.uib.no
Get access

Abstract

We study the TV-L1 image approximation model from primal and dual perspective, based on a proposed equivalent convex formulations. More specifically, we apply a convex TV-L1 based approach to globally solve the discrete constrained optimization problem of image approximation, where the unknown image function u(x) ∈ {f1,…,fn}, ∀x ∈ Ω. We show that the TV-L1 formulation does provide an exact convex relaxation model to the non-convex optimization problem considered. This result greatly extends recent studies of Chan et al., from the simplest binary constrained case to the general gray-value constrained case, through the proposed rounding scheme. In addition, we construct a fast multiplier-based algorithm based on the proposed primal-dual model, which properly avoids variability of the concerning TV-L1 energy function. Numerical experiments validate the theoretical results and show that the proposed algorithm is reliable and effective.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable