Variational image regularization with Euler's elastica using a discrete gradient scheme
From MaRDI portal
Abstract: This paper concerns an optimization algorithm for unconstrained non-convex problems where the objective function has sparse connections between the unknowns. The algorithm is based on applying a dissipation preserving numerical integrator, the Itoh--Abe discrete gradient scheme, to the gradient flow of an objective function, guaranteeing energy decrease regardless of step size. We introduce the algorithm, prove a convergence rate estimate for non-convex problems with Lipschitz continuous gradients, and show an improved convergence rate if the objective function has sparse connections between unknowns. The algorithm is presented in serial and parallel versions. Numerical tests show its use in Euler's elastica regularized imaging problems and its convergence rate and compare the execution time of the method to that of the iPiano algorithm and the gradient descent and Heavy-ball algorithms.
Recommendations
- A fast algorithm for Euler's elastica model using augmented Lagrangian method
- iPiano: inertial proximal algorithm for nonconvex optimization
- Discrete gradient methods for solving variational image regularisation models
- Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
- Bregman Itoh-Abe methods for sparse optimisation
Cites work
- A convex, lower semicontinuous approximation of Euler's elastica energy
- A fast algorithm for Euler's elastica model using augmented Lagrangian method
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A geometric integration approach to nonsmooth, nonconvex optimisation
- An algorithm with guaranteed convergence for finding a zero of a function
- Augmented Lagrangian method for a mean curvature based image denoising model
- Augmented Lagrangian method for an Euler's elastica based segmentation model that promotes convex contours
- Convergence Conditions for Ascent Methods
- Coordinate descent algorithms
- Discrete gradient methods for solving variational image regularisation models
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Energy-diminishing integration of gradient systems
- Euler's Elastica and Curvature-Based Inpainting
- Fast linearized augmented Lagrangian method for Euler's elastica model
- Filtering, segmentation and depth
- Geometric integration using discrete gradients
- Gradient methods for minimizing composite functions
- Hamiltonian-conserving discrete canonical equations based on variational difference quotients
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- iPiano: inertial proximal algorithm for nonconvex optimization
- New Parallel SOR Method by Domain Partitioning
- Nonlinear total variation based noise removal algorithms
- Numerical recipes. The art of scientific computing.
- On the convergence of block coordinate descent type methods
- On Upstream Differencing and Godunov-Type Schemes for Hyperbolic Conservation Laws
- Preserving first integrals with symmetric Lie group methods
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Some methods of speeding up the convergence of iteration methods
- Time integration and discrete Hamiltonian systems
- Total roto-translational variation
Cited in
(20)- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient
- A geometric integration approach to nonsmooth, nonconvex optimisation
- Adaptive SOR methods based on the Wolfe conditions
- Bregman Itoh-Abe methods for sparse optimisation
- Adaptive image restoration via a relaxed regularization of mean curvature
- Dissipative numerical schemes on Riemannian manifolds with applications to gradient flows
- Proximal ADMM for Euler's Elastica Based Image Decomposition Model
- A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model
- A New Operator Splitting Method for the Euler Elastica Model for Image Smoothing
- Existence results on Lagrange multiplier approach for gradient flows and application to optimization
- A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition
- Discrete gradients in short-range molecular dynamics simulations
- Image inpainting via modified exemplar-based inpainting with two-stage structure tensor and image sparse representation
- Bregman methods for large-scale optimization with applications in imaging
- Navigating the complex landscape of shock filter Cahn-Hilliard equation: from regularized to entropy solutions
- Adaptive projected SOR algorithms for nonnegative quadratic programming
- An approximated L₁ curvature-based method for implicit surface reconstruction from point cloud
- A geometric integration approach to smooth optimization: foundations of the discrete gradient method
- Euler's elastica and curvature based nonlinear mesh denoising method
- Enhancing image inpainting with deep learning segmentation and exemplar-based inpainting
This page was built for publication: Variational image regularization with Euler's elastica using a discrete gradient scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236622)
