ICONIC INDEXING BY 2-D STRINGS

被引：320

作者：

CHANG, SK ^{[1
]}

SHI, QY ^{[1
]}

YAN, CW ^{[1
]}

机构：

[1] IIT,DEPT ELECT & COMP ENGN,CHICAGO,IL 60616

来源：

关键词：

D O I：

10.1109/TPAMI.1987.4767923

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：413 / 428

页数：16

共 11 条

[1]

BASL PJ, 1985, ACM COMPUT SURVEYS, V17, P75

[2]

Chang N. S., 1979, Proceedings of COMPSAC the IEEE Computer Society's Third International Computer Software and Applications Conference, P325

[3] RECONSTRUCTION OF BINARY PATTERNS FROM THEIR PROJECTIONS [J].

CHANG, SK .

[4]

CHANG SK, 1986, NOV P FJCC 86 DALL

[5]

CHANG SK, 1981, COMPUTER, P13

[6]

CHANG SK, 1984, IEEE T PATTERN A JUL, P475

[7]

CHANG SK, 1984, NOV IEEE P LANG AUT, P38

[8] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J].

HIRSCHBERG, DS .

[9] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES [J].

HUNT, JW ;

SZYMANSKI, TG .

[10] THE QUADTREE AND RELATED HIERARCHICAL DATA-STRUCTURES [J].

SAMET, H .