Morphological structuring element decomposition
Computer Vision, Graphics, and Image Processing
Theory of linear and integer programming
Theory of linear and integer programming
A Lower Bound for Structuring Element Decompositions
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
Separable decompositions and approximations of greyscale morphological templates
CVGIP: Image Understanding
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
Finding optimal sequential decompositions of erosions and dilations
ISMM '98 Proceedings of the fourth international symposium on Mathematical morphology and its applications to image and signal processing
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
A Note on Park and Chin's Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Digital Image Processing
Artificial Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Greedy Algorithm for Decomposing Convex Structuring Elements
Journal of Mathematical Imaging and Vision
An Extension of an Algorithm for Finding Sequential Decomposition of Erosions and Dilations
SIBGRAPHI '98 Proceedings of the International Symposium on Computer Graphics, Image Processing, and Vision
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Rank-based decompositions of morphological templates
IEEE Transactions on Image Processing
A Note on Park and Chin's Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
From the Sup-Decomposition to Sequential Decompositions
Journal of Mathematical Imaging and Vision
Sup-Compact and Inf-Compact Representations of W-Operators
Fundamenta Informaticae
Sup-Compact and Inf-Compact Representations of W-Operators
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper presents a general algorithm for the automatic proof that an erosion (respectively, dilation) has a sequential decomposition or not. If the decomposition exists, an optimum decomposition is presented. The algorithm is based on a branch and bound search, with pruning strategies and bounds based on algebraic and geometrical properties deduced formally. This technique generalizes classical results as Zhuang and Haralick, Xu, and Park and Chin, with equivalent or improved performance. Finally, theoretical analysis of the proposed algorithm and experimental results are presented.