Experiments with Highleyman's Data
- 1 April 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-17 (4), 399-401
- https://doi.org/10.1109/tc.1968.229391
Abstract
—The results of three experiments with Highleyman's hand-printed characters are reported. Nearest-neighbor classification is used to explain the high error rates (42 to 60 percent) obtained by general statistical procedures. An error rate of 32 percent is obtained by preceding piecewise-linear classification by edge-detecting preprocessing. The minimum human error rate is estimated, and suggested as a performance standard.Keywords
This publication has 9 references indexed in Scilit:
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967
- Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant FunctionsIEEE Transactions on Electronic Computers, 1966
- Data for Character Recognition StudiesIEEE Transactions on Electronic Computers, 1963
- A Recognition Method Using Neighbor DependenceIRE Transactions on Electronic Computers, 1962
- Linear Decision Functions, with Application to Pattern RecognitionProceedings of the IRE, 1962
- An Analog Method for Character RecognitionIEEE Transactions on Electronic Computers, 1961
- Further Results on the N-tuple Pattern Recognition MethodIEEE Transactions on Electronic Computers, 1961
- A note on human recognition of hand-printed charactersInformation and Control, 1960
- Comments on a Character Recognition Method of Bledsoe and BrowningIRE Transactions on Electronic Computers, 1960