Patent Document ID: 8938118
Application ID: 13694853
Patent Flag: 1

Claim One:
1. A method of neighbor embedding comprising the steps of: creating a training of pairs, each having a first element, FL n,m , and a second element, H* n,m ; creating a set of randomized k-d trees from said training set by using said first elements, FL n,m , as leaf nodes; receiving at least one low resolution text image, P; generating a high resolution image, T, from said at least one low resolution text image, P, using said training set and the result of step (b); and generating a text file by inputting said high resolution image, T, into an OCR engine; wherein the step of creating a training set comprises: a. receiving a user-defined set of text documents, S n ; b. generating, for each S n , a high resolution image, H n ; c. generating, for each S n , a low resolution image, L n ; d. selecting a user-definable patch dimension, K, where K is a user-definable small positive integer; e. partitioning said low resolution image, L n , into a set of K×K patches, L n,m each having K×K pixel values; f. setting J=NK, where both N is a user-definable small positive integer; g. partitioning said high resolution image, H n , into a set of J×J patches, H n,m , each having J×J pixel values, such that said K×K patch L n,m and said J×J patch H n,m both correspond to a same region in S n ; h. generating a feature vector, FL n,m , having K×K components, for each said K×K patch, L n,m ; and i. generating a J×J high resolution patch, H* n,m , for each said J×J patch, H n,m , by subtracting a mean pixel value of said corresponding K×K patch, L n,m , from each of said number of pixel values in said J×J patch, H n,m .