Image Analysis Using Mathematical Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pipeline architectures for morphologic image analysis
Machine Vision and Applications
A Multiscanning Approach Based on Morphological Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of Thinning Algorithms Using Mathematical Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Shape Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Decomposition of Arbitrarily Shaped Morphological Structuring Elements
IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of Gray-Scale Morphological Templates Using the Rank Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations
Journal of Mathematical Imaging and Vision
A Note on Park and Chin's Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach
Pattern Recognition Letters
Decomposition of binary morphological structuring elements based on genetic algorithms
Computer Vision and Image Understanding
Note: Decomposition of binary morphological structuring elements based on genetic algorithms
Computer Vision and Image Understanding
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Neighborhood decomposition of 3d convex structuring elements for morphological operations
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
| Hi-index | 0.14 |
A morphological operation using a large structuring element can be decomposed equivalently into a sequence of recursive operations, each using a smaller structuring element. However, an optimal decomposition of arbitrarily shaped structuring elements is yet to be found. In this paper, we have derived an optimal decomposition of a specific class of structuring elements/spl mdash/convex sets/spl mdash/for a specific type of machine/spl mdash/4-connected parallel array processors. The cost of morphological operation on 4-connected parallel array processors is the total number of 4-connected shifts required by the set of structuring elements. First, the original structuring element is decomposed into a set of prime factors, and then their locations are determined while minimizing the cost function. Proofs are presented to show the optimality of the decomposition. Examples of optimal decomposition are given and compared to an existing decomposition reported by Xu (1991).