Skip to main content

An Efficient Hardware Architecture without Line Memories for Morphological Image Processing

  • Conference paper

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

Abstract

In this paper, we present a novel hardware architecture to achieve erosion and dilation with a large structuring element. We are proposing a modification of HGW algorithm with a block mirroring scheme to ease the propagation and memory access and to minimize memory consumption. It allows to suppress the needs for backward scanning and gives the possibility for hardware architecture to process very large lines with a low latency. It compares well with the Lemonnier’s architecture in terms of ASIC gates area and shows the interest of our solution by dividing the circuit area by an average of 10.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Soille, P.: Morphological Image Analysis: Principles and Applications. Springer, New York (2003)

    MATH  Google Scholar 

  2. Bresenham, J.: Algorithm for computer control of digital plotter. IBM System Journal 4, 25–30 (1965)

    Article  Google Scholar 

  3. Soille, P., Breen, E.J., Jones, R.: Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles. IEEE Trans. Pattern Anal. Mach. Intell. 18(5), 562–567 (1996)

    Article  Google Scholar 

  4. Najman, L.: Using mathematical morphology for document skew estimation. SPIE 5296, 182–191 (2003)

    Google Scholar 

  5. Lemonnier, F., Klein, J.-C.: Fast dilation by large 1D structuring elements. In: IEEE Workshop on Nonlinear Signal and Image Processing, Neos Marmaras, Halkidiki, Greece, June 20–22, pp. 479–482, 5229 (1995)

    Google Scholar 

  6. Van Herk, M.: A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels. Pattern Recognition Letters 13(7), 517–521 (1992)

    Article  Google Scholar 

  7. Gil, J., Werman, M.: Computing 2-D Min, Median, and Max Filters. IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 504–507 (1993)

    Article  Google Scholar 

  8. van den Boomgaard, R., Wester, D.A.: Logarithmic shape decomposition. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) Aspects of Visual Form Processing, pp. 552–561. World Scientific Publishing Co., Singapore (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clienti, C., Bilodeau, M., Beucher, S. (2008). An Efficient Hardware Architecture without Line Memories for Morphological Image Processing. In: Blanc-Talon, J., Bourennane, S., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2008. Lecture Notes in Computer Science, vol 5259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88458-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88458-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88457-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics