A note on Park and Chin's algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 24, Issue 1, 2002, Pages 139-144

  Hashimoto, Ronaldo Fumio ^a,b   Barrera, Junior ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Decomposition; Minkowski addition; Simply connected set; Structuring element

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION; SET THEORY; THEOREM PROVING;

MINKOWSKI ADDITION; SIMPLY CONNECTED SET; STRUCTURING ELEMENT;

ALGORITHMS;

EID: 0036227376     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.982891     Document Type: Article

References (12)

1. Decomposition of arbitrarily shaped morphological structuring elements
2. Morphological structuring element decomposition
3. A lower bound for structuring element decompositions
4. Decomposition of convex polygonal morphological structuring elements into neighborhood subsets
5. Vector-space solution for a morphological shape-decomposition problem
6. Optimal decomposition of convex morphological structuring elements for 4-connected parallel processors
7. Optimal decomposition of morphological structuring elements
8. A combinatorial optimization technique for the sequential decomposition of erosions and dilations
9. Decomposition of arbitrarily shaped binary morphological structuring elements using genetic algorithms