Skip to main content

A Really Useful Vectorization Algorithm

  • Conference paper
  • First Online:
Graphics Recognition Recent Advances (GREC 1999)

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

Included in the following conference series:

Abstract

A novel algorithm for the vectorization of binary images is described. It is based on a data structure formed by crack following the outlines of the dark region of the image and applying a heuristic to decide which edges lie along the direction of the vector at any position. The regions are divided into classes, described as strokes and junctions respectively. The idea of a junction as a region containing more than one stroke is introduced, and this is used to inform the process of vectorization in these areas. The quality of the vectors produced compares favourably with those produced by other algorithms known to the author, and the implementation is reasonably efficient, a typical A4 drawing is processed in under ten seconds on my 300 MHz Pentium lap-top.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dori, D., Liu, W.: Sparse Pixel Vectorization, An Algorithm and its Performance Evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 21 No 3 (1999) 202–215 19, 20

    Article  Google Scholar 

  2. Dori, D.: Orthogonal Zig-Zag: An Algorithm for Vectorizing Engineering Drawings Compared with Hough Transform. Advances in Software Engineering, Vol. 28 No 1 (1997) 11–24 20

    Article  Google Scholar 

  3. Elliman, D. G.: Document Recognition for Facsimile Data. Document Image Processing and Multimedia (DIPM’99), IEE Press London, March (1999) 20, 22

    Google Scholar 

  4. Booch, G., Jacobson, I., Rumbaugh, J.: The Unified Modelling Language Users Guide. Addison-Wesley Press, (1998) 24

    Google Scholar 

  5. Joseph, S. H., Pridmore, T. P.: Knowledge Directed Interpretation of Engineering Drawings. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 14 No 9 (1992) 202–215 20

    Article  Google Scholar 

  6. Kasturi, R., Bow, S. T., El-Masri, W., Shah, J., Gattiker, J. R., Mokate, U. B.: A System for Interpretation of Line Drawings. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 12 No 10 (1990) 978–992

    Article  Google Scholar 

  7. Lam, L., Lee, S., Suen, C. Y.: Thinning Methodologies-A Comprehensive Survey. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 14 No 9 (1992) 869–885 20

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elliman, D. (2000). A Really Useful Vectorization Algorithm. In: Chhabra, A.K., Dori, D. (eds) Graphics Recognition Recent Advances. GREC 1999. Lecture Notes in Computer Science, vol 1941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40953-X_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-40953-X_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41222-9

  • Online ISBN: 978-3-540-40953-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics