# Patent

## Title
Learning image templates for content anchoring and data extraction

## Abstract

Methods, and corresponding systems, of generating one or more image anchor templates for extracting data from a data field of a first class of documents are provided. The methods include generating one or more candidate image anchor templates from at least one of one or more exemplars of the first class; determining a quality score for each of the one or more candidate image anchor templates using a computer processor and known locations of the data field within the one or more exemplars of the first class; ranking the one or more candidate image anchor templates according to quality score; and selecting one or more of the most highly ranked image anchor templates.

## Background
BACKGROUND
The present exemplary embodiments disclosed herein relate generally to the extraction of data from documents. They find particular application in conjunction with the generation of image anchor templates for content anchoring, and will be described with particular reference thereto. However, it is to be appreciated that the present exemplary embodiments are also amenable to other like applications.
When dealing with a large number of documents, it is often desirable to quickly extract data from the documents. Typical solutions often rely upon template matching techniques to locate image anchor templates for content anchoring. The idea being that if one can locate one or more image anchor templates within a target image of a document, one can determine the location of a data field within the document based upon its relative location to the one or more image anchor templates.
To illustrate, consider the problem of identifying the address and social security number fields in a document. Even if the document is fixed, the processes of printing, faxing, and scanning the document introduce distortions into target images of the document. Therefore, the relevant fields cannot be found at fixed displacement from boundaries into the target images of the document. Rather they need to be located with respect to fixed content in the target images. It is this fixed content that defines image anchor templates.
In view of the foregoing illustration, it should be appreciated that one important aspect of typical solutions is that they depend upon the ability of the image anchor templates to offer relatively fixed points of reference from which to determine a data field. Consequently, image anchor templates are chosen such that they can be localized with a high degree of reliability and robustness. That is to say, image anchor templates are chosen for their ability to reliably provide a fixed point of reference within a target image of a document.
In choosing image anchor templates, typical solutions rely upon an operator to manually select image anchor templates that can reliably act as anchoring points. To aid operators, there are many user interface tools designed to help operators, especially in massive data processing scenarios. These typically allow operators to select regions of interest in exemplar images with the aim of cropping the selected regions and using them as image anchor templates. Nevertheless, regardless of whether operators are aided with a user interface, typical solutions still rely upon the skill and intuition of an operator to generate the image anchor templates.
This reliance on an operator, however, may lead to sub-par image anchor templates and/or a waste of time and resources due to the difficulty of picking image anchor templates. Namely, visual elements easily located by the human eye are not necessarily good candidates for image anchor templates. The converse also holds true. For example, think of different barcodes to indicate different fields. Even more, it is also difficult for an operator to predict how a particular image anchor template will match to different target images and/or whether an image anchor template will reliably offer an anchor point across multiple documents. As a result of these difficulties, an operator will generally have to undergo a trial and error process that takes time and resources.
In view of the deficiencies noted above, there exists a need for improved systems and/or methods of generating image anchor templates. The present application contemplates such new and improved systems and/or methods which may be employed to mitigate the above-referenced problems and others.
INCORPORATION BY REFERENCE
U.S. patent application Ser. No. 12/780,317 (U.S. Patent Application Publication No. 2011/0280451) for “Learning image anchor templates for document classification,” by Prateek Sarkar, filed on even date herewith, is hereby incorporated herein by reference in its entirety.
BRIEF DESCRIPTION
According to one aspect of the present application, a method is provided for generating one or more image anchor templates for extracting data from a data field of a first class of documents. The method begins by generating one or more candidate image anchor templates using one or more seed image anchor templates and/or at least one of one or more exemplars of the first class. Quality scores for each of the candidate image anchor templates are then determined using a computer processor and known locations of the data field within the exemplars of the first class. Based upon these quality scores, the candidate image anchor templates are ranked and one or more of the most highly ranked image anchor templates are selected.
According to another aspect of the present application, a system is provided for generating one or more image anchor templates for discriminating between documents of a first class and documents of other classes. The system includes a generator module, a template scoring module, a ranking module and a selection module. The generator module generates one or more candidate image anchor templates using one or more seed image anchor templates and/or at least one of one or more exemplars of the first class. The template scoring module determines a quality score for each of the candidate image anchor templates using a computer processor and known locations of the data field within the exemplars of the first class. The ranking module ranks the candidate image anchor templates according to the quality score. The selection module selects one or more of the most highly ranked image anchor templates.
According to another aspect of the present application, a method is provided for extracting data from a data field of a document belonging to a first class of documents. The method begins by generating one or more candidate image anchor templates using one or more seed image anchor templates and/or at least one of one or more exemplars of the first class. Quality scores for each of the candidate image anchor templates are then determined using a computer processor and known locations of the data field within the exemplars of the first class. Based upon these quality scores, the candidate image anchor templates are ranked and one or more of the most highly ranked image anchor templates are selected. Once the most highly ranked image anchor templates are selected, a location of the data field for each of the selected image anchor templates is predicted using a match location of the each of the selected image anchor templates to the document. Data is then extracted from the data field if the predicted locations of the data field for the selected image anchor templates have low variance.



BRIEF DESCRIPTION OF THE DRAWINGS
FIGS. 1A and 1B illustrate a template source;
FIG. 2 illustrates a method for generating one or more image anchor templates for extracting data from a data field of a first class of documents;
FIG. 3 illustrates the generation of candidate image anchor templates using several different candidate image anchor template generators;
FIG. 4 illustrates an ROC Curve;
FIG. 5 illustrates the generation of image anchor templates according to an embodiment of the method of FIG. 2;
FIG. 6 graphically illustrates the generation of image anchor templates according to an embodiment of the method of FIG. 2;
FIG. 7 illustrates an image anchor template generator employing the method of FIG. 2; and
FIG. 8 illustrates the use of a data extraction system having the image anchor template generator of FIG. 7.



DETAILED DESCRIPTION
The systems and methods, discussed in detailed hereafter, pertain to the automatic generation of one or more image anchor templates for extracting data from a data field of a first class of documents. Given exemplars of the first class having the data field labeled thereon, image anchor templates can be generated by generating candidate image anchor templates from at least one of the exemplars, determining a quality score for each of the candidate image anchor templates, ranking the candidate image anchor templates according to quality, and selecting a one or more of the most highly ranked image anchor templates. However, before discussing the systems and methods in detail, it is useful to discuss the notation and some basic building blocks.
An image anchor template t includes of image t.im and a region of interest t.roi. The template image t.im is a sub image Ta of a template source T,

t.im=Ta,

where a denotes the sub-region of the template source T. The sub-region a is specified relative to the coordinates of the template source T and, typically, the sub-region a will be an axes-parallel rectangular region. The region of interest t.roi, in contrast, is specified relative to the coordinates of a target image I. A target image I is an image matched against an image anchor template t.

In certain embodiments, the region of interest t.roi is specified relative to the upper left corner of the target image I. In other embodiments, the region of interest t.roi is specified relative to the boundaries of the target image I. To specify the region of interest relative to the boundaries of the target image one can specify the location of the region of interest using the following equations.

x=aw+x0 

y=βh+y0 

The width and height of the target image I are represented by w and h, respectively. Both α and β range from zero to one and represent a normalized position within the target image I. For example, α=1 and β=1 yield the bottom right corner of a target image I. Similarly, α=0.5 and β=0.5 yield the center of a target image I. The offset from the normalized position is represented by x0 and y0.

With reference to FIGS. 1A and 1B, a template source 100 is illustrated. The template source 100, as shown, is an empty form and includes an image anchor template 102. The image anchor template is comprised of a region of interest 104 and an image 106.
A template anchoring function A(t,I) takes an image anchor template t and a target image I, and explores a set of valid transformations of the template image t.im to find the closest resemblance of the template image t.im within the target image I. Valid transformations are restricted to the template region of interest t.roi and may include at least one of translations of the template image t.im, rotations of the template image t.im, scaling of the t.im, and affine transforms of the t.im. It should be appreciated, however, that other transformations of the template image t.im are equally amenable.
After locating a good resemblance within the target image I, a template anchoring function generally returns match results including a match score A(t,I).score and a match location A(t,I).x. In certain embodiments, the template anchoring function may also return the valid transformation corresponding to the best match and/or the best matching sub-image of the target image I.
A match score A(t,I).score is a score in the range of [0, 1], where zero indicates no match and one indicates a perfect match. A perfect match only exists if some sub-region of the target image/exactly matches pixel for pixel the template image t.im under a valid transformation. Further, if an image anchor template t matches multiple locations, the score is discounted by a factor that increases with the number of matches. Thus, the score returned by a template anchoring function A(t,I).score is typically, but not necessarily, a score that represents the “goodness” of the best match found.
A match location m(t,I).x is a location in the target image corresponding to the likely location of a data field. The determination as to the location of the target data field is made by using the known location of the data field relative to the image anchor template. For example, if a data field is known to be two units (e.g., inches) above the image anchor template, the match location is simply the matching location of the image anchor template corrected for this 2 unit displacement.
While any template anchoring function, subject to the restraints noted above, may be used, in certain embodiments, template anchoring functions are based on at least one of basic correlation measures with or without various kinds of normalization, probabilistic likelihoods or likelihood ratios (such as multi-level templates for Document Image Decoding), Hausdorff distance, and comparisons based on local measurement histograms (such as Earth Movers Distance).
When dealing with binary documents, template anchoring functions based on Hausdorff distance are of particular interest because said template anchoring functions are known to be fast and efficient when dealing with binary images. The Hausdorff distance between two images (e.g., a template image and a sub-image of a target image) is defined as the maximum distance between two corresponding foreground points after the template has been transformed by the most favorable valid transform to get the best match scenario.
Rucklidge et al. developed an efficient branch and bound based technique for locating templates in larger images by minimizing the Hausdorff distance between a set of template image points and a set of sub-image points. For more information, attention is directed to Daniel P. Huttenlocher and William J. Rucklidge, “A Multi-Resolution Technique for Comparing Images Using the Hausdorff Distance,” Technical Report TR 92-1321, Cornell University, 1992 and William Rucklidge, Efficient Visual Recognition Using the Hausdorff Distance (Springler-Verlag New York, Inc. Secaucus, N.J., USA, 1996), both of which are incorporated herein by reference in their entirety.
A composite image anchor template C is a collection of image anchor templates (t1, t2, . . . , tk). Similar to the template anchoring function described above, a composite template anchoring function A(C,I) returns a predicated localization and a score in the range of [0, 1], where the score represents the “goodness” of the match. However, in contrast with the template anchoring function described above, the composite template matching function considers how each of the image anchor templates match a target image/and the predicted locations for each of the image anchor templates.
A typical composite template anchoring function is obtained by defining a function over the individual template anchoring functions.

A(C,I)=f(A(t1,I),A(t2,I), . . . ,A(tk,I))

In certain embodiments, the composite template matching function returns the match score and the match location for the highest scoring image anchor template. In other embodiments, the composite template matching function returns the average of the match scores of the image anchor templates and the average of the match locations of the image anchor templates weighted by the respective match scores.

With reference to FIG. 2, a method 200 of generating one or more image anchor templates for extracting data from a data field of a first class of documents is illustrated. The method 200 includes generating candidate image anchor templates (Action 202), determining a quality score for each of the candidate image anchor templates (Action 204), ranking the candidate image anchor templates according to quality score (Action 206), and selecting one or more of the most highly ranked image anchor templates (Action 208). In certain embodiments, the method 200 further includes determining how to best describe an approximate location of the data field relative to page boundaries of the one or more exemplars using least squares regression (Action 210) and/or repeating Actions 202 through 208 until a termination condition is met (Action 212).
The method may optionally begin by determining how to best describe an approximate location of the data field relative to page boundaries of the one or more exemplars of the first class using least squares analysis (Action 210). An exemplar image is an image of an example document from a class (e.g., the first class) that is used for training the method 200. In choosing how to best describe an approximate location of the data field, the coordinate frame that leads to lowest (squared) spatial error is chosen. As will be seen, this allows the narrowing of the search space for image anchoring templates and the determination of the size of the region of interest for the image anchor templates generated in subsequent steps.
To determine how to best describe an approximate location of a data field relative to page boundaries, the best solution for the following equations is determined using a least squares analysis.

xuk=αwk+x0 

yuk=βhk+y0 

Herein, xuk and yuk correspond to the known location of the data field within the kth exemplar. Further, wk and hk correspond to the known page width and height for the kth exemplar. As should be appreciated, the foregoing equations are the same as those noted above for the description of a location relative to page boundaries.

Solving for the parameters α, β, x0, y0 using least squares regression, the parameters α, β, x0, y0 can be estimated as follows.



  
    
      α
      =
      
        
          
            n
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                
                  x
                  
                    u
                    k
                  
                
                ⁢
                
                  w
                  k
                
              
            
          
          -
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              
                x
                
                  u
                  k
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  w
                  k
                
              
            
          
        
        
          
            n
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                w
                k
                2
              
            
          
          -
          
            
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  w
                  k
                
              
              )
            
            2
          
        
      
    
    ⁢
    
      
    
  




  
    
      
    
    ⁢
    
      
        x
        0
      
      =
      
        
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              
                x
                
                  u
                  k
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  w
                  k
                  2
                
              
            
          
          -
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              
                w
                k
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  
                    x
                    
                      u
                      k
                    
                  
                  ⁢
                  
                    w
                    k
                  
                
              
            
          
        
        
          
            n
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                w
                k
              
            
          
          -
          
            
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  w
                  k
                
              
              )
            
            2
          
        
      
    
  




  
    
      β
      =
      
        
          
            n
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                
                  y
                  
                    u
                    k
                  
                
                ⁢
                
                  h
                  k
                
              
            
          
          -
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              
                y
                
                  u
                  k
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  h
                  k
                
              
            
          
        
        
          
            n
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                h
                k
                2
              
            
          
          -
          
            
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  n
                
                ⁢
                
                  h
                  k
                
              
              )
            
            2
          
        
      
    
    ⁢
    
      
    
  




  
    
      y
      0
    
    =
    
      
    
    ⁢
    
      
        
          
            ∑
            
              k
              =
              1
            
            n
          
          ⁢
          
            
              y
              
                u
                k
              
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                h
                k
                2
              
            
          
        
        -
        
          
            ∑
            
              k
              =
              1
            
            n
          
          ⁢
          
            
              h
              k
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                
                  y
                  
                    u
                    k
                  
                
                ⁢
                
                  h
                  k
                
              
            
          
        
      
      
        
          n
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              h
              k
            
          
        
        -
        
          
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                n
              
              ⁢
              
                h
                k
              
            
            )
          
          2
        
      
    
  



Herein, n corresponds to the number of exemplars having the data field labeled. Further, n, xuk, yuk, wk, hk are all known, whereby determining α,β,x0,y0 is a simple matter of “plugging in the numbers.”

Once α, β, x0, y0 are determined, the coordinate frame that leads to the lowest (squared) spatial error is known, whereby the approximate location of the data field is known in each of the exemplars based upon page boundaries. Advantageously, this allows a narrowing of the search space for image anchor templates to regions of the exemplars proximate the approximate location. The size and displacement of these regions proximate the approximate location is given by the neighborhood extent. In certain embodiments the neighborhood extent is simply the region centered around the approximate location and extending a predefined number of pixels in all directions. Additionally, in certain embodiments, these regions proximate the approximate location are extracted from the exemplars to define a collection of candidate images, which are used to generate image anchor templates. In other embodiments, the locations of these regions may simply be used during the generation of candidate image anchor templates, thereby removing the need to extract candidate images. Regardless of the embodiment used, however, it should be appreciated that the foregoing embodiments are more a matter of form than substance.
Building on the foregoing, since the approximate location of the data field is known relative to page boundaries of the exemplars, it follows that the approximate location of the data field in other documents belonging to the same class as the exemplars is roughly known. Consequently, the approximate location can be used to limit the regions of interest for the image anchor template generated herein. In certain embodiments, the width and height of the region of interest is set to a fixed multiple of the standard deviation of the x and y errors, respectively, from the least squares analysis discussed above.
Regardless of whether the approximate location of the data field was determined (Action 210), candidate image anchor templates are generated using a candidate image anchor template generator next (Action 202). A candidate image anchor template generator takes an image or an image anchor template and, in some embodiments, at least one of exemplar document images of the first class, exemplar document of the other classes, and a search restraint as input. Search restraints limit the regions of the input image searched for candidate image anchor templates. In certain embodiments, the input image is at least one of an exemplar document image of the first class and a candidate image from Action 210. In certain embodiments, locations of regions proximate the approximate location of the data field, determined in Action 210, are provided as a search restraint.
Based upon this input, the candidate image anchor template generator generates candidate image anchor templates. In certain embodiments, generating candidate image anchor templates entails extracting sub-regions from the input image and/or performing any number of valid transformations on the input image or the input image anchor template. Valid transformations include, but are not limited to, translations, rotations, affine transformations, etc. Under embodiments where the approximate location of the data field is determined (Action 210), the regions from which candidate image anchor templates can be extracted may be limited to those regions. Examples of candidate image anchor template generator include, but are not limited to, a coarse grid sampling generator, a seeded collection generator, and a transitive explorer generator.
The coarse grid sampling generator takes an input image and generates a coarse sampling of image anchor templates from the input image. In other words, the coarse grid sampling generator divides the input image into sub-regions and extracts the sub-regions into image anchor templates. In certain embodiments, image anchor templates whose pixels are almost all white or almost all black are discarded because they're intrinsically understood to have low discriminative power. To control the number of candidate image anchor templates generated by the coarse grid sampling generator, the size of image anchor templates to be extracted from the input image can be varied. Naturally, the smaller the size, the more image anchor templates.
With reference to FIG. 3a, the generation of candidate image anchor templates using the coarse grid sampling generator 302 is illustrated. As can be seen, the coarse grid sampling generator 302 receives an image 304 as input and outputs candidate image anchor templates 306.
The seeded collection generator (also called a perturbation generator) takes an image anchor template as input and generates new image anchor templates by performing valid transformations on the input image anchor template. Valid transformations include, but are not limited to, translations, rotations, affine transformations, etc. Thus, the seeded collection generator generates image anchor templates by exploring minor variations of the input image anchor templates. In certain embodiments, the seeded collection generator may explore variations of the region of interest of the input image anchor template.
With reference to FIG. 3b, the generation of candidate image anchor templates using the seeded collection generator 308 is illustrated. As can be seen, the seeded collection generator 308 receives an image anchor template 310 as input and outputs candidate image anchor templates 312.
The transitive explorer generator is a special kind of seeded collection generator that takes an image anchor template and exemplars as input and matches the image anchor template against the exemplars, where new image anchor templates are constructed by carving out the matches within the exemplars. In certain embodiments, the transitive explorer generator also explores valid transformations on the input image anchor template, similar to the seeded collection generator. Additionally, in certain embodiments, the transitive explorer generator generates an image anchor template by combining all the matches within the exemplars. In some of these embodiments, this is determined by identifying the most consistent pixels when all the matching locations are overlaid on one another.
With reference to FIG. 3c, the generation of candidate image anchor templates using the transitive explorer generator 314 is illustrated. As can be seen, the transitive explorer generator 314 receives an image anchor template 316 and exemplars 318 as input. After receiving this input, the transitive explorer generator outputs candidate image anchor templates 320.
Notwithstanding the enumerated image anchor template generators, other kinds of image anchor template generators are equally amenable. Additionally, image anchor template generators can be nested in various configurations to obtain new composite generators. For example, typically the seeded collection generator and/or the transitive explorer generator are used with the coarse grid sampling generator, where image anchor templates generated by the coarse grid sampling generator are used as input to the seeded collection generator and/or the transitive explorer generator.
Referring back to FIG. 2, regardless of how candidate image anchor templates are generated (Action 202), a quality score is determined for each of the candidate image anchor templates using a template scoring function (Action 204). The quality score of an image anchor template is a measure of its consistency, discriminability, and anchoring. Consistency refers to the ability of an image anchor template to consistently return high scores when the data field exists. Discriminability refers to the ability of an image anchor template to consistently return low scores when the data field does not exist. Anchoring refers to the ability of an image anchor template to predict the location of the data field with high confidence. As should be appreciated, anchoring requires an image anchoring template to be intrinsically localizable (i.e., non-repeating).
To facilitate the determination of a quality score, the template scoring function generally takes as input one or more exemplars of the first class (i.e., positive exemplars), where the exemplars have the data field labeled. An operator of the method 200 may for example, label the data field manually within each of the examples. In certain embodiments, the template scoring function may further take exemplars of other classes as input (i.e., negative exemplars). Exemplars allow the subject method to empirically determine the suitability of image anchor templates for localization.
Using the exemplars as input, quality scores may, but need not, be determined using intrinsic image anchor template characteristics and/or image anchor template response on a sample collection of exemplars. Image anchor template response may, for example, include empirical supervised estimates of quality, empirical unsupervised estimates of quality, empirical one-sided estimates of quality, and empirical one-sided estimates of template anchoring quality. As will become apparent, because the quality score of an image anchor template is a measure of its consistency, discriminability, and anchoring, in certain embodiments a template scoring function using empirical one-sided estimates of template anchoring quality is used with a template scoring function using empirical supervised estimates of quality and/or empirical unsupervised estimate of quality.
A template scoring function using intrinsic template characteristics looks for characteristics of templates that correlate with approximately known localization power. For example, all white or all black regions of a template source aren't likely to yield useful image anchor templates, whereby said image anchor templates may reasonably be assigned low quality scores. Other examples include, but are not limited to, continuous dark or white patches, half-tone patterns, and segments of straight lines, which are intrinsically understood as being unlikely to act as good anchors, and corners and most character shapes, which are intrinsically understood as being likely to act as good anchors. Naturally, the level of resolution of such a template scoring function is limited. However, it provides a quick way to efficiently prune the search space of image anchor templates.
A template scoring function using empirical supervised estimates of quality takes at least an image anchor template, positive exemplars images, and negative exemplars as input. It then looks to an image anchor template response on the exemplars and returns a numeric score corresponding to the discriminability of the image anchor template. Namely, for an image anchor template t and a matching function m(t,I), the matching scores for all the exemplars (positive and negative) are generated and used to generate a receiver operating characteristic (ROC) curve by varying the acceptance threshold q in a template detection function d(t,I).
An ROC curve is obtained by plotting a hit rate (i.e., the rate of true positives) against a false alarm rate (i.e., the rate of false positives) as the acceptance threshold q is varied. The hit rate for a given acceptance threshold q is simply the rate with which the template detection function d(t,I) correctly classifies an exemplar. Since sets of positive and negative exemplars are known, verification of the template detection function d(t,I) is easily obtained. In a similar manner, the false alarm rate is readily obtained. With reference to FIG. 4, an ROC curve is illustrated.
After generating the ROC curve, a quality score s for an image anchor template can then be calculated as follows.

s(t,m,α)=bestROC(t,m,α)areaROC(t,m)+margin(t,m)

The areaROC(t,m,α) is simply the area under the ROC curve (i.e., the shaded region of FIG. 4) and margin(t,m) is the difference between the smallest matching score for a positive exemplar and the largest matching score for a negative exemplar. Further, the bestROC(t,m,α) is defined as

bestROC(t,m,α)=maxq(hitRate(q)−α*falseAlarmRate(q)),

where the hitRate(q) and the falseAlarmRate(q) are substantially as described above and α is a penalty for false alarms. The higher α is, the greater the penalty for false alarms.

A template scoring function using empirical unsupervised estimates of quality looks to an image anchor template response on a sample collection of exemplars. Similar to the empirical supervised estimate of quality, this template scoring function returns a numeric score corresponding to the discriminability of the image anchor template. It is targeted to situations where there are multiple target categories and the category labels for a collection of exemplars are known, but a determination has not been made as to how to split up the categories. In such a case, a template's quality score is the mutual information between the matching/detection result and the image category label.
A template scoring function using empirical one-sided estimates of quality looks to an image anchor template response on a sample collection of only positive exemplars and returns a numeric score corresponding to the consistency of the image anchor template. This is in contrast with the empirical supervised and unsupervised estimates of quality which consider both positive and negative exemplars. One definition of one-sided metric is as follows.




  
    o
    ⁡
    
      (
      
        t
        ,
        m
      
      )
    
  
  =
  
    
      ∑
      
        I
        ⁢
        
          
        
        ⁢
        ε
        ⁢
        
          
        
        ⁢
        positive
        ⁢
        
          
        
        ⁢
        exemplars
      
    
    ⁢
    
      prob
      ⁡
      
        (
        
          
            positive
            ⁢
            
              
            
            ⁢
            category
          
          ❘
          
            m
            ⁡
            
              (
              
                t
                ,
                I
              
              )
            
          
        
        )
      
    
  




Each probability on the right-hand side can be computed using Bayes' rule with equal priors starting from the following formula.

prob(m)(t,I)|positive category)∝e−λpos*m(t,I) 

prob(m(t,I)|negative category)∝e−λneg*(1-m(t,I)) 

As should be appreciated, the parameters λ can be trained. However, due to space considerations, in certain embodiments λpos and λneg set to one, thereby giving the negative category a flatter distribution.

A template scoring function using empirical one-sided estimates of template anchoring quality looks to an image anchor template response on a sample collection of only positive exemplars. It combines consistency and anchoring capability into a single numeric score based on which candidate image anchor templates can be ranked or pruned. However, it should be appreciated that it does not consider discriminability.
Let the subscript k be the index variable that represents different positive examples of a location to be extracted from documents of the first class, where uk(lk) is the known location in the kth example. Further, for an image anchor template t, let xk denote the predicted location and let sk be the corresponding confidence score.

sk=A(t,lk).score

xk=A(t,lk).x 

Without loss of generality, if it is assumed that (xk,sk) is sorted in decreasing order of s (most confident predictions first), the one-sided estimate of template anchoring quality can be defined as follows.





  
    oa
    ⁡
    
      (
      
        t
        ,
        A
      
      )
    
  
  =
  
    
      ∑
      k
    
    ⁢
    
      
        s
        k
      
      *
      
        e
        
          -
          
            
              ∑
              
                j
                ≤
                k
              
            
            ⁢
            
              
                
                  (
                  
                    
                      x
                      k
                    
                    -
                    
                      u
                      k
                    
                  
                  )
                
                2
              
              k
            
          
        
      
    
  




Although a number of template scoring functions were described above, it should be appreciated that other template score functions are equally amenable. For example, composite template scoring functions building on the templates scoring function enumerated above and/or other templates scoring functions may be used. Additionally, while the template scoring functions discussed above were defined for single image anchor templates, it should be appreciated the template scoring functions may be used for composite templates.
Once quality scores for the candidate image anchor scores are generated (Action 204), the candidate image anchor templates are ranked according to the quality scores (Action 206) and one or more of the most highly ranked candidate image anchor templates are selected (Action 208). An operator may manually set the number of candidate image anchor templates.
In certain embodiments, the method 200 is complete at this point. In such embodiments, the selected image anchor templates are the best image anchor templates found for data extraction. In other embodiments, however, the method 200 may continue on. Namely, as noted above, after the image anchor templates are selected the method 200 may optionally repeat, subject to the conditions noted below, Actions 202 through 208 until a termination condition is met (Action 212). Under these embodiments, iterations may vary from iteration to iteration. For example, the image anchor template functions and/or the template scoring functions may vary.
With respect to the termination condition, in certain embodiments, the termination condition is an elapsed run time and/or run a predefined number of iterations. For example, the method 200 may run for five seconds before terminating. In other embodiments, the termination condition is whether the selected image anchor templates cover all the exemplars of the first class. In other words, whether the selected image anchor templates are able to correctly determine the location of the data field in all the exemplars of the first class.
Under the latter termination condition, if there are exemplars of the first class which are not covered by selected image anchor templates, those exemplars may be used for generating image anchor templates in the next iteration. For example, the exemplars which are not covered may be used as input into the coarse grid sampling generator. Alternatively, or in addition, image anchor templates derived from the exemplars not covered may be used as input to the seeded collection generator and/or the transitive explorer generator, whereby these image anchor templates act as seed image anchor templates.
Notwithstanding the exemplary termination conditions noted above, it should be appreciated that other termination conditions are equally amenable and a termination condition may be a composite of individual termination conditions. For example, a termination condition may use both elapsed time and whether the selected image anchor templates are able to correctly determine the location of the data field in all the exemplars of the first class.
With respect to repeating, Actions 202 through 208 are repeated substantially as described above. One notable exception to this, however, is that new candidate image anchor templates are ranked with the image anchor templates previously selected. In other words, the best image anchor templates from the previous iteration are ranked together with the newly generated candidate image anchor templates from the current iteration. Additionally, as suggested above, one or more of the most highly ranked candidate image anchor templates from the previous iteration may be used as input for the generation of new candidate image anchor templates at Action 202.
To illustrate, an iterative example of the method is as follows. Using the coarse grid sampling generator, an initial set of candidate image anchor templates are generated from an exemplar of the first category. The quality scores for these candidate image anchor templates are then determined and the candidate image anchor templates are ranked. From this ranking the top two hundred image anchor templates are selected. Assuming the termination condition is not met (e.g., the elapsed time has not run), the selected image anchor templates are used to generate additional image anchor templates with the seeded collection generator and/or the transitive explorer generator. The quality scores for these newly generated image anchor templates are then generated and the newly generated image anchor templates are ranked with the previously selected image anchor templates. From this ranking the top two hundred image anchor templates are selected. Assuming the termination condition is met, these top two hundred image anchor templates represent the end result of the method.
In order to improve the performance of the method 200 described above, a number of options are available. Examples include, but are not limited to, adjusting the coarseness of the grid sampling generator, working on images subsampled by a factor of two, capping the maximum number of image anchor templates that will be tested against negative exemplars, reducing the region within which image anchor templates are searched, reducing the number of exemplars (positive and/or negative) that will be tested, altering the parameters of the matching function (e.g., Hausdorf matching).
With respect to reducing the region within which image anchor templates are searched, at least two methodologies include a method based upon intrinsic template characteristics and a histogram based method. Intrinsically, it may be clear from the exemplars of the first class that only certain areas of the exemplars are likely to yield useful image anchor templates. Accordingly, the search for image anchor templates can be limited by, for example, limiting the search for image anchor templates to the upper and/or lower halves of the exemplars. Alternatively, or in addition, a more sophisticated method for limiting the region within which image anchor templates are searched is to use a histogram based approach.
According to the histogram based approach, after examining the first few hundred template matches on a target image, there are enough clues to guess the possible displacements at which to find other template matches. For example, suppose there are a few thousand image anchor templates to match against a positive exemplar image. By initially searching for image anchor template matches over a large space of possible displacements and continually populating a histogram over displacements at which matches are found, after a few matches (say a hundred) the smallest bounding rectangle that contains 95% or more of the matches so far can be identified. The remaining templates can then be matched only within this tighter rectangle of relative displacements.
Regardless of whether any optimizations are used, once the method 200 is complete, one can easily use the image anchor templates to extract data from documents by matching the image anchor templates to the documents and determining the location of the data field. Namely, to extract data from a data field of a document, the image anchor templates are all applied to the document and, if the predictions of the location of the data field are all very similar, the data field is found and the data is extracted. Other uses beyond data extraction include, but are not limited to, altering documents, producing new documents, triggering some processing, or even simply categorizing documents.
In view of the foregoing, it is to be appreciated, that the method 200 may use composite image anchor templates in place of individual image anchor templates. Additionally, operator input may be received at any of the Actions noted above to control their behavior. For example, when performing an iterative variant of the method 200, the operator may provide input as to how candidate image anchor templates are generated for each iteration.
With reference to FIG. 5, the generation of image anchor templates according to a specific embodiment of the method of FIG. 2 is illustrated. Initially, exemplars 502 having the data field labeled are used to estimate (or approximate) 504 the location of the data field with respect to page boundaries (See Action 210 of FIG. 2). The operator of the method of FIG. 2 may manually label the exemplars 502 with the data field. Thereafter, portions of the exemplars 502 proximate the estimated data field location are used to generate candidate images 506. Candidate images 506 refer to sub-regions of the exemplars within the neighborhood 508 of the estimated location.
From these candidate images 506 and the estimated data field location, candidate image anchor templates 510 are generated. Namely, sub-regions of the candidate images 506 are carved out and used to generate the template images for the candidate image anchor templates 510. Further, the regions of interest for the image anchor templates 510 are generated 512 using the estimated location of the data field. For example, the width and height of the region of interest is set to a fixed multiple of the standard deviation of the x and y errors, respectively, from the least squares regression. In certain embodiments, the coarse grid sampling generator is used.
Once the candidate image anchor templates are generated, candidate image anchor templates are ranked 514 using empirical one-sided estimates of quality, which require the exemplars 502. Thereafter, a predefined number of the most highly ranked image anchor templates are selected 516 and expanded 518 using the transitive explorer generator. This expanded set of image anchor templates includes the selected image anchor templates and the image anchor templates generated by the transitive explorer generator. The expanded set of image anchor templates is then ranked 520 using empirical one-sided estimates of quality and a predefined number of the most highly ranked image anchor templates are selected 522, where these image anchor templates correspond to the best image anchor templates 524 generated.
As should be appreciated, FIG. 5 can be characterized as an iterative variant of the method 200 of FIG. 2. Namely, the expansion noted above, can be characterized as the generation of image anchor templates using the selected image anchor templates from the previous iteration, whereby the selected image anchor templates act as seeds for the transitive explorer generator.
With reference to FIG. 6, a graphical illustration of the method 200 of FIG. 2 is illustrated. Namely, FIG. 6a shows exemplars 602 having the data field 604 labeled by a box 606. As noted above, this will often be performed by the operator of the method 200. FIG. 6b shows two image anchor templates 608 generated in accordance with the method 200 of FIG. 2, where the image anchor templates 608 are matched to two documents 610 for data extraction. As can be seen, each image anchor template 608 includes a region of interest 612 and a template image 614. Further, each image anchor template 608 predicts the upper left hand corner of the data field 602 as beginning at circles 616. Although not shown, in other embodiments, image anchor templates can be provisioned to consider different corners of the data field. For example, forty image anchor templates can be generated to determine the upper left and corner and forty image anchor templates can be generated to determine the lower right corner.
With reference to FIG. 7, an image anchor template (IAT) generator 700 employing the method of FIG. 2 is illustrated. A computer 702 or other digital processing device, including storage and a digital processor, such as a microprocessor, microcontroller, graphic processing unit (GPU), etc., suitably embodies the IAT generator 700. In other embodiments, the IAT generator 700 is embodied by a server including a digital processor and including or having access to digital data storage, such server being suitably accessed via the Internet or a local area network, or by a personal data assistant (PDA) including a digital processor and digital data storage, or so forth.
The computer or other digital processing device suitably includes or is operatively connected with one or more user input devices such as an illustrated keyboard 704 for receiving user input to control the IAT generator 700, and further includes or is operatively connected with one or more display devices such as an illustrated display 706 for displaying output generated based on the output of the IAT generator 700. In other embodiments, the input for controlling the IAT generator 700 is received from another program running previously to or concurrently with the IAT generator 700 on the computer 702, or from a network connection, or so forth. Similarly, in other embodiments the output may serve as input to another program running subsequent to or concurrently with the IAT generator 700 on the computer, or may be transmitted via a network connection, or so forth.
The IAT generator 700 includes a generator module 708, a template scoring module 710, a ranking module 712 and a selection module 714. In certain embodiments, where the system supports describing locations relative to page boundaries, the system further includes a boundary module 716. In other embodiments, where the system supports iterative variants of the method of FIG. 2, the system further includes a termination module 718.
As noted above, in some embodiments, the IAT generator 700 includes a boundary module 716, whereby the IAT generator 700 supports describing locations relative to page boundaries. In such embodiments, the boundary module 716 receives exemplars having the data field labeled thereon from an external source and determines how to best describe an approximate location of the data field relative to page boundaries of the exemplars. As noted above, this is accomplished using a least squares analysis. The external source may, for example, be an operator of the IAT generator 700, where the operator is presented with a user interface on the display 706 that allows them to identify the location of the data field of an exemplar. This approximate location is then used to limit the generation of image anchor templates to regions of the exemplars proximate the approximate location and/or to limit the regions of interest for the candidate image anchor templates to regions proximate the approximate location. The generator module 716 preferably determines the approximate location of the data field as described in connection with Action 210 of FIG. 2.
The generator module 708 receives an image or an image anchor template as input and generates candidate image anchor templates therefrom. In certain embodiments, the generator module 708 receives input from a source external to the IAT generator 700. The source may be, for example, a database, another program, the operator, etc. Under such embodiments, the generator module 708 generally receives one or more exemplars of the first class, which are used with the coarse grid sampling generator to generate image anchor templates. In other embodiments, the generator module 708 receives input from the termination module 716. Under such embodiments, the generator module 708 generally receives one or more image anchor templates, which are used with the seeded collection generator and/or transitive explorer generator. In other embodiments, the generator module 708 receives portions of the exemplars from the boundary module 716, where these portions are portions of the exemplars within the neighborhood of the approximate location. In such embodiments, the generator module 708 may further use the approximate location of the data field to limit the region of interest for the image anchor templates. The generator module 708 preferably generates candidate image anchor templates as described in connection with Action 202 of FIG. 2.
The template scoring module 710 receives the candidate image anchor templates from the generator module 708 and determines quality scores for each of the candidate image anchor templates. In certain embodiments, the template scoring module 710 further receives exemplars of the first class and/or exemplars of the other classes from a source external to the IAT generator 700 and/or the generator module 708. For example, if the template scoring module 710 is using empirical one-sided estimates of template anchoring quality it will receive positive exemplars of the first class. In some embodiments, positive exemplars received by the template scoring module 710 have the data field labeled. Similar to the generator module 708, the template scoring module preferably generates quality scores as described in connection with Action 204 of FIG. 2.
The ranking module 712 next receives the candidate image anchor templates, and corresponding quality scores, and ranks the candidate image anchor templates according to the quality scores. As will be noted below, in certain embodiments, the ranking module 712 also receives image anchor templates from previous iterations and ranks these image anchor templates with the image anchor templates received from the template scoring module 710.
The selection module 714 uses the ranked candidate image anchor templates to select one or more of the most highly ranked image anchor templates. For example, the selection module 714 may select the two hundred most highly ranked image anchor templates. Preferably, the ranking module 712 and the selection module 714 act as described in connection with Action 206 and Action 208 of FIG. 2, respectively.
In some embodiments, the IAT generator 700 further includes a termination module 718, as noted above, whereby the IAT generator 700 behaves iteratively to generate image anchor templates. In such embodiments, the termination module 718 determines whether a termination condition is met. If the termination condition is not met, the termination module 718 coordinates with the generator module 708 to generate a new set of image anchor templates, which are then scored by the template scoring module 710 and ranked with previously selected image anchor templates by the ranking module 712. A new set of image anchor templates are then selected by the selection module 714 and the termination module 718 again determines whether to terminate. The termination module 718 preferably acts as described in connection with Actions 210 and 212 of FIG. 2.
If the termination condition is met or the IAT generator 700 lacks a termination module 718, the selected image anchor templates from the selection module 714 are then output for display, printout and/or implemented into additional decision making mechanisms, such as data extraction. With respect to data extraction, the image anchor templates may be used to localize a data field within documents, thereby allowing extraction of the data therein.
With reference to FIG. 8, the use of a data extraction system 800 is illustrated. The system 800 includes an imaging device 802, an image anchor template generator 804 and a data extractor 806. The imaging device 802 converts a document, such as a form, into a target image and may be a camera, scanner, or other like device. The image anchor template generator 804 is as described in FIG. 7, unless noted otherwise. The data extractor 806 extracts data from a target image of a document using image anchor templates.
Before data extraction can begin, exemplars 808 are provided to the image anchor template generator 804. At a minimum, positive exemplars are provided to the image anchor template generator 804 having the data field labeled thereon. However, depending upon the image anchor template scoring function used, negative exemplars may also be provided to the image anchor template generator. In certain embodiments, the operator of the system 800 manually identifies the data field within the exemplars. Thereafter, the image anchor template generator 804 takes the exemplars 808 and generates image anchor templates 810, as discussed in connection with FIG. 7.
After the image anchor templates are generated 810, the system 800 begins extracting data from documents. Namely, the scanning device 802 receives one or more documents 812 and converts them to target images 814. In certain embodiments, the documents 812 are loaded into a feed tray of a printing device and passed through the imaging device 802 via a conveyor path.
The target images 814 are then passed to the data extractor 806 and the data extractor 806 uses the image anchor templates 810 from the image anchor template generator 804 to locate the data field within the target images 814 and extract the corresponding data. The target images 814 may be passed to the data extractor 806 contemporaneously with the conversion of the documents 812 or after all the documents 812 are converted.
Once the data extractor 806 has attempted to extract data from the documents 812, the documents 812 and/or the target images 814 are processed as necessary. For example, the documents 812 may be routed via conveyer paths to a destination based upon whether data was extracted. Alternatively, or in addition, the target images 812 may be stored in a database and/or stored within a file system according to whether data was extracted. Beyond the target images 814 and the documents 812, extracted data may be stored to a database, such as a SQL database, a relational database, etc.
In view of the discussion heretofore, in some embodiments, the exemplary methods, the IAT generator employing the same, and so forth, of the present invention are embodied by a storage medium storing instructions executable (for example, by a digital processor) to implement the determination of image anchor templates. The storage medium may include, for example: a magnetic disk or other magnetic storage medium; an optical disk or other optical storage medium; a random access memory (RAM), read-only memory (ROM), or other electronic memory device or chip or set of operatively interconnected chips; an Internet server from which the stored instructions may be retrieved via the Internet or a local area network; or so forth.
Further, it will be appreciated that various of the above-disclosed and other features and functions, or alternatives thereof, may be desirably combined into many other different systems or applications. Also that various presently unforeseen or unanticipated alternatives, modifications, variations or improvements therein may be subsequently made by those skilled in the art which are also intended to be encompassed by the following claims.

## Claims

1. A method of generating one or more image anchor templates for extracting data from a data field of a first class of documents, said method comprising:
a) generating one or more candidate image anchor templates using one or more seed image anchor templates and/or at least one of one or more exemplars of the first class;
b) determining a quality score for each of the one or more candidate image anchor templates using a computer processor and known locations of the data field within the one or more exemplars of the first class;
c) ranking the one or more candidate image anchor templates according to quality score; and
d) selecting one or more of the most highly ranked image anchor templates.

2. The method of claim 1, wherein the one or more generated image anchor templates are composite image anchor templates.

3. The method of claim 1, wherein the generating includes using a grid sampling generator on the at least one of the one or more exemplars of the first class.

4. The method of claim 1, further comprising:
e) generating one or more expanded candidate image anchor templates using at least one of the one or more of the most highly ranked image anchor templates;
f) determining a quality score for each of the one or more expanded candidate image anchor templates using a computer processor and known locations of the data field within the one or more exemplars of the first class;
g) ranking the one or more expanded candidate image anchor templates with the one or more of the most highly ranked image anchor templates according to quality score; and
h) selecting one or more of the most highly ranked image anchor templates from g).

5. The method of claim 4, wherein the generating of a) includes using a grid sampling generator, wherein the generating of e) includes using a perturbation generator and/or a transitive explorer generator.

6. The method of claim 1, wherein the generating includes using a perturbation generator and/or a transitive explorer generator on at least one of the one or more candidate image anchor templates.

7. The method of claim 1, wherein the quality score for the each of the one or more candidate image anchor templates is determined using Hausdorff distance.

8. The method of claim 1, wherein the quality score for the each of the one or more candidate image anchor templates is based upon the ability of the each of the one or more candidate image anchor templates to predict location of the data field.

9. The method of claim 1, wherein the one or more image anchor templates for extracting data include the one or more of the most highly ranked image anchor templates.

10. The method of claim 1, further comprising:
e) repeating actions a) through d) until a termination condition is met, wherein the one or more candidate image anchor templates are ranked with the one or more of the most highly ranked image anchor templates previously selected.

11. The method of claim 10, wherein the one or more seed image anchor templates include at least one of the one or more of the most highly ranked image anchor templates.

12. The method of claim 1, wherein the generating is limited to a padded area surrounding the data field.

13. The method of claim 12, wherein the one or more candidate image anchor templates generated using the at least one of one or more exemplars of the first class are generated from portions of the at least one of one or more exemplars of the first class surrounding the approximate location.

14. The method of claim 12, wherein the quality score for the each of the one or more candidate image anchor templates is based upon matching the each of the one or more candidate image anchor templates to the one or more exemplars, wherein the matching is limited to portions of the one or more exemplars surrounding the approximate location.

15. The method of claim 1, further comprising:
determining how to best describe an approximate location of the data field relative to page boundaries of the one or more exemplars of the first class using least squares regression.

16. A system of generating one or more image anchor templates for extracting data from a data field of a first class of documents, said system comprising:
a generator module that generates one or more candidate image anchor templates from at least one of one or more exemplars of the first class;
a scoring module that determines a quality score for each of the one or more candidate image anchor templates using a computer processor and known locations of the data field within the one or more exemplars of the first class;
a ranking module that ranks the one or more candidate image anchor templates according to quality score; and
a selection module that selects a one or more of the most highly ranked image anchor templates.

17. The system of claim 16, wherein the one or more generated image anchor templates are composite image anchor templates.

18. The system of claim 16, wherein the generator module uses at least one of a grid sampling generator, a perturbation generator and a transitive explorer generator.

19. The system of claim 16, wherein the quality score for the each of the one or more candidate image anchor templates is based upon the ability of the each of the one or more candidate image anchor templates to predict location of the data field.

20. A method of extracting data from a data field of a document belonging to a first class of documents, said method comprising:
a) generating one or more candidate image anchor templates from at least one of one or more exemplars of the first class;
b) determining a quality score for each of the one or more candidate image anchor templates using a computer processor and known locations of the data field within the one or more exemplars of the first class;
c) ranking the one or more candidate image anchor templates according to quality score;
d) selecting one or more of the most highly ranked image anchor templates;
e) predicting a location of the data field for each of the selected image anchor templates using a match location of the each of the selected image anchor templates to the document; and
f) extracting data from the data field if the predicted locations of the data field for the selected image anchor templates have low variance.