Decomposition of arbitrary gray-scale morphological structuring elements

Authors:
Frank Y. Shih;Yi-Ta Wu
Affiliations:
Computer Vision Laboratory, College of Computing Sciences, New Jersey Institute of Technology, Newark, NJ 07102, USA;Computer Vision Laboratory, College of Computing Sciences, New Jersey Institute of Technology, Newark, NJ 07102, USA
Venue:
Pattern Recognition
Year:
2005

Citing 12
Cited 0

Image Analysis Using Mathematical Morphology

IEEE Transactions on Pattern Analysis and Machine Intelligence
Threshold Decomposition of Gray-Scale Morphology into Binary Morphology

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of gray-scale morphological structuring elements

Pattern Recognition
Separable decompositions and approximations of greyscale morphological templates

CVGIP: Image Understanding
Methods for fast morphological image transforms using bitmapped binary images

CVGIP: Graphical Models and Image Processing
A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

Pattern Recognition Letters
Decomposition of Gray-Scale Morphological Templates Using the Rank Method

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Note on Park and Chin's Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology
Gray-scale structuring element decomposition

IEEE Transactions on Image Processing
Rank-based decompositions of morphological templates

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Mathematical morphology has been widely used for many applications in image processing and analysis. Most image processing architectures adapted to morphological operations use structuring elements of a limited size. Therefore, difficulties arise when we deal with a large-sized structuring element. In this paper, we present algorithms for the decomposition of arbitrary gray-scale structuring elements into combined dilations or maximum operators of smaller structuring components. Our method does not need to perform additional pre-processes, such as checking the type of structuring elements and the decomposition rules. Furthermore, it is suited for a parallel pipelined architecture.