Convex object(s) characterization and segmentation using level set function
From MaRDI portal
Publication:2127274
Recommendations
- A new binary representation method for shape convexity and application to image segmentation
- A level set representation method for N-dimensional convex shape and applications
- Image segmentation with partial convexity shape prior using discrete conformality structures
- Topology- and convexity-preserving image segmentation based on image registration
- Convex non-convex segmentation over surfaces
Cites work
- A fast algorithm for Euler's elastica model using augmented Lagrangian method
- A fast marching level set method for monotonically advancing fronts.
- A fast sweeping method for Eikonal equations
- A simple fast algorithm for minimization of the elastica energy combining binary and level set representations
- Active contours without edges
- An algorithm for total variation minimization and applications
- An effective region force for some variational models for learning and clustering
- Augmented Lagrangian method for an Euler's elastica based segmentation model that promotes convex contours
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Convexity Shape Prior for Level Set-Based Image Segmentation Method
- Curvature formulas for implicit curves and surfaces
- Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Geodesic active contours
- scientific article; zbMATH DE number 2062545 (Why is no real title available?)
- scientific article; zbMATH DE number 2090807 (Why is no real title available?)
- Image segmentation using Euler's elastica as the regularization
- New region force for variational models in image segmentation and high dimensional data clustering
- On an inequality of C. Sundberg: a computational investigation via nonlinear programming
- Optimal approximations by piecewise smooth functions and associated variational problems
- Segmentation of Overlapping Elliptical Objects in Silhouette Images
- Segmentation under Occlusions Using Selective Shape Prior
- The Convexity of a Domain and the Superharmonicity of the Signed Distance Function
- The Discrete Cosine Transform
Cited in
(6)- The largest convex patches: A boundary-based method for obtaining object parts
- A binary characterization method for shape convexity and applications
- Superiorized iteration algorithm for CT image simultaneous reconstruction and segmentation
- An effective level set method with molecular beam epitaxy regularization for color-texture image segmentation
- A registration-based star-shape segmentation model and fast algorithms
- Re-initialization-free level set method via molecular beam epitaxy equation regularization for image segmentation
This page was built for publication: Convex object(s) characterization and segmentation using level set function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127274)
