Issue No. 09 - September (1995 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.406658
<p><it>Abstract</it>—A technique for creating and searching a tree of patterns using relative distances is presented. The search is conducted to find patterns which are nearest neighbors of a given test pattern. The structure of the tree is such that the search time is proportional to the distance between the test pattern and its nearest neighbor, which suggests the anomalous possibility that a larger tree, which can be expected on average to contain closer neighbors, can be searched faster than a smaller tree. The technique has been used to recognize OCR digit samples derived from NIST data at an accuracy rate of 97% using a tree of 7,000 patterns.</p>
Pattern recognition, optical character recognition, nearest neighbor, distance metric, branch and bound, NIST digit samples.
T. E. Portegys, "A Search Technique for Pattern Recognition Using Relative Distances," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 17, no. , pp. 910-912, 1995.