A New Active Convex Hull Model for Image Regions

  • Authors:
  • Nikolay M. Sirakov

  • Affiliations:
  • Department of Mathematics and Computer Science, Texas A&M University---Commerce, Commerce 75429-3011

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.