Stochastic Model for the Browning-Bledsoe Pattern Recognition Scheme
暂无分享,去创建一个
A stochastic model is presented which gives the probabilities of successful recognition of the Browning-Bledsoe recognition scheme as a function of scheme parameters and pattern variability parameters. Also, procedures are given for estimating the variability parameters from data so that the model can be used to predict readability. The adequacy of the model is checked by comparing estimated readability with observed readability for two sets of data, one with high variability and one with low variability. The Browning-Bledsoe recognition scheme is also treated as a coding and decoding problem in which case the concepts of information theory are useful. Finally, brief mention is made of the connection between pattern recognition problems and classification problems in general, and the Browning-Bledsoe recognition scheme is compared and contrasted with other recognition schemes which make use of measurements on patterns.
[1] W. W. Bledsoe,et al. Pattern recognition and reading by machine , 1959, IRE-AIEE-ACM '59 (Eastern).
[2] Louis A. Kamentsky,et al. The Simulation of Three Machines Which Read Rows of Handwritten Arabic Numbers , 1961, IRE Trans. Electron. Comput..
[3] Wilbur H. Highleyman,et al. Comments on a Character Recognition Method of Bledsoe and Browning , 1960, IRE Trans. Electron. Comput..
[4] Wilbur H. Highleyman,et al. Further Comments on the N-tuple Pattern Recognition Method , 1961, IRE Trans. Electron. Comput..