An Efficient Hardware Architecture without Line Memories for Morphological Image Processing

Authors:
Christophe Clienti;Michel Bilodeau;Serge Beucher
Affiliations:
CMM - Centre de morphologie mathmatique, Mathmatiques et Systèmes, MINES Paristech, Fontainebleau cedex, France 77305;CMM - Centre de morphologie mathmatique, Mathmatiques et Systèmes, MINES Paristech, Fontainebleau cedex, France 77305;CMM - Centre de morphologie mathmatique, Mathmatiques et Systèmes, MINES Paristech, Fontainebleau cedex, France 77305
Venue:
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Year:
2008

Citing 5
Cited 2

A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

Pattern Recognition Letters
Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing 2-D Min, Median, and Max Filters

IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Image Analysis: Principles and Applications

Morphological Image Analysis: Principles and Applications
Algorithm for computer control of a digital plotter

IBM Systems Journal

Computationally efficient, one-pass algorithm for morphological filters

Journal of Visual Communication and Image Representation
Fast recursive grayscale morphology operators: from the algorithm to the pipeline architecture

Journal of Real-Time Image Processing

Quantified Score

Hi-index	0.00

Visualization

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.