ONE-PASS COMPLEXITY OF DIGITAL PICTURE PROPERTIES

被引:24
作者
SELKOW, SM
机构
关键词
D O I
10.1145/321694.321701
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:283 / &
相关论文
共 9 条
[1]  
Beyer Wendell Terry, 1969, THESIS MIT
[2]  
Blum H., 1967, MODELS PERCEPTION SP, V4, DOI DOI 10.1142/S0218654308001154
[3]  
BLUM M, 1967, IEEE S SWITCHING AUT
[4]   LOGICAL COMPLEXITY OF GEOMETRIC PROPERTIES IN PLANE [J].
HODES, L .
JOURNAL OF THE ACM, 1970, 17 (02) :339-&
[5]  
Minsky M., 2017, PERCEPTRONS INTRO CO
[6]   A METHOD FOR OBTAINING SKELETONS USING A QUASI-EUCLIDEAN DISTANCE [J].
MONTANARI, U .
JOURNAL OF THE ACM, 1968, 15 (04) :600-+
[7]  
ROSENFEL.A, 1966, J ACM, V13, P471
[8]   CONNECTIVITY IN DIGITAL PICTURES [J].
ROSENFELD, A .
JOURNAL OF THE ACM, 1970, 17 (01) :146-+
[9]   PARSING OF GRAPH-REPRESENTABLE PICTURES [J].
SHAW, AC .
JOURNAL OF THE ACM, 1970, 17 (03) :453-&