Skip to main content

Comparing convex shapes using Minkowski addition

  • Shape
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1296))

Included in the following conference series:

  • 174 Accesses

Abstract

This report deals with similarity measures for convex shapes whose definition is based on Minkowski addition and the Brunn-Minkowski inequality. All measures considered here are invariant under translations. In addition, they may be invariant under rotations, multiplications, reflections, or affine transformations. Restricting oneselves to the class of convex polygons, it is possible to develop efficient algorithms for the computation of such similarity measures. These algorithms use a special representation of convex polygons known as the perimetric measure. Such representations are unique for convex sets and linear with respect to Minkowski addition. Although the paper deals exclusively with the 2-dimensional case, many of the results carry over almost immediately to higher-dimensional spaces.

A. Tuzikov was supported by the Netherlands Organization for Scientific Research (NWO) through a visitor's grant.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. L. Allgower and P. H. Schmidt. Computing volumes of polyhedra. Mathematics of Computation, 46:171–174, 1986.

    Google Scholar 

  2. E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, and J. S. B. Mitchell. An efficiently computable metric for comparing polygonal shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:209–216, 1991.

    Article  Google Scholar 

  3. D. Ballard and C. Brown. Computer Vision. Prentice-Hall, Englewood Cliffs, 1982.

    Google Scholar 

  4. P. K. Ghosh. A unified computational framework for Minkowski operations. Computers and Graphics, 17:357–378, 1993.

    Article  Google Scholar 

  5. H. Goldstein. Classical Mechanics. Addison-Wesley, Reading, MA, 1950.

    Google Scholar 

  6. B. Griinbaum. Convex Polytopes. Interscience Publishers, 1967.

    Google Scholar 

  7. H. J. A. M. Heijmans and A. Tuzikov. Similarity and symmetry measures for convex sets based on Minkowski addition. Research report BS-119610, CWI, 1996.

    Google Scholar 

  8. J. Hong and X. Tan. Recognize the similarity between shapes under afine transformation. In Proc. Second Int. Conf. Computer Vision, pages 489–493. IEEE Comput. Soc. Press, 1988.

    Google Scholar 

  9. B. K. P. Horn. Robot Vision. MIT Press, Cambridge, 1986.

    Google Scholar 

  10. G. Matheron and J. Serra. Convexity and symmetry: Part 2. In J. Serra, editor, Image Analysis and Mathematical Morphology, vol. 2: Theoretical Advances, pages 359–375, London, 1988. Academic Press.

    Google Scholar 

  11. A. Rosenfeld and A. C. Kak. Digital Picture Processing. Academic Press, Orlando, 2nd edition, 1982.

    Google Scholar 

  12. R. Schneider. Convex Bodies. The Brunn-Minkowski Theory. Cambridge University Press, Cambridge, 1993.

    Google Scholar 

  13. P. J. van Otterloo. A Contour-Oriented Approach to Digital Shape Analysis. PhD thesis, Delft University of Technology, Delft, The Netherlands, 1988.

    Google Scholar 

  14. M. Werman and D. Weinshall. Similarity and affine invariant distances between 2D point sets. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17:810–814, 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerald Sommer Kostas Daniilidis Josef Pauli

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tuzikov, A., Heijmans, H.J.A.M. (1997). Comparing convex shapes using Minkowski addition. In: Sommer, G., Daniilidis, K., Pauli, J. (eds) Computer Analysis of Images and Patterns. CAIP 1997. Lecture Notes in Computer Science, vol 1296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63460-6_110

Download citation

  • DOI: https://doi.org/10.1007/3-540-63460-6_110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63460-7

  • Online ISBN: 978-3-540-69556-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics