DocumentCode
3205255
Title
Morphological decomposition of restricted domains: a vector space solution
Author
Kanungo, Tapas ; Haralick, Robert M.
Author_Institution
Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
fYear
1992
fDate
15-18 Jun 1992
Firstpage
627
Lastpage
629
Abstract
Restricted domains, which are a restricted class of 2-D shapes, are defined. It is proved that any restricted domain can be decomposed as n -fold dilations of thirteen basis structuring elements and hence can be represented in a thirteen-dimensional space. This thirteen-dimensional space is spanned by the thirteen basis structuring elements comprising of lines, triangles, and a rhombus. It is shown that there is a linear transformation from this thirteen-dimensional space to an eight-dimensional space wherein a restricted domain is represented in terms of its side lengths. Furthermore, the decomposition in general is not unique, and all the decompositions can be constructed by finding the homogeneous solutions of the transformation and adding it to a particular solution. An algorithm for finding all possible decompositions is provided
Keywords
computer vision; image processing; mathematical morphology; 2-D shapes; linear transformation; lines; morphological decomposition; n-fold dilations; restricted domains; rhombus; structuring elements; thirteen-dimensional space; triangles; vector space solution; Hardware; Intelligent systems; Laboratories; Lattices; Morphology; Shape; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92., 1992 IEEE Computer Society Conference on
Conference_Location
Champaign, IL
ISSN
1063-6919
Print_ISBN
0-8186-2855-3
Type
conf
DOI
10.1109/CVPR.1992.223124
Filename
223124
Link To Document