A new active convex hull model for image regions
From MaRDI portal
Publication:2384092
DOI10.1007/s10851-006-9004-6zbMath1478.94085MaRDI QIDQ2384092
Publication date: 20 September 2007
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-006-9004-6
35K05: Heat equation
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
68T45: Machine vision and scene understanding
Related Items
Uses Software
Cites Work
- Space-efficient planar convex hull algorithms
- A geometric model for active contours in image processing
- Shortening three-dimensional curves via two-dimensional flows
- Geodesic active contours
- Applications of random sampling in computational geometry. II
- A multiphase level set framework for image segmentation using the Mumford and Shah model
- An efficient algorithm for determining the convex hull of a finite planar set
- The Ultimate Planar Convex Hull Algorithm?
- Approximation algorithms for convex hulls
- The quickhull algorithm for convex hulls
- Snakes, shapes, and gradient vector flow
- Unnamed Item
- Unnamed Item
- Unnamed Item