Skip to main content

Queue and Priority Queue Based Algorithms for Computing the Quasi-distance Transform

  • Conference paper
Image Analysis and Recognition (ICIAR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6111))

Included in the following conference series:

  • 1477 Accesses

Abstract

The quasi-distance transform introduced by Beucher shows interesting properties for various tasks in image processing such as segmentation, filtering and images simplification. Despite its simple formulation, a naive and direct implementation of the transform leads to poor results in terms of computational time. This article proposes a new algorithm for computing the quasi-distance, based on a front propagating approach by means of queues and hierarchical queues. Quantitative analysis of the running time are provided, and show an exponential downscale of the complexity compared to the original algorithm.

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. Beucher, S.: Numerical Residues. In: Proceedings of the 7th International Symposium on Mathematical Morphology, pp. 23–32 (2005)

    Google Scholar 

  2. Beucher, S.: Transformations résiduelles en morphologie numérique. Technical report of the Mathematical Morphology Center (2003)

    Google Scholar 

  3. Hanbury, A., Marcotegui, B.: Waterfall segmentation of complex scenes. In: 7th Asian Conference on Computer Vision (2006)

    Google Scholar 

  4. Beucher, S., Lantuéjoul, C.: Use of watersheds in contour detection. In: International Workshop on Image Processing, Real-Time Edge and Motion Detection/Estimation (1979)

    Google Scholar 

  5. Lantuéjoul, C., Beucher, S.: On the use of geodesic metric in image analysis. Journal of Microscopy 121, 39–49 (1981)

    Google Scholar 

  6. Brambor, J.: Algorithmes de la Morphologie Mathématique pour les architectures orientées flux. PhD Thesis, Mathematical Morphology Center (2006)

    Google Scholar 

  7. Enficiaud, R.: Algorithmes multidimensionels et multispectraux en morphologie mathématique: approche par méta-programmation. PhD Thesis, Mathematical Morphology Center (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Enficiaud, R. (2010). Queue and Priority Queue Based Algorithms for Computing the Quasi-distance Transform. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2010. Lecture Notes in Computer Science, vol 6111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13772-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13772-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13771-6

  • Online ISBN: 978-3-642-13772-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics