Morphological structuring element decomposition
Computer Vision, Graphics, and Image Processing
Image Analysis 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)
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
Statistical Characterization of Morphological Operator Sequences
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part IV
Shape representation based on mathematical morphology
Pattern Recognition Letters
Decomposition of binary morphological structuring elements based on genetic algorithms
Computer Vision and Image Understanding
An Embedded Real-Time Surveillance System: Implementation and Evaluation
Journal of Signal Processing Systems
3D binary morphological operations using run-length representation
Image Communication
Note: Decomposition of binary morphological structuring elements based on genetic algorithms
Computer Vision and Image Understanding
On the Decomposition of Interval-Valued Fuzzy Morphological Operators
Journal of Mathematical Imaging and Vision
Edge preserved image fusion based on multiscale toggle contrast operator
Image and Vision Computing
| Hi-index | 0.14 |
For image processing systems that have a limited size of region of support, say 3 脳 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of large morphological operations. In this paper, we present the decomposition of arbitrarily shaped (convex or concave) structuring elements into 3 脳 3 elements, optimized with respect to the number of 3 脳 3 elements. The decomposition is based on the concept of factorization of a structuring element into its prime factors. For a given structuring element, all its corresponding 3 脳 3 prime concave factors are first determined. From the set of the prime factors, the decomposability of the structuring element is then established, and subsequently the structuring element is decomposed into a smallest possible set of 3 脳 3 elements. Examples of optimal decomposition and structuring elements that are not decomposable are presented.