A Fast Minimization Algorithm for the Euler Elastica Model Based on a
Bilinear Decomposition
- URL: http://arxiv.org/abs/2308.13471v1
- Date: Fri, 25 Aug 2023 16:15:38 GMT
- Title: A Fast Minimization Algorithm for the Euler Elastica Model Based on a
Bilinear Decomposition
- Authors: Zhifang Liu, Baochen Sun, Xue-Cheng Tai, Qi Wang, and Huibin Chang
- Abstract summary: We propose a new, fast, hybrid alternating minimization (HALM) algorithm for the Euler Elastica (EE) model.
The HALM algorithm comprises three sub-minimization problems and each is either solved in the closed form or approximated by fast solvers.
A host of numerical experiments are conducted to show that the new algorithm produces good results with much-improved efficiency.
- Score: 5.649764770305694
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The Euler Elastica (EE) model with surface curvature can generate
artifact-free results compared with the traditional total variation
regularization model in image processing. However, strong nonlinearity and
singularity due to the curvature term in the EE model pose a great challenge
for one to design fast and stable algorithms for the EE model. In this paper,
we propose a new, fast, hybrid alternating minimization (HALM) algorithm for
the EE model based on a bilinear decomposition of the gradient of the
underlying image and prove the global convergence of the minimizing sequence
generated by the algorithm under mild conditions. The HALM algorithm comprises
three sub-minimization problems and each is either solved in the closed form or
approximated by fast solvers making the new algorithm highly accurate and
efficient. We also discuss the extension of the HALM strategy to deal with
general curvature-based variational models, especially with a Lipschitz smooth
functional of the curvature. A host of numerical experiments are conducted to
show that the new algorithm produces good results with much-improved efficiency
compared to other state-of-the-art algorithms for the EE model. As one of the
benchmarks, we show that the average running time of the HALM algorithm is at
most one-quarter of that of the fast operator-splitting-based
Deng-Glowinski-Tai algorithm.
Related papers
- SAR image segmentation algorithms based on I-divergence-TV model [0.7458485930898191]
We propose a novel variational active contour model based on I-divergence-TV model to segment Synthetic aperture radar (SAR) images with multiplicative gamma noise.
The proposed model can efficiently stop the contours at weak or blurred edges, and can automatically detect the exterior and interior boundaries of images.
arXiv Detail & Related papers (2023-12-09T04:14:46Z) - Generative Models for Anomaly Detection and Design-Space Dimensionality
Reduction in Shape Optimization [0.0]
Our work presents a novel approach to shape optimization, with the twofold objective to improve the efficiency of global algorithms and to promote the generation of high-quality designs.
This is accomplished by reducing the number of the original design variables defining a new reduced subspace where the geometrical variance is maximized.
From the numerical results, the new framework improves the convergence of global optimization algorithms, while only designs with high-quality geometrical features are generated.
arXiv Detail & Related papers (2023-08-08T04:57:58Z) - An Optimization-based Deep Equilibrium Model for Hyperspectral Image
Deconvolution with Convergence Guarantees [71.57324258813675]
We propose a novel methodology for addressing the hyperspectral image deconvolution problem.
A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network.
The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
arXiv Detail & Related papers (2023-06-10T08:25:16Z) - Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets.
We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
arXiv Detail & Related papers (2023-02-24T18:41:48Z) - Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem.
We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
arXiv Detail & Related papers (2023-02-13T19:57:17Z) - Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications.
This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
arXiv Detail & Related papers (2023-01-30T15:46:39Z) - Fast Multi-grid Methods for Minimizing Curvature Energy [6.882141405929301]
We propose fast multi-grid algorithms for minimizing mean curvature and Gaussian curvature energy functionals.
No artificial parameters are introduced in our formulation, which guarantees the robustness of the proposed algorithm.
Numerical experiments are presented on both image denoising and CT reconstruction problem to demonstrate the ability to recover image texture.
arXiv Detail & Related papers (2022-04-17T04:34:38Z) - IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method [64.15649345392822]
We introduce a framework for designing primal methods under the decentralized optimization setting where local functions are smooth and strongly convex.
Our approach consists of approximately solving a sequence of sub-problems induced by the accelerated augmented Lagrangian method.
When coupled with accelerated gradient descent, our framework yields a novel primal algorithm whose convergence rate is optimal and matched by recently derived lower bounds.
arXiv Detail & Related papers (2020-06-11T18:49:06Z) - Estimation of sparse Gaussian graphical models with hidden clustering
structure [8.258451067861932]
We propose a model to estimate the sparse Gaussian graphical models with hidden clustering structure.
We develop a symmetric Gauss-Seidel based alternating direction method of the multipliers.
Numerical experiments on both synthetic data and real data demonstrate the good performance of our model.
arXiv Detail & Related papers (2020-04-17T08:43:31Z) - Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization [71.03797261151605]
Adaptivity is an important yet under-studied property in modern optimization theory.
Our algorithm is proved to achieve the best-available convergence for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
arXiv Detail & Related papers (2020-02-13T05:42:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.