Skip to main content
SpringerLink
Log in

Shape of an arbitrary finite point set in IR2

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

Abstract

We study the shape of a finite point set in IR2, where the points are not bound to a regular grid like ℤ2. The shape of a connected point set in IR2 is captured by its boundary. For a finite point set the boundary is a directed graph that connects points identified as boundary points. We argue that to serve as a proper boundary definition the directed graph should regulate scale, be minimal, have an increasing interior and be consistent with the boundary definition of connected objects.

We propose to use the directed variant of theα-shape as defined by Edelsbrunner et al (1983), which we call theα-graph. Theα-graph is based on a generalization of the convex hull.

The computational aspects of theα-graph have been extensively studied, but little attention has been paid to the potential use of theα-graph as a shape descriptor or a boundary definition. In this paper we prove that theα-graph satisfies the aforementioned criteria. We also prove a relation between theα-graph and the opening scale space from mathematical morphology. In fact, theα-hull provides a generalization of this scale space.

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. H. Asada and M. Brady, “The curvature primal sketch,”IEEE Trans. Patt. Anal. Mach. Intell. vol. PAMI-8, pp. 2–14, 1986.

    Google Scholar 

  2. M. Chen and P. Yan, “A multiscaling approach based on morphological filtering,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-11, pp. 694–700, 1989.

    Google Scholar 

  3. H. Edlesbrunner,Algorithms in Combinatorial Geometry Springer-Verlag: Berlin, 1987.

    Google Scholar 

  4. H. Edelsbrunner, D.G. Kirkpatrick, and R. Seidel, “On the shape of a set of points in the plane,”IEEE Trans. Inf. Theory, vol. IT-29, pp. 551–559, 1983.

    Google Scholar 

  5. R.M. Haralick, S.R. Sternberg, and X. Zhuang, “Image analysis using mathematical morphology,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-9, pp. 532–550, 1987.

    Google Scholar 

  6. D.G. Kirkpatrick and J.D. Radke, “A framework for computational morphology,” inComputational Geometry, G.T. Toussaint, ed.,Machine Intelligence and Pattern Recognition, vol. 2, North-Holland: Amsterdam, 1985, pp. 217–248.

    Google Scholar 

  7. J.J. Koenderink, “The structure of images,”Biol. Cybernet. vol. 50, pp. 363–370, 1984.

    Google Scholar 

  8. P. Maragos, “Tutorial on advances in morphological image processing and analysis,”Opt. Eng., vol. 26, pp. 623–632, 1987.

    Google Scholar 

  9. V. Medek, “On the boundary of a finite set of points in the plane,”Comput. Graph. and Image Process, vol. 15, pp. 93–99, 1981.

    Google Scholar 

  10. F. Mokhtarian and A. Mackworth, “Scale-based description and recognition of planar curves and two-dimensional shapes,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-8, pp. 34–43, 1986.

    Google Scholar 

  11. F.P. Preparata and M.I. Shamos,Computational Geometry, an Introduction, Springer-Verlag: Berlin, 1985.

    Google Scholar 

  12. J.D. Radke, “On the shape of a set of points,” inComputational Morphology, G.T. Toussaint, ed.,Machine Intelligence and Pattern Recognition vol. 6, North-Holland: Amsterdam, 1988, pp. 229–260.

    Google Scholar 

  13. C. Ronse, “A Bibliography on digital and computational convexity,”IEEE Trans. Patt. Anal. Mach. Intell., vol. PAMI-11, pp. 181–190, 1989.

    Google Scholar 

  14. J. Serra,Image Analysis and Mathematical Morphology, Academic Press: San Diego, CA, 1982.

    Google Scholar 

  15. A.W.M. Smeulders and M. Worring, “Accurate measurement of shape at low resolution,” inPattern Recognition and Artificial Intelligence, L.N. Kanal and E.S. Gelsema, eds.Machine Intelligence and Pattern Recognition, vol. 7, North-Holland: Amsterdam: 1988, pp. 91–102.

    Google Scholar 

  16. P.W. Verbeeck and F.C.A. Groen, “Convex pseudo-hull algorithm for two and more dimensions,” inProc. of the 2nd Scandinavian Conference on Image Analysis, Helsinki, Finland, 1981, pp. 29–34.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Marcel Worring & Arnold W. M. Smeulders

Authors
  1. Marcel Worring
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnold W. M. Smeulders
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Dutch Ministry of Economic Affairs through SPIN grants “3D Computer Vision” and “3D Image Analysis.”

Rights and permissions

Reprints and permissions

About this article

Cite this article

Worring, M., Smeulders, A.W.M. Shape of an arbitrary finite point set in IR2 . J Math Imaging Vis 4, 151–170 (1994). https://doi.org/10.1007/BF01249894

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01249894

Key words

Search

Navigation