Skip to main content

Fast Smoothing of Digital Curves

  • Conference paper
Mustererkennung 1985

Part of the book series: Informatik Fachberichte ((INFORMATIK,volume 107))

  • 80 Accesses

Abstract

This paper presents ideas to remove noises from digitized curves, i.e. to smooth digital curves. It will be given an exact definition of curve smoothing. A curve smoothing in this sense can be useful as a possible preprocessing step before visualization or before the application of further algorithms working on digital curves. Finally a method is described, which yields to fast linear time algorithms for smoothing of digital curves.

This paper is a revised version of [7] (see references).

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Creutzburg, E., Hübler, A., Wedler, V.; On-1ine-Erkennung digitaler Geradensegmente in linearer Zeit; Proc. GEOBILD’82, Symp. über geometrische Probleme der Bildverarbeitung, Georgenthal, Dec. 1982; Wiss. Beiträge der FSU Oena; 48–65

    Google Scholar 

  2. Creutzburg, E., Hübler, A., Sykora, O.; Geometrie methods for one-line recognition of digital straight line segments; to appear

    Google Scholar 

  3. Sklansky, J., Gonzales,V.; Fast polygonal approximation of digitized curves; Proc. IEEE Conf.Patt.Ree. and Image Processing, Chicago, 1979; 604–609

    Google Scholar 

  4. Williams; Bounded straight line approximation of digitized planar curves and lines; Comp. Graphics and Image Processing, 16(1981) 4; 370–381

    Google Scholar 

  5. O’Rourke,3.; An on-line algorithm for fitting straight lines between data ranges; Comm.ACM, 1981, 9; 574–578

    Google Scholar 

  6. Rosenfeld, A.; Digital straight line segments; IEEE Trans. Computers, 23, 1974; 1264–1269

    Article  MathSciNet  MATH  Google Scholar 

  7. Hübler, A., Wedler, V.; Smoothing of digital curves — a theoretical approach and practical algorithms; Proc. GEOBILD’85, Symp. über geometrische Probleme der Bildverarbeitung, Georgenthal, Oan. 1985; Wiss. Beiträge der FSU Jena

    Google Scholar 

  8. Hübler, A., Klette,R., Werner,G.; Shortest path algorithms for graphs of restricted in-degree and out-degree; Elektron. Inf.-Verarbeitung und Kybernetik, EIK-18 3, 1982; 141–151

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hübler, A., Wedler, V. (1985). Fast Smoothing of Digital Curves. In: Niemann, H. (eds) Mustererkennung 1985. Informatik Fachberichte, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-70638-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-70638-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15696-3

  • Online ISBN: 978-3-642-70638-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics