Advertisement

An Approximation of the Maximal Inscribed Convex Set of a Digital Object

  • Gunilla Borgefors
  • Robin Strand
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3617)

Abstract

In several application projects we have discovered the need of computing the maximal inscribed convex set of a digital shape. Here we present an algorithm for computing a reasonable approximation of this set, that can be used in both 2D and 3D. The main idea is to iteratively identify the deepest concavity and then remove it by cutting off as little as possible of the shape. We show results using both synthetic and real examples.

Keywords

Convex Hull Local Operation Large Neighbourhood Object Element Distance Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Preparata, F.P., Shamos, M.I.: Computational Geometry an Introduction. Springer, New York (1985)Google Scholar
  2. 2.
    Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)CrossRefGoogle Scholar
  3. 3.
    Borgefors, G.: On digital distance transforms in three dimensions. Computer Vision and Image Understanding 64, 368–376 (1996)CrossRefGoogle Scholar
  4. 4.
    Chassery, J.M., Coeurjolly, D.: Optimal shape and inclusion. In: Ronse, C., Najman, L., Decencière, E. (eds.) Mathematical Morphology: 40 Years On. Computational Imaging and Vision, pp. 229–248. Springer, Dordrecht (2005)CrossRefGoogle Scholar
  5. 5.
    Chassery, J.M.: Discrete and computational geometry approaches applied to a problem of figure approximation. In: Pietikäinen, M., Röning, J. (eds.) Proc. 6th Scandinavian Conference on Image Analysis, Oulo, Finland, pp. 856–859 (1989)Google Scholar
  6. 6.
    Chang, J.S., Yap, C.K.: A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry 1, 155–182 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Sintorn, I.M.: Segmentations methods and shape descriptions in digital images – applications in 2D and 3D microscopy. PhD thesis, Swedish University of Agricultural Sciences (2005)Google Scholar
  8. 8.
    Borgefors, G., Sanniti di Baja, G.: Analyzing nonconvex 2D and 3D patterns. Computer Vision and Image Understanding 63, 145–157 (1996)CrossRefGoogle Scholar
  9. 9.
    Piper, J., Granum, E.: Computing distance transformations in convex and non-convex domains. Pattern Recognition 20, 599–615 (1987)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Gunilla Borgefors
    • 1
  • Robin Strand
    • 2
  1. 1.Centre for Image AnalysisSwedish University of Agricultural Sciences 
  2. 2.Centre for Image AnalysisUppsala UniversityUppsalaSweden

Personalised recommendations