Skip to main content
SpringerLink
Log in

A New Active Convex Hull Model for Image Regions

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.J. Abrantes and J.S. Marques, “A class of constrained clustering algorithms for objects boundary extraction,” IEEE Trans. on Image Processing, Vol. 5, pp. 1507–1521, 1996.

    Article  Google Scholar 

  2. F. Ansia et al., “Automatic 3D shape re-construction of bones using active nets based segmentation,” Proc. of the 15th Intl. Conf. on Pattern Recognition, Vol. 1, pp. 486–489, 2000.

  3. F. Aurenhammer, “Voronoi diagrams—A survey of a fundamental geometric data structures,” ACM Comput. Surv., Vol. 23, pp. 345–405, 1991.

    Article  Google Scholar 

  4. J. Bentley, G.M. Faust, and F. Preparata, “Approximation algorithms for convex hulls,” Comm. ACM, Vol. 25, pp. 64–68, 1982.

    Article  MathSciNet  Google Scholar 

  5. R. Burden, J.D. Faires, Numerical Analysis, 4th edition, PWS-KENT Publishing Company, US, 1993.

    MATH  Google Scholar 

  6. C. Bradford Barber, D. Dobkin, and H. Huhdanpaa, “The quickhull algorithm for convex hulls,” ACM Transactions on Mathematical Software, Vol. 22, No. 4, pp. 469–483, 1996.

    Article  Google Scholar 

  7. J. Boardman, “Automating spectral unmixing of AVIRIS data using convex geometry concepts,” in 4th JPL Airborne Geoscience Workshop (Washington, D.C.). JPL, Pasadena, Calif. 1993.

  8. H. Bronnimann, J. Iacono, J. Katajainen, P. Morin, J. Morrison, and G. T. Toussaint, “Space-efficient planar convex hull algorithms,” Theoretical Computer Science, 2003, in Press. http://cgm.cs.mcgill.ca/godfried/publications/insitu.pdf

  9. T. Chan, “Optimal output-sensitive convex hull algorithm in two and three dimensiions,” Discrete and Computational Geometry, Vol. 18, pp. 433–454, 1996.

    Google Scholar 

  10. Y. Chan and S.Y. Kung, “A hierarchical algorithm for image retrieval by sketch,” IEEE Workshop on Multimedia Signal Processing, pp. 564–569, 1997.

  11. T.F. Chan, J. Shen, and L. Vese, “Variational PDE models in image processing,” Notices of the American Math Society, Vol. 50-1, pp. 14–26, 2003.

  12. V. Caselles, R. Kimmel, and G. Sapiro, “Geodesic active contours,” International Journal of Computer Vision, Vol. 22-1, pp. 61–79, 1997.

  13. V. Caselles, F. Catte, T. Coll, and F. Dibos, “A geodesic model for active contours,” Numerishe Mathematik, Vol. 66, pp. 1–33, 1993.

    Article  MathSciNet  Google Scholar 

  14. K. Clarkson and P. Shor, “Applications of random sampling in computational geometry,” Discr. Comput. Geom, Vol. 4, pp. 387–421, 1989.

    Article  MathSciNet  Google Scholar 

  15. L.D. Cohen and I. Cohen, “Finite element methods for active contour models and balloons for 2D and 3D images,” IEEE Trans. Pattern Anallysis Macine Intell., Vol. 15, pp. 1131–1147, 1993.

    Article  Google Scholar 

  16. C. Davatzikos and J.L. Prince, “An active contour model foor mapping the cortex,” IEEE Trans. Med. Imaging, Vol. 14, pp. 65–80, 1995.

    Article  Google Scholar 

  17. R.L. Graham, “An efficient algorithm for determining the convex hull of a finite planar set,” Info. Proc. Lett., Vol. 1, pp. 132–133, 1972.

    Article  Google Scholar 

  18. “http://forums.wolfram.com/mathgroup/archive/2005/Mar/msg00799.html,”

  19. R. Jain, “World-Wide Maze,” IEEE Multimedia, Vol. 2–3, 1995.

  20. S. Kichenassamy, A. Kumar, P. Olver, A. Tannenbaum, and A. Yezzi, “Gradient vector flows and geometric active contour models,” ICCV 1995, pp. 810–815.

  21. B.B. Kimia, A. Tannenbaum, and S.W. Zucker, “Shapes, shocks and deformations,” Int. J of Computer Vision, Vol. 15, pp. 189–224, 1995.

    Article  Google Scholar 

  22. R. Kimmel and G. Sapiro, “Shortening three-dimensional curves via two-dimensional flows,” Int. J of Computers and Mathematics with Applications, Vol. 29, pp. 49–62, 1995.

    Article  MathSciNet  Google Scholar 

  23. D.G. Kirkpatrick and R. Siebel, “The ultimate planar convex hull algorithm?,” SIAM Journal of Computing, Vol. 15, No. 1, pp. 287–299, 1986.

    Article  Google Scholar 

  24. J. Lisani et al., “Affine Invariant mathematical morphology applied to a generic shape recognition algorithm,” Mathematical Morphology and its App. to Image and Signal Processing, J. Goutsias, L. Vincent, D.S. Bloomberg (Eds.), Kluwer Pub. 2000, pp. 91–98.

  25. F. Mlsna and N.M. Sirakov, “An intelligent shape features extraction and indexing system for fast medical image retrieval,” IEEE Comp. Society, US, pp. 172–176, 2004. ISBN:0-7803-8387-7.

  26. J. ORourke, Computational Geometry in C, Cambridge University Press, US, 1998.

    Google Scholar 

  27. N.M. Sirakov and P. Mlsna, “Search space partitioning using convex hull and concavity features for fast medical image retrieval,” IEEE ISBI’04, April 15–18 2004, Arlington, pp. 796–799, 2004.

  28. N.M. Sirakov and I. Simonelli, A New Automatic Concavities Extraction Model, Published by IEEE, Computer Society, 2006, USA, pp. 178–182. ISBN: 1-4244-0069-4, Library of Congress N: 2005937121.

  29. G. Shapiro, Geometric Partial Differential Equation and Image Processing, Cambridge Univ. Press, 2001.

  30. J.A. Sethian, “A review of recent numerical algorithms for hypersurfaces moving with curvature dependent flows,” J. Differential Geometry, Vol. 31, pp. 131–161, 1989.

    MathSciNet  Google Scholar 

  31. D. Sunday, http://geometryalgorithms.com/Archive/al-gorithm_0109/algorithm_0109.htm 2001.

  32. C. Xu and J.L. Prince, “Snakes, shaps and gradient vector flow,” IEEE Transaction on Image Processing, Vol. 7, No. 3, pp. 359–369, 1998.

    Article  MathSciNet  Google Scholar 

  33. L.A. Vese and T.F. Chan, “A multiphase level set framework for image segmentation using the mumford and shah model,” International Journal of Computer Vision, Vol. 50, No. 3, pp. 271–293, 2002.

    Article  Google Scholar 

  34. G. Zamora, H. Sari-Sarraf, and S. Mitra, “Estimation of orientation of cervical vertebrae for segmentation with active shape models,” Proc. SPIE Medical Imaging: Image Proc., San Diego, CA, Feb. 17–23, 2001.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Texas A&M University–Commerce, P.O. Box. 3011, Commerce, TX, 75429-3011

    Nikolay M. Sirakov

Authors
  1. Nikolay M. Sirakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nikolay M. Sirakov.

Additional information

Nikolay M. Sirakov received B.S. degree from School of Mathematics and Informatics-Sofia University in 1982, M.S. degree from the same University in the field of Coding Theory in 1983, and Ph.D. degree from Institute of Mechanics-Bulgarian Academy of Sciences in the field of 3D modeling and recognition in 1991.

He had research and teaching positions at the Institute of Mechanics (1984–2000—Associate Professor since 1999), International Lab of Artificial Intelligence-Slovak Academy of Sciences (1990), Instituto Superior Technico–CVRM-Portugal (1993, 1998–2000), and Northern Arizona University (2001–2004). Currently Dr. Sirakov is an Assistant Professor of Mathematics and Computer Science at Texas A&M University Commerce. His research interests fall in Active Contours/Surfaces Models to image segmentation and features extraction, 3D reconstruction and visualization, 2D/3D objects matching and classification, Image Processing and Analysis, and Content Based Image Retrieval. He published over seventy papers and was a co-author of two books in the above listed fields.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sirakov, N.M. A New Active Convex Hull Model for Image Regions. J Math Imaging Vis 26, 309–325 (2006). https://doi.org/10.1007/s10851-006-9004-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-006-9004-6

Keywords

Search

Navigation