Topological errors and optimal chamfer distance coefficients

  • Stéphane Marchand-Maillet
  • Yazid M. Sharaiha
Features
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1347)

Abstract

In this paper, a theoretical characterisation of the topological errors which arise during the approximation of Euclidean distances from discrete ones is presented. The continuous distance considered is the widely used Euclidean distance whereas we consider as discrete distance the chamfer distance based on 3 x 3 masks. The objective is to obtain formal results from which algorithms for the exact solution of the Euclidean Distance Transformation using integer arithmetic can be derived. We conclude this study by presenting a global upper bound for a topologically-correct distance mapping, irrespective of the chamfer distance coefficients, and identify the smallest coefficients associated with this bound.

Keywords

Euclidean Distance Integer Point Distance Transformation Euclidean Distance Mapping Topological Error 
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.
    G. Borgefors. Distance transformations in arbitrary dimensions. Comput. Vision, Graphics and Image Process., 27:321–345, 1984.Google Scholar
  2. 2.
    G. Borgefors. Distance transformations in digital images. Comput. Vision, Graphics and Image Process., 34:344–371, 1986.Google Scholar
  3. 3.
    S. Forchhammer. Representation and data compression of two-dimensional graphical data. PhD thesis, Technical University of Denmark, Denmark, 1988.Google Scholar
  4. 4.
    S. Forchhammer. Euclidean distances from chamfer distances for limited distances. In 6th Scandinavian Conf. on Image Analysis, pp. 393–400, Oulu, Finland, 1989.Google Scholar
  5. 5.
    C. J. Hilditch. Linear skeletons from square cupboards. In B. Meltzer and D. Mitchie, Eds, Machine Intelligence, 4:403-420. Edinburgh Univ. Press, 1969.Google Scholar
  6. 6.
    C. J. Hilditch and D. Rutovitz. Chromosome recognition. Annals of the New York Academy of Sciences, 157:339–364, 1969.Google Scholar
  7. 7.
    S. Marchand-Maillet and Y. M. Sharailia. Topologically-correct continuous to discrete distance mapping. T.R. SWP9601/OR, Imperial College, London, 1996.Google Scholar
  8. 8.
    S. Marchand-Maillet and Y. M. Sharaiha. A graph-theoretic algorithm for the exact solution of the Euclidean distance mapping. In 10th Scandinavian Conf. on Image Analysis, pp, 221–228, Lappeenranta, Finland, 1997.Google Scholar
  9. 9.
    U. Montanari. Continuous skeletons from digitized images. Journal of the ACM, 16:534–549, 1969.Google Scholar
  10. 10.
    A, Rosenfeld and J. L. Pfaltz. Distances functions on digital pictures. Pattern Recognition, 1:33–61, 1968.Google Scholar
  11. 11.
    J. Sylvester. Mathematical questions with their solutions. Educational Times, 41, 1884.Google Scholar
  12. 12.
    E. Thiel and A. Montanvert. Chamfer masks: discrete distance functions, geometrical properties and optimization. In 11th Int. Conf. on Pattern Recognition, pp. 244–247, The Hague, The Netherlands, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Stéphane Marchand-Maillet
    • 1
  • Yazid M. Sharaiha
    • 1
  1. 1.Operational Research and SystemsImperial CollegeLondonUnited Kingdom

Personalised recommendations