Fast computation of morphological operations with arbitrary structuring elements

被引:62
作者
VanDroogenbroeck, M
Talbot, H
机构
[1] CSIRO,N RYDE,NSW 2113,AUSTRALIA
[2] BELGACOM NEW DEV,B-1210 BRUSSELS,BELGIUM
关键词
mathematical morphology; algorithm; arbitrary shape;
D O I
10.1016/S0167-8655(96)00113-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a general algorithm that performs basic mathematical morphology operations, like erosions and openings, with any arbitrary shaped structuring element in an efficient way. It is shown that our algorithm has a lower or equal complexity but better computing time than all comparable known methods.
引用
收藏
页码:1451 / 1460
页数:10
相关论文
共 13 条
[1]  
[Anonymous], RANDOM SETS INTEGRAL
[2]   AN EFFICIENT ALGORITHM FOR RUNNING WINDOW PEL GRAY LEVEL RANKING IN 2-D IMAGES [J].
CHAUDHURI, BB .
PATTERN RECOGNITION LETTERS, 1990, 11 (02) :77-80
[3]   COMPUTING 2-D MIN, MEDIAN, AND MAX FILTERS [J].
GIL, J ;
WERMAN, M .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (05) :504-507
[4]  
GRATIN C, 1993, VISUAL COMMUNICATION
[5]   IMAGE-ANALYSIS USING MATHEMATICAL MORPHOLOGY [J].
HARALICK, RM ;
STERNBERG, SR ;
ZHUANG, XH .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (04) :532-550
[6]  
HUANG TS, 1979, IEEE T ACOUST SPEECH, V27
[7]   HIERARCHICAL ALGORITHMS FOR MORPHOLOGICAL IMAGE-PROCESSING [J].
LIANG, EH ;
WONG, EK .
PATTERN RECOGNITION, 1993, 26 (04) :511-529
[8]  
MEYER F, 1990, UN ALGORITHME ORDONN
[9]   SPEEDING-UP SUCCESSIVE MINKOWSKI OPERATIONS WITH BIT-PLANE COMPUTERS [J].
PECHT, J .
PATTERN RECOGNITION LETTERS, 1985, 3 (02) :113-117
[10]  
Serra J., 1982, Image Analysis and Mathematical Morphology