The ultimate planar convex hull algorithm
SIAM Journal on Computing
Numerical analysis: 4th ed
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
International Journal of Computer Vision
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
International Journal of Computer Vision
Approximation algorithms for convex hulls
Communications of the ACM
Computational Geometry in C
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
International Journal of Computer Vision
IEEE MultiMedia
Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Gradient flows and geometric active contour models
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Automatic 3D Shape Reconstruction of Bones Using Active Nets Based Segmentation
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 1
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Geometric Partial Differential Equations and Image Analysis
Geometric Partial Differential Equations and Image Analysis
A class of constrained clustering algorithms for object boundary extraction
IEEE Transactions on Image Processing
Snakes, shapes, and gradient vector flow
IEEE Transactions on Image Processing
An Integral Active Contour Model for Convex Hull and Boundary Extraction
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
Harris function based active contour external force for image segmentation
Pattern Recognition Letters
AUTOMATIC OBJECT IDENTIFICATION USING VISUAL LOW LEVEL FEATURE EXTRACTION AND ONTOLOGICAL KNOWLEDGE
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
This paper presents a new active convex hull model with the following advantages: invariant with respect to the number of pixels to be enveloped; the number of time iterations is invariant, with respect to the image size; time-cheap for large image regions. The model is based on the geometric heat differential equations, derived from parabolic equation, and parameterized by arc length. To prevent the active contour from intruding into concavities and evolve it to the proper convex hull we use a vector field given as a difference between normal and tangent forces. The vector field is also used to segment an image to shells, such that a single region is present in each shell. A penalty function is developed to stop evolvement of those arc segments, whose vectors encountered boundary points of an image region. Based on the model a discrete algorithm is designed and coded by Mathematica 5.2. A condition is developed, with respect to the image size, to guarantee stable convergence of the active contour to the convex hull of the desired region. To validate the advantages and contributions a set of experiments is performed using synthetic, groundwater and medical images of different size and modalities. The paper concludes with a discussion and comparison of the active convex hull model with set of existing convex hull algorithms.