Parametric Maximum Flow Algorithms for Fast Total Variation Minimization

DOI10.1137/070706318zbMath1198.49040OpenAlexW2093133114MaRDI QIDQ3162127

Donald Goldfarb, Wotao Yin

Publication date: 19 October 2010

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/97d9ee64464fced3e07c2b1f69ef8ea42a9b1e06

zbMATH Keywords

total variationminimum cutimage denoisingmaximum flowMRIgraph cutparametric maximum flow

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Interior-point methods (90C51) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Optimization of shapes other than minimal surfaces (49Q10) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (19)

Total-variation mode decomposition ⋮ Anisotropic variation formulas for imaging applications ⋮ On total variation minimization and surface evolution using parametric maximum flows ⋮ A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing ⋮ On the global and linear convergence of the generalized alternating direction method of multipliers ⋮ An alternating direction method for total variation denoising ⋮ Domain decomposition methods with graph cuts algorithms for total variation minimization ⋮ Copula density estimation by total variation penalized likelihood with linear equality constraints ⋮ A finite hyperplane traversal algorithm for 1-dimensional \(L^1pTV\) minimization, for \(0<p\leq 1\) ⋮ An efficient multi-grid method for TV minimization problems ⋮ Cauchy noise removal by nonconvex ADMM with convergence guarantees ⋮ A coordinate descent method for total variation minimization ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ An FFT-based method for computing weighted minimal surfaces in microstructures with applications to the computational homogenization of brittle fracture ⋮ Total Variation in Imaging ⋮ Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ Finite-dimensional approximation of convex regularization via hexagonal pixel grids ⋮ Active-set Methods for Submodular Minimization Problems

Uses Software

• RecPF
• FTVd
• MAXFLOW

This page was built for publication: Parametric Maximum Flow Algorithms for Fast Total Variation Minimization