A COMPARISON OF SOME ONE-PASS PARALLEL THINNINGS

被引:8
作者
CHEN, YS [1 ]
HSU, WH [1 ]
机构
[1] ACAD SINICA,INST INFORMAT SCI,TAIPEI 11529,TAIWAN
关键词
connectivity-preserving function; One-pass parallel thinning; thinning templates;
D O I
10.1016/0167-8655(90)90053-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A generalized expression for three existing one-pass parallel thinning algorithms is presented in this paper. It includes two fundamental terms, namely, thinning templates and a connectivity-preserving function. These two terms can be used to compare the efficiency and effects of these algorithms. Comparisons confirm that our algorithm is more efficient and effective than the other two. © 1990.
引用
收藏
页码:35 / 41
页数:7
相关论文
共 8 条
[1]   A SYSTEMATIC-APPROACH FOR DESIGNING 2-SUBCYCLE AND PSEUDO 1-SUBCYCLE PARALLEL THINNING ALGORITHMS [J].
CHEN, YS ;
HSU, WH .
PATTERN RECOGNITION, 1989, 22 (03) :267-282
[2]   A MODIFIED FAST PARALLEL ALGORITHM FOR THINNING DIGITAL PATTERNS [J].
CHEN, YS ;
HSU, WH .
PATTERN RECOGNITION LETTERS, 1988, 7 (02) :99-106
[3]   A ONE-PASS THINNING ALGORITHM AND ITS PARALLEL IMPLEMENTATION [J].
CHIN, RT ;
WAN, HK ;
STOVER, DL ;
IVERSON, RD .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1987, 40 (01) :30-40
[4]   AN IMPROVED PARALLEL THINNING ALGORITHM [J].
HOLT, CM ;
STEWART, A ;
CLINT, M ;
PERROTT, RH .
COMMUNICATIONS OF THE ACM, 1987, 30 (02) :156-160
[5]   CRITICAL-POINTS ON A PERFECTLY 8-CONNECTED OR 6-CONNECTED THIN BINARY LINE [J].
HUNG, SHY ;
KASVAND, T .
PATTERN RECOGNITION, 1983, 16 (03) :297-306
[6]   CONNECTIVITY IN DIGITAL PICTURES [J].
ROSENFELD, A .
JOURNAL OF THE ACM, 1970, 17 (01) :146-+
[7]   SOME PARALLEL THINNING ALGORITHMS FOR DIGITAL PICTURES [J].
STEFANELLI, R ;
ROSENFELD, A .
JOURNAL OF THE ACM, 1971, 18 (02) :255-+
[8]   A FAST PARALLEL ALGORITHM FOR THINNING DIGITAL PATTERNS [J].
ZHANG, TY ;
SUEN, CY .
COMMUNICATIONS OF THE ACM, 1984, 27 (03) :236-239