A parametric maximum flow approach for discrete total variation regularization

MaRDI QIDQ3464582zbMATH OpenFDO

Authors Antonin Chambolle, Jérôme Darbon

Publication date 27 January 2016

zbMATH Keywords

binary optimizationdiscrete total variationsparametric network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Parametric maximum flow algorithms for fast total variation minimization
• An algorithm for the proximity operator in hybrid TV-wavelet regularization, with application to MR image reconstruction.
• Proximity algorithms for image models: denoising
• Using generalized cross validation to select regularization parameter for total variation regularization problems
• Image restoration with discrete constrained total variation. I: Fast and exact optimization

Cited in

(5)

• Approximating the total variation with finite differences or finite elements
• Parametric maximum flow algorithms for fast total variation minimization
• Inertial Bregman proximal gradient under partial smoothness
• Discrete-to-continuum crystalline curvature flows
• McCormick envelopes in mixed-integer PDE-constrained optimization

This page was built for publication: A parametric maximum flow approach for discrete total variation regularization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464582)