GLOBAL SHAPE-ANALYSIS BY K-SYNTACTIC SIMILARITY

被引:11
作者
BJORKLUND, CM [1 ]
PAVLIDIS, T [1 ]
机构
[1] PRINCETON UNIV,DEPT ELECT ENGN & COMP SCI,PRINCETON,NJ 08544
关键词
D O I
10.1109/TPAMI.1981.4767072
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
引用
收藏
页码:144 / 155
页数:12
相关论文
共 33 条
[11]   DECOMPOSITION OF POLYGONS INTO SIMPLER COMPONENTS - FEATURE GENERATION FOR SYNTACTIC PATTERN-RECOGNITION [J].
FENG, HYF ;
PAVLIDIS, T .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (06) :636-650
[12]  
Freeman H., 1961, IRE T ELECT COMPUT, VEC-10, P260, DOI DOI 10.1109/TEC.1961.5219197
[13]  
FU KS, 1977, SYNTACTIC PATTERN RE
[14]  
Garey M. R., 1976, SIAM Journal on Computing, V5, P704, DOI 10.1137/0205049
[15]  
HARALICK RM, 1977, IEEE P PATTERN RECOG, P112
[16]  
JOHNSON DB, 1975, SIAM J COMPUT, V4, P75
[17]  
Liu C. L., 1968, INTRO COMBINATORIAL
[18]  
LU SY, 1977, IEEE T COMPUT, V26, P1268, DOI 10.1109/TC.1977.1674788
[19]  
MCKEE JW, 1977, IEEE T COMPUT, V26, P790, DOI 10.1109/TC.1977.1674917
[20]  
MUNDY JL, 1977, IEEE P PATTERN RECOG, P144