cs.CVOct 28, 2026

A New Formulation of the Elastica Model with Application to Image Inpainting

Authors: Zuoqiang Shi, Xue-Cheng Tai

Organizations: Yanqi Lake Beijing Institute of Mathematical Sciences and Applications, Beijing 101408, China · NORCE Norwegian Research Centre, Nygårdsgaten 112, 5008 Bergen, Norway

Abstract

Curves and interfaces play a central role in computer vision and image processing, and Euler's elastica energy is one of the most successful tools to model and manipulate them. The elastica energy is usually computed through a level-set or a phase field representation of the curve, in which the curvature term makes the energy nonlinear, non-convex and, in the level-set case, non-differentiable, so that its minimization is notoriously difficult. In this paper, we propose a new formulation of the elastica model based on a binary representation of curves. The key ingredient is a very simple formula for the curvature: if φφ is the ±1\pm1 binary function associated with a curve ΓΓ, then along ΓΓ the curvature is given by −1C0ε(Rε∗φ)+O(ε)-\frac{1}{C_0ε}\left(R_ε*φ\right)+O(ε), where RεR_ε is a radial kernel supported in a ball of radius εε and C0C_0 is an explicit constant. No derivative of φφ is involved and the convolution is evaluated by FFT. The resulting energy is a weighted total variation, so that formally the new formulation is a generalization of the well-known ROF model; a phase field type model is obtained from the same curvature formula. Combining FFT with the split Bregman iteration, which for the present problem coincides with an augmented Lagrangian method (ALM), we obtain efficient algorithms whose subproblems are either linear systems solved by conjugate gradient or explicit pointwise formulas. Numerical experiments on the inpainting of binary images are presented to demonstrate the effectiveness of the proposed algorithms.

Figures & tables

Explore similar work

Jul 21, 2026

Image Editing Models are Numerical Solvers

We investigate whether a pretrained generative image-editing model can provide a common interface for numerical simulation. Physical inputs and solutions are rendered as images, while scalar quantities such as material properties, diffusivity, and loading parameters enter through lightweight adapters. Using established numerical and analytic solvers for supervision, we apply the same architecture and training protocol to heterogeneous elliptic equations, forced heat and Burgers evolution, complex Ginzburg-Landau dynamics, two-dimensional Navier-Stokes prediction, potential flow, elasticity, eikonal travel time, phase-field fracture, and entropic optimal transport. The results show that a pretrained image model can represent diverse static and time-dependent physical mappings, including unstable and shock-like behavior, when each task is expressed through a suitable visual encoding. This work is a capability study rather than an attempt to surpass specialized solvers. It also identifies fundamental constraints: image and latent representations complicate numerical range selection and direct enforcement of governing equations or invariants, while a failed Kuramoto-Sivashinsky experiment indicates that representation errors prevent meaningful long-horizon simulation of chaotic systems.
Oct 5, 2025

Adaptive double-phase Rudin--Osher--Fatemi denoising model

Even though more than 30 years have passed since the seminal Rudin--Osher--Fatemi (ROF) paper on total variation (TV) denoising, it remains relevant due to its simplicity, robustness and interpretability. However, it is known to suffer from artifacts such as the staircasing effect. Many variants of the model have been proposed with the aim of countering this. Recently, against the backdrop of immense research output on double-phase problems in the mathematical analysis community, a double-phase type integral functional, comprising of TV and a weighted term of quadratic growth, was suggested as a regularizer for image restoration. Here, we propose an adaptive variant of the ROF denoising model based on that regularizer. Variable growth of the double-phase functional allows for qualitatively different behavior at image contours, which are captured by an initial ROF reconstruction step. The model is designed to reduce staircasing with respect to the classical ROF model, while preserving the edges of the image in a similar fashion. We derive a closed-form resolvent formula and adapt the primal-dual Chambolle--Pock scheme for the numerical solution of the model. We also propose a practical noise-dependent parameter prescription and evaluate its performance on synthetic and natural images over a range of noise levels. Compared to established models with similar interpretability, we observe an improved or similar performance in terms of similarity metrics SSIM, PSNR, and LPIPS, while the staircasing effect is visibly reduced.
Dec 19, 2023

Active contours driven by local and global intensity fitting energy with application to SAR image segmentation and its fast solvers

In this paper, we propose a novel variational active contour model based on Aubert-Aujol (AA) denoising model, which hybrides geodesic active contour (GAC) model with active contours without edges (ACWE) model and can be used to segment images corrupted by multiplicative gamma noise. We transform the proposed model into classic ROF model by adding a proximity term.[26] was submitted on 29-Aug-2013, and our early edition was ever submitted to TGRS on 12-Jun-2012, Venkatakrishnan et al.[27] proposed their PnP algorithm on 29-May-2013, so Venkatakrishnan and we proposed the PnP algorithm almost simultaneously. Inspired by a fast denosing algorithm proposed by Jia-Zhao recently, we propose two fast fixed point algorithms to solve SAR image segmentation question.