ON THE PERFORMANCE OF CHAIN CODES FOR QUANTIZATION OF LINE DRAWINGS

被引：36

作者：

KOPLOWITZ, J

机构：

来源：

关键词：

D O I：

10.1109/TPAMI.1981.4767075

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：180 / 185

页数：6

共 9 条

[1]

DUDA RO, 1973, PATTERN CLASSIFICATI, P368

[2]

Freeman H., 1961, IRE T ELECT COMPUT, VEC-10, P260, DOI DOI 10.1109/TEC.1961.5219197

[3]

Freeman H., 1974, COMPUT SURV, V6, P58, DOI DOI 10.1145/356625.356627

[4] FREEMAN-CODE PROBABILITIES OF OBJECT BOUNDARY QUANTIZED CONTOURS [J].

GROEN, FCA ;

VERBEEK, PW .

COMPUTER GRAPHICS AND IMAGE PROCESSING, 1978, 7 (03) :391-402

[5]

KENDALL M, 1963, GEOMETRICAL PROBABIL

[6]

KOPLOWITZ J, 1976, OCT P CAN C COMM POW

[7]

KOPLOWITZ J, 1979, JUN IEEE INT S INF T

[8]

Santalo L. A., 1976, INTEGRAL GEOMETRY GE

[9]

SOLOMON H, 1978, GEOMETRIC PROBABILIT