Binary morphology with spatially variant structuring elements: algorithm and architecture

Authors:
Hugo Hedberg;Petr Dokladal;Viktor Öwall
Affiliations:
Prevas, Stockholm and Department of Electrical and Information Technology, Lund University, Lund, Sweden;Center of Mathematical Morphology, Mines Paris Paritech, Fontainebleau Cedex, France;Department of Electrical and Information Technology, Lund University, Lund, Sweden
Venue:
IEEE Transactions on Image Processing
Year:
2009

Citing 21
Cited 2

Grayscale morphology

Computer Vision, Graphics, and Image Processing
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Mathematical morphology for structure without translation symmetry

Signal Processing
Fast erosion and dilation by contour processing and thresholding of distance maps

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

Pattern Recognition Letters
Morphological reduction of skeleton redundancy

Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Digital integrated circuits: a design perspective

Digital integrated circuits: a design perspective
Fast computation of morphological operations with arbitrary structuring elements

Pattern Recognition Letters
FPGA-Based Implementation of Variable Sized Structuring Elements for 2D Binary Morphological Operations

DELTA '02 Proceedings of the The First IEEE International Workshop on Electronic Design, Test and Applications (DELTA '02)
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology
General Adaptive Neighborhood Image Processing

Journal of Mathematical Imaging and Vision
General Adaptive Neighborhood Image Processing

Journal of Mathematical Imaging and Vision
Locally adaptable mathematical morphology using distance transformations

Pattern Recognition
Image filtering using morphological amoebas

Image and Vision Computing
2D Euclidean distance transform algorithms: A comparative survey

ACM Computing Surveys (CSUR)
An Embedded Real-Time Surveillance System: Implementation and Evaluation

Journal of Signal Processing Systems
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part I: Binary Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part II: Gray-Level Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Statistical analysis of space-varying morphological openings withflat structuring elements

IEEE Transactions on Signal Processing
Spatially Variant Morphological Restoration and Skeleton Representation

IEEE Transactions on Image Processing
Partial-result-reuse architecture and its design technique for morphological operations with flat structuring elements

IEEE Transactions on Circuits and Systems for Video Technology

Overview of adaptive morphology: trends and perspectives

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Computationally efficient, one-pass algorithm for morphological filters

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Mathematical morphology with spatially variant structuring elements outperforms translation-invariant structuring elements in various applications and has been studied in the literature over the years. However, supporting a variable structuring element shape imposes an overwhelming computational complexity, dramatically increasing with the size of the structuring element. Limiting the supported class of structuring elements to rectangles has allowed for a fast algorithm to be developed, which is efficient in terms of number of operations per pixel, has a low memory requirement, and a low latency. These properties make this algorithm useful in both software and hardware implementations, not only for spatially variant, but also translation-invariant morphology. This paper also presents a dedicated hardware architecture intended to be used as an accelerator in embedded system applications, with corresponding implementation results when targeted for both field programmable gate arrays and application specific integrated circuits.