DocumentCode :
1298487
Title :
A fast implementation of 3-D binary morphological transformations
Author :
Nikopoulos, Nikos ; Pitas, Ioannis
Author_Institution :
Dept. of Inf., Thessaloniki Univ., Greece
Volume :
9
Issue :
2
fYear :
2000
fDate :
2/1/2000 12:00:00 AM
Firstpage :
283
Lastpage :
286
Abstract :
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The efficiency of the algorithm is analyzed and some experimental results of its application are presented. As shown, the efficiency of the algorithm increases with the size of the structuring element
Keywords :
image processing; mathematical morphology; transforms; 3-D binary morphological transformations; 3-D structuring elements; Minkowski addition; efficiency; fast implementation; images; Algorithm design and analysis; Bibliographies; Computational complexity; Concurrent computing; Image analysis; Image processing; Morphological operations; Morphology; Set theory; Shape;
fLanguage :
English
Journal_Title :
Image Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7149
Type :
jour
DOI :
10.1109/83.821743
Filename :
821743
Link To Document :
بازگشت