A simple fast algorithm for minimization of the elastica energy combining binary and level set representations
zbMATH Open1378.65133MaRDI QIDQ4597495FDOQ4597495
Authors: Jinming Duan, Xue-Cheng Tai 
Publication date: 13 December 2017
Full work available at URL: http://www.math.ualberta.ca/ijnam/Volume-14-2017/No-6-17/2017-06-01.pdf
Recommendations
- Survey of fast algorithms for Euler's elastica-based image segmentation
- A fast algorithm for Euler's elastica model using augmented Lagrangian method
- A fast augmented Lagrangian method for Euler's elastica models
- Interpolations with elasticae in Euclidean spaces
- A maximum-flow model for digital elastica shape optimization
image segmentationbinary level set methodimage inpaintinglevel set methodfast sweepingcorner fusionEuler's elastica energyillusory shape
Numerical optimization and variational techniques (65K10) Computational issues in computer and robotic vision (65D19)
Cited In (8)
- A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model
- A fast algorithm for Euler's elastica model using augmented Lagrangian method
- A new variational approach based on level-set function for convex hull problem with outliers
- A Three-Stage Variational Image Segmentation Framework Incorporating Intensity Inhomogeneity Information
- A New Operator Splitting Method for the Euler Elastica Model for Image Smoothing
- A novel Euler's elastica-based segmentation approach for noisy images using the progressive hedging algorithm
- Interpolations with elasticae in Euclidean spaces
- Convex object(s) characterization and segmentation using level set function
This page was built for publication: A simple fast algorithm for minimization of the elastica energy combining binary and level set representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597495)
