<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
	<record>
		<datafield tag="980" ind1=" " ind2=" ">
			<subfield code="a">REPORT</subfield>
		</datafield>
		<datafield tag="970" ind1=" " ind2=" ">
			<subfield code="a">breuel-93.02/IDIAP</subfield>
		</datafield>
		<datafield tag="245" ind1=" " ind2=" ">
			<subfield code="a">Recognition of Handprinted Digits</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Breuel, Thomas M.</subfield>
		</datafield>
		<datafield tag="856" ind1="4" ind2="0">
			<subfield code="i">EXTERNAL</subfield>
			<subfield code="u">http://publications.idiap.ch/attachments/reports/1993/93-06.pdf</subfield>
			<subfield code="x">PUBLIC</subfield>
		</datafield>
		<datafield tag="088" ind1=" " ind2=" ">
			<subfield code="a">Idiap-RR-06-1993</subfield>
		</datafield>
		<datafield tag="260" ind1=" " ind2=" ">
			<subfield code="c">1993</subfield>
			<subfield code="b">IDIAP</subfield>
		</datafield>
		<datafield tag="520" ind1=" " ind2=" ">
			<subfield code="a">This paper describes a system that recognizes hand-printed digits. The system is based on optimal bounded error matching, a technique already in common use in general-purpose 2D and 3D visual object recognition systems in cluttered, noisy scenes. In this paper, we demonstrate that the same techniques achieve high recognition rates (up to 99.2\%) on real-world data (the NIST database of hand-printed census forms and the CEDAR database of digits extracted from U.S. mail ZIP codes). As part of the system, we describe a post-processing step for $k$-nearest neighbor classifiers based on decision trees that can be used (in place of the usual heuristic methods) for setting thresholds and improves recognition rates significantly.</subfield>
		</datafield>
	</record>
</collection>