A simple fast algorithm for minimization of the elastica energy combining binary and level set representations
From MaRDI portal
Publication:4597495
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
Cited in
(15)- Convex object(s) characterization and segmentation using level set function
- A novel Euler's elastica-based segmentation approach for noisy images using the progressive hedging algorithm
- A maximum-flow model for digital elastica shape optimization
- A New Operator Splitting Method for the Euler Elastica Model for Image Smoothing
- An elastica-driven digital curve evolution model for image segmentation
- A new variational approach based on level-set function for convex hull problem with outliers
- A fast algorithm for Euler's elastica model using augmented Lagrangian method
- Survey of fast algorithms for Euler's elastica-based image segmentation
- Interpolations with elasticae in Euclidean spaces
- A convex, lower semicontinuous approximation of Euler's elastica energy
- A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model
- A three-stage variational image segmentation framework incorporating intensity inhomogeneity information
- Segmentation by elastica energy with \({L^1}\) and \({L^2}\) curvatures: a performance comparison
- Global minimum for a Finsler elastica minimal path approach
- A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition
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)
