Nearest neighbor based collection OCR

13 years 10 months ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Collection OCR which takes advantage of the fact that multiple examples of the same word (often in the same font) may occur in a document or collection. The idea here is that an OCR or a reCAPTCHA like process generates a partial set of recognized words. In the second stage, a nearest neighbor algorithm compares the remaining word-images to those already recognized and propagates labels from the nearest neighbors. It is shown that by using an approximate fast nearest neighbor algorithm based on Hierarchical K-Means (HKM), we can do this accurately and efficiently. It is also shown that profile based features perform much better than SIFT and Pyramid Histogram of Gradient (PHOG) features. We believe that this is because profile features are more robust to word degradations (common in our documents). This approac...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2010
Where DAS
Authors K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
Comments (0)