A Fast Algorithm for Erosion and Dilation in Mathematical Morphology

被引:5
作者
Lin, Xiaoping [1 ]
Xu, Zhihong [2 ]
机构
[1] Guangdong Univ Technol, Fac Comp, Guangzhou 510006, Guangdong, Peoples R China
[2] SierraAtlant Guangzhou Software Dev Co Ltd, Guangzhou 510663, Guangdong, Peoples R China
来源
2009 WRI WORLD CONGRESS ON SOFTWARE ENGINEERING, VOL 2, PROCEEDINGS | 2009年
关键词
Mathematical Morphology; erosion; dilation; van Herk algorithm;
D O I
10.1109/WCSE.2009.367
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A fast algorithm for local Inca:mum and minimum filters is presented by Marcel van Herk, utilizing separability and recursive algorithms In this paper, we put forward another unproved algorithm based on Marcel van Herk' s research The new algorithm makes the comparison for each pixel in two auxiliary spaces without utilizing the original image space with the purpose of reducing the calculation for the space. A better result has been obtained based upon the computer simulation, and the method, which is more suitable for implementation of programming, is capable of improving the efficiency of the operation for erosion and dilation
引用
收藏
页码:185 / +
页数:2
相关论文
共 7 条
[1]  
Hendriks C. L. L., 2001, Visual Form 2001. 4th International Workshop on Visual Form IWVF4. Proceedings (Lecture Notes in Computer Science Vol.2059), P378
[2]  
HENDRIKS CLL, 2003, COMPUTER ANAL IMAGES, V2756, P722
[3]   Controls on coastal dune morphology, shoreline erosion and barrier island response to extreme storms [J].
Houser, Chris ;
Hapke, Cheryl ;
Hamilton, Stuart .
GEOMORPHOLOGY, 2008, 100 (3-4) :223-240
[4]  
Katartzis A, 2000, COMPUT IMAGING VIS, V18, P405
[5]   Directional morphological filtering [J].
Soille, P ;
Talbot, H .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1313-1329
[6]  
Soille P, 1998, INT C PATT RECOG, P1467, DOI 10.1109/ICPR.1998.711982
[7]   A FAST ALGORITHM FOR LOCAL MINIMUM AND MAXIMUM FILTERS ON RECTANGULAR AND OCTAGONAL KERNELS [J].
VANHERK, M .
PATTERN RECOGNITION LETTERS, 1992, 13 (07) :517-521