AMBIGUITY REDUCTION IN HANDWRITING WITH AMBIGUOUS SEGMENTATION AND UNCERTAIN INTERPRETATION

被引：10

作者：

PELEG, S

机构：

[1] Computer Science Center, University of Maryland, College Park

来源：

COMPUTER GRAPHICS AND IMAGE PROCESSING | 1979年 / 10卷 / 03期

关键词：

D O I：

10.1016/0146-664X(79)90003-0

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A connected piece of handwritiing can be segmented into letters in many possible ways, and each segment can also be interpreted as one of several possible letters. Each segmentation, and each choice of interpretations for the segments, determines a word. An iterative relaxation algorithm is presented that considerably reduces the number of possible interpretations for the handwriting, while preserving the most likely interpretations. © 1979 Academic Press, Inc.

引用

页码：235 / 245

页数：11

共 8 条

[1]

Hayes, Reading Handwritten Words Using Hierarchical Relaxation, Ph.D. thesis, (1979)

[2]

Rosenfeld, Hummel, Zucker, Scene labeling by relaxation operations, IEEE Trans. Systems, Man and Cybernetics, 6 SMC, pp. 420-433, (1976)

[3]

Rosenfeld, Iterative methods in image analysis, Pattern Recognition, 10, pp. 181-187, (1978)

[4]

Velasco, Rosenfeld, The application of relaxation to waveforms with ambiguous segmentation, (1978)

[5]

Peleg, Maximal derivations for probabilistic strings in stochastic languages, (1978)

[6]

Peleg, A new probabilistic relaxation scheme, (1978)

[7]

Peleg, A new probabilistic relaxation scheme, Proc. IEEE Conf. on Pattern Recognition and Image Processing, (1979)

[8]

Peleg, Rosenfeld, Breaking substitution ciphers using a relaxation algorithm, (1979)

← 1 →