Abstract
In this paper we present optimization algorithms for image restoration based on the total variation (TV) minimization framework of Rudin, Osher, and Fatemi (ROF). Our approach formulates TV minimization as a second-order cone program which is then solved by interior-point algorithms that are efficient both in practice (using nested dissection and domain decomposition) and in theory (i.e., they obtain solutions in polynomial time). In addition to the original ROF minimization model, we show how to apply our approach to other TV models, including ones that are not solvable by PDE-based methods. Numerical results on a varied set of images are presented to illustrate the effectiveness of our approach.
Keywords
MathematicsMinificationImage (mathematics)Interior point methodImage restorationAlgorithmMathematical optimizationDomain (mathematical analysis)PolynomialImage processingComputer scienceArtificial intelligenceMathematical analysis
Affiliated Institutions
Related Publications
Image Decomposition and Restoration Using Total Variation Minimization and the<i>H</i><sup>1</sup>
In this paper, we propose a new model for image restoration and image decomposition into cartoon and texture, based on the total variation minimization of Rudin, Osher, and Fate...
A computational algorithm for minimizing total variation in image restoration
A reliable and efficient computational algorithm for restoring blurred and noisy images is proposed. The restoration process is based on the minimal total variation principle in...
Recovery of Blocky Images from Noisy and Blurred Data
The purpose of this investigation is to understand situations under which an enhancement method succeeds in recovering an image from data which are noisy and blurred. The method...
Image decomposition via the combination of sparse representations and a variational approach
The separation of image content into semantic parts plays a vital role in applications such as compression, enhancement, restoration, and more. In recent years, several pioneeri...
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated ba...
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 27
- Issue
- 2
- Pages
- 622-645
- Citations
- 196
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
196
OpenAlex
Cite This
Donald Goldfarb,
Wotao Yin
(2005).
Second-order Cone Programming Methods for Total Variation-Based Image Restoration.
SIAM Journal on Scientific Computing
, 27
(2)
, 622-645.
https://doi.org/10.1137/040608982
Identifiers
- DOI
- 10.1137/040608982