DocumentCode :
2595293
Title :
Optimal decomposition of morphological structuring elements
Author :
Yang, Hsin-Tai ; Lee, Shie-Jue
Author_Institution :
Inst. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
Volume :
3
fYear :
1996
fDate :
16-19 Sep 1996
Firstpage :
1
Abstract :
We propose a method of optimal morphological decomposition. We first formulate this kind of problem into a set of linear constraints, and then find out the solution to the set of linear constraints by using an integer linear programming technique. Our method has the following three advantages: (1) the size of the factors can be any n×n (n⩾3), (2) it can be applied to both convex and concave simply-connected images; (3) optimality is selective and flexible
Keywords :
image coding; image representation; integer programming; linear programming; mathematical morphology; chain codes; concave simply-connected images; convex simply-connected images; factors size; image coding; image processing; image representation; integer linear programming; linear constraints; mathematical morphology; morphological structuring elements; optimal morphological decomposition; Computational efficiency; Concurrent computing; Image edge detection; Integer linear programming; Morphological operations; Morphology; Pattern analysis; Pattern recognition; Pipelines; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image Processing, 1996. Proceedings., International Conference on
Conference_Location :
Lausanne
Print_ISBN :
0-7803-3259-8
Type :
conf
DOI :
10.1109/ICIP.1996.560354
Filename :
560354
Link To Document :
بازگشت