Morphological structuring element decomposition
Computer Vision, Graphics, and Image Processing
Integer and combinatorial optimization
Integer and combinatorial optimization
Pipeline architectures for morphologic image analysis
Machine Vision and Applications
Automatic generation of morphological set recognition algorithms
Automatic generation of morphological set recognition algorithms
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
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
Crucial combinations of parts for handwritten alphanumeric characters
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.14 |
A theoretical lower bound on the number of points required in the decomposition of morphological structuring elements is described. It is shown that the decomposition of an arbitrary N-point structuring element will require at least (3 ln N/ln 3)points. Using this lower bound it is possible to find the optimal decompositions (in terms of the minimum number of unions or the minimum number of points) for all one-dimensional connected line segments. L-dimensional rectangles may be decomposed by optimally decomposing the L one-dimensional line segments that describe the rectangle.