Skip to main content
SpringerLink
Log in

Segmentation of Digital Arcs

  • Conference paper
Robotics and Artificial Intelligence

Part of the book series: NATO ASI Series ((NATO ASI F,volume 11))

  • 575 Accesses

Abstract

In pattern recognition and scene analysis, there are many occasions when we want to determine whether a digital arc is straight or not. For many applications such as the production of cartographic data bases, waveform analysis and perimeter estimation, it is preferable to access the curve as a set of connected straight lines or a polygonal line. Simple schemes for converting the digital curve into this form are useful.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Rosenfeld, A., Digital Straight Line Segments, IEEE Trans, on Computer, Vol C-23, No. 12, Dec. 1974, pp1264–1269.

    MathSciNet  Google Scholar 

  2. Hung, S. H. Y. and Kasvand, T., Critical Points On A Perfectly 8- or 6-Connected Thin Binary Line, J. of Pattern Recognition, Vol.16 No.3, 1983, pp297–306.

    Article  Google Scholar 

  3. Freeman, H., On the Encoding of Arbitrary Geometric Configuration, IRE Trans, on Electronic Computers, June 1961, pp260–268.

    Google Scholar 

  4. Wu, Li-De, On The Freeman’s Conjecture About the Chain Code of a Line, Proceedings of 5th International Conference on Pattern Recognition, pp32–34.

    Google Scholar 

  5. Hung, S. H. Y. and Kasvand, T., On the Chord Property and Its Application. To appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research Council of Canada, Ottawa, Ontario, Canada, K1A 0R8

    S. H. Y. Hung & T. Kasvand

Authors
  1. S. H. Y. Hung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Kasvand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

    Michael Brady (Senior Research Scientist) (Senior Research Scientist)

  2. Electrical, Computer, and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, New York, USA

    Lester A. Gerhardt (Chairman and Professor) (Chairman and Professor)

  3. Department of the Army, Washington, D.C., USA

    Harold F. Davidson (Consultant) (Consultant)

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hung, S.H.Y., Kasvand, T. (1984). Segmentation of Digital Arcs. In: Brady, M., Gerhardt, L.A., Davidson, H.F. (eds) Robotics and Artificial Intelligence. NATO ASI Series, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82153-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82153-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82155-4

  • Online ISBN: 978-3-642-82153-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation