On total variation minimization and surface evolution using parametric maximum flows

DOI10.1007/S11263-009-0238-9zbMath1371.94073OpenAlexW1986753844MaRDI QIDQ847514

Jérôme Darbon, Antonin Chambolle

Publication date: 16 February 2010

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-009-0238-9

zbMATH Keywords

total variationvariational approachessubmodular functionsmax-flow/min-cutcrystalline and anisotropic mean curvature flowparametric max-flow algorithms

Mathematics Subject Classification ID

Variational methods applied to PDEs (35A15) Variational problems in a geometric measure-theoretic setting (49Q20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (48)

Relation between total variation and persistence distance and its application in signal processing ⋮ On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations ⋮ Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere ⋮ Motion and pinning of discrete interfaces ⋮ On Hamilton-Jacobi PDEs and image denoising models with certain nonadditive noise ⋮ False Discovery Rate Smoothing ⋮ Unnamed Item ⋮ Image segmentation with arbitrary noise models by solving minimal surface problems ⋮ Submodular functions: from discrete to continuous domains ⋮ Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise ⋮ A spatial regularization approach for vector quantization ⋮ Joint contour filtering ⋮ Unnamed Item ⋮ Invariant $\varphi$-Minimal Sets and Total Variation Denoising on Graphs ⋮ Bregmanized domain decomposition for image restoration ⋮ A new nonlocal nonlinear diffusion equation for data analysis ⋮ Guarantees of total variation minimization for signal recovery ⋮ Convex histogram-based joint image segmentation with regularized optimal transport cost ⋮ Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients ⋮ A posteriori error control for the binary Mumford-Shah model ⋮ Geometric properties of solutions to the total variation denoising problem ⋮ Nonconvex model for mixing noise with fractional-order regularization ⋮ Bayesian image restoration for mosaic active imaging ⋮ On Decomposition Models in Imaging Sciences and Multi-time Hamilton--Jacobi Partial Differential Equations ⋮ Solving Minimal Surface Problems on Surfaces and Point Clouds ⋮ Continuous limits of discrete perimeters ⋮ Exact post-selection inference for the generalized Lasso path ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ The DFS Fused Lasso: Linear-Time Denoising over General Graphs ⋮ Optimality bounds for a variational relaxation of the image partitioning problem ⋮ Discrete and continuous models for partitioning problems ⋮ Mean curvature, threshold dynamics, and phase field theory on finite graphs ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ An introduction to continuous optimization for imaging ⋮ Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform ⋮ Automated parameter selection for total variation minimization in image restoration ⋮ A convergent overlapping domain decomposition method for total variation minimization ⋮ Total Variation in Imaging ⋮ Numerical Methods and Applications in Total Variation Image Restoration ⋮ Simplified Energy Landscape for Modularity Using Total Variation ⋮ Total Variation Denoising in $l^1$ Anisotropy ⋮ Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs ⋮ Non-overlapping domain decomposition methods for dual total variation based image denoising ⋮ Semisupervised data classification via the Mumford-Shah-Potts-type model ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ On Bayesian posterior mean estimators in imaging sciences and Hamilton-Jacobi partial differential equations ⋮ Finite-dimensional approximation of convex regularization via hexagonal pixel grids ⋮ Active-set Methods for Submodular Minimization Problems

Uses Software

• MAXFLOW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Pseudo-Boolean optimization
• Crystalline mean curvature flow of convex sets
• Complexity and algorithms for convex network optimization and other nonlinear problems
• Implicit time discretization of the mean curvature flow with a discontinuous forcing term
• On submodular function minimization
• The ellipsoid method and its consequences in combinatorial optimization
• Facet-breaking for three-dimensional crystals evolving by mean curvature
• Implicit time discretization for the mean curvature flow equation
• Anisotropic motion by mean curvature in the context of Finsler geometry
• Introductory lectures on convex optimization. A basic course.
• A characterization of convex calibrable sets in \(\mathbb R^N\)
• Variational algorithms and pattern formation in dendritic solidification
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• An algorithm for mean curvature motion
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• Anisotropic curvature-driven flow of convex sets
• On active contour models and balloons
• Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Total Variation Regularization for Image Denoising, I. Geometric Theory
• The Discontinuity Set of Solutions of the TV Denoising Problem and Some Extensions
• A Viscosity Solutions Approach to Shape-From-Shading
• Minimum cuts and related problems
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Fast Marching Methods
• Curvature-Driven Flows: A Variational Approach
• A Fast Parametric Maximum Flow Algorithm and Applications
• Efficient algorithms for globally optimal trajectories
• APPROXIMATION OF THE ANISOTROPIC MEAN CURVATURE FLOW
• Aspects of Total Variation RegularizedL¹Function Approximation
• An efficient algorithm for image segmentation, Markov random fields and related problems
• Signal Recovery by Proximal Forward-Backward Splitting

This page was built for publication: On total variation minimization and surface evolution using parametric maximum flows