Convex cardinal shape composition
Chan-Vese modelcompressive sensinggeometric packingimage segmentationMumford-Shah functionaloptical character recognitionshape-based modelingsparse recovery
Variational problems in a geometric measure-theoretic setting (49Q20) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Convex programming (90C25)
- Sparse shape reconstruction
- 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
- scientific article; zbMATH DE number 6025169
- Sparse template-based variational image segmentation
- A Convex Approach to Minimal Partitions
- A geometric approach to joint inversion with applications to contaminant source zone characterization
- A mathematical introduction to compressive sensing
- A multiphase dynamic labeling model for variational recognition-driven image segmentation
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Active contours without edges
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Completely convex formulation of the Chan-Vese image segmentation model
- Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification
- Geometric Level Set Methods in Imaging, Vision, and Graphics
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2115040 (Why is no real title available?)
- Level set methods: An overview and some recent results
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Optimal approximations by piecewise smooth functions and associated variational problems
- Optimal packing and covering in the plane are NP-complete
- Packing problems
- Parametric level set methods for inverse problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Simple bounds for recovering low-complexity models
- Sparse shape reconstruction
- Uniqueness of solution in linear programming
- Using prior shapes in geometric active contours in a variational framework
This page was built for publication: Convex cardinal shape composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797765)