Skip to main content

The distance transform for line patterns: Generalisation and development

  • Conference paper
  • First Online:
  • 123 Accesses

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

Abstract

The notion of a generalised Distance Transform for Line Patterns (DTLP) is introduced. The Generalised DTLP models distance transforms on line data as the application of a combination function to values derived from the lengths of a set of paths to feature points from the pixel of interest. Previous distance transforms for line patterns are assessed within the proposed framework. An algorithm computing a subset of the transformations defined by the general form is presented and discussed. Transforms based upon a variety of combination functions and distance-related values have been implemented; sample results are given.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Toriwaki, J., N. Kato and T. Fukumura, Parallel local operations for a new distance transformation of a line pattern and their applications, IEEE Trans. Systems, Man and Cybernetics, 9, 10, pp 628–643, 1979.

    Google Scholar 

  2. Ragnemalm, I. and S. Ablameyko, On the distance transform of line patterns, Proceedings of the 8th SCIA, Thomso, Norway, pp 1357–1363, 1993.

    Google Scholar 

  3. Joseph, S.H. and T.P Pridmore, Knowledge-directed interpretation of mechanical engineering drawings, IEEE Trans. PAMI, 14, pp 928–940, 1992.

    Google Scholar 

  4. Pridmore T. and S. Ablameyko, Generalised distance transform for line patterns, Submitted to Pattern Recognition, 1995.

    Google Scholar 

  5. Ablameyko, S., C. Arcelli and G. Sanniti di Baja, Finding and ranking basic structures on complex line patterns, Proceedings of the Structural and Syntactic Pattern Recognition Workshop, Israel, 1994.

    Google Scholar 

  6. Arcelli, C., and G. Sanniti di Baja, An approach to figure decomposition using width information, Computer Vision, Graphics and Image Processing, 26, pp 62–71, 1984.

    Google Scholar 

  7. Sanniti di Baja, Well-shaped, stable and reversible skeletons, Journal of Visual Communication and Image Representation, 5, pp 107–115, 1994.

    Google Scholar 

  8. Ablameyko, S., V. Bereishik, N. Paramonova, A. Marcelli, S. Ishikawa and K. Kato, Vectorisation and representation of large-size 2D line drawing images, Journal of Visual Communication and Image Representation, 5, pp 245–254, 1994.

    Google Scholar 

  9. Suzuki, S., Graph-based vectorization method for line patterns, in Proceedings IEEE Conference on Computer Vision and Pattern Recognition, Ann Arbor, Michigan, pp 616–621, 1988.

    Google Scholar 

  10. Pavlidis, T., A vectorizer and feature extractor for document recognition, Computer Vision, Graphics and Image Processing, 35, pp 111–127, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pridmore, T.P., Ablameyko, S.V. (1995). The distance transform for line patterns: Generalisation and development. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_307

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_307

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60268-2

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics