Recognition template enhancement

Abstract: A library of L unenhanced images (pixel bit maps) is enhanced for optical character recognition (OCR) with respect to a pre-existing group of G input symbol classes for creating a library of G recognition enhanced templates (pixel bit maps) of the G input symbol classes. The enhancement is accomplished by comparing each image of the library with each pixel version of each symbol class (forming V sets of L comparisons), and weighting the images with the highest potential for confusion. Divergent pixel version are further divided into sub-classes, each with a sub-image which evolves into a sub-template. A primary comparison C* and a secondary comparison C** are identified from the L comparisons within each of the V sets of comparisons. A recognition margin is determined between each pair of identified comparisons C* and C**. The single pair of identified comparisons C* and C** is selected forming the smallest recognition margin M*. The single pair of images I j * and I j ** underlying the pair of identified comparisons C* and C** is identified. Certain pixels of the closest pixel image I j * and the next closest pixel image I j ** are weighted in order to increase the recognition margin M* therebetween. The steps are iterated until the library of pixel images (and sub-images) has become a library of enhanced symbol templates (and sub-templates). The weighted pixel abberations generated in the enhanced templates (and sub-templates) are not present in the corresponding symbol of the pre-existing group of G input symbol classes (and sub-classes).

Description: This invention relates to optical character recognition of classes of input symbols, and more particularly to the enhancement of pixel templates in response to multiple pixel versions within the symbol classes. Heretofore, correlation coefficients have been employed to identify incoming pixel images such as radar return signals and character bit maps. The input pixel images were compared to library template images on a pixel by pixel basis. The summation of all of the pixel comparisons in each image/template match produced a correlation coefficient indicating the closest match. However, these prior correlation techniques did not involve any change or enhancement of the pixels forming the library templates. European patent application EP-A-586 217 entitled Method and Apparatus for Recognition Template Enhancement shows enhancement of library templates without provision for sub-classes of font versions. US-A-3191150 discloses a specimen identification system where reference patterns are adaptively and non-adaptively stored. The adaptive storage is altered when the specimens do match the adaptive stored reference patterns. In accordance with a first aspect, the present invention provides a method of recognition enhancement of a library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L } with respect to a pre-existing group of G classes of symbols {S 1 S 2 S 3 ... S i ... S G } at least some of which include multiple pixel versions of the same symbol, for providing a library of G recognition enhanced pixel templates {T 1 T 2 T 3 ... T i ... T G }, one enhanced template corresponding to each of the symbol classes, the method comprising the steps of: providing the library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L }; providing the group of G symbol classes {S 1 S 2 S 3 ... S i ... S G } with the multiple pixel versions therein, giving a total of in pixel versions; comparing each of the V pixel versions with each of the L unenhanced pixel images to obtain VxL comparisons forming V sets of L comparison {C 1 C 2 C 3 ... C j ... C L }, one set of L comparisons for each of the V pixel versions, each set of comparisons having a comparison C i for each unenhanced pixel image I j ; identifying a primary comparison C* from the L comparisons within each of the V sets of comparison having the closest comparison with the pixel version for that set of comparisons forming a collection of V primary comparison C* {C 1 * C 2 * C 3 * ... C i * ... C V *}; identifying the secondary comparison C** from the L-1 remaining comparisons within each of the V sets of comparisons having the next closest comparison with the pixel version for that set of comparisons forming a collection of V secondary comparisons C** {C 1 ** C 2 ** C 3 ** ... C i ** ... C V **}, to provide V pairs of identified comparisons C* and C**, one pair from each of the V sets of comparisons; determining V recognition margins {M 1 M 2 M 3 ... M 1 ... M V }, one recognition margin between each pair of identified comparisons C* and C**; selecting the single pair of identified comparisons C* and C** having the smallest recognition margin M* of all of the V pairs of identified comparisons from the V sets of comparisons; identifying the single pair of pixel images I* and I** corresponding to the selected single pair of identified comparisons C* and C**; weighting certain pixels of the closest pixel image I* and/or the next closest pixel image I** corresponding to the selected single pair of identified comparisons C* and C** in order to incrementally increase the recognition margin M* therebetween causing the pixel image I* to become the closest enhanced pixel template I* and/or the pixel image I** to become the next closest enhanced pixel template T**; iterating the comparing, identifying, determining selecting and weighting steps until the library of pixel images has become the library of enhanced symbol templates {T 1 T 2 T 3 ... T i ... T G } at least some of which have weighted pixel aberations not present in the pixel version within each of the pre-existing group of G corresponding symbol classes {S 1 S 2 S 3 ... S i ... S G }. In accordance with a second aspect, the present invention provides apparatus for recognition enhancement of a library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L } with respect to a pre-existing group of G classes of symbols {S 1 S 2 S 3 ... S i ... S G } at least some of which include multiple pixel versions of the same symbol, for providing a library of G recognition enhanced pixel templates {T 1 T 2 T 3 ... T i ... T G }, one enhanced template corresponding to each of the symbol classes, the apparatus comprising: first storage means storing the library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L }; second storage means storing the group of G symbol classes {S 1 S 2 S 3 ... S i ... S G } with the multiple pixel versions therein, giving a total of V pixel versions; comparing means for comparing each of the V pixel versions with each of the L unenhanced pixel images to obtain VxL comparisons forming in sets of L comparison {C 1 C 2 C 3 ... C j ... C L }, one set of L comparisons for each of the V pixel versions, each set of comparisons having a comparison C i for each unenhanced pixel image I j ; first identifying means for identifying a primary comparison C* from the L comparisons within each of the V sets of comparison having the closest comparison with the pixel version for that set of comparisons forming a collection of V primary comparison C* {C 1 * C 2 * C 3 *... C i * ... C V *}; second identifying means for identifying the secondary comparison C** from the L-1 remaining comparisons within each of the V sets of comparisons having the next closest comparison with the pixel version for that set of comparisons forming a collection of V secondary comparisons C** {C 1 ** C 2 ** C 3 ** ... C i ** ... C V **}, to provide V pairs of identified comparisons C* and C**, one pair from each of the V sets of comparisons; determining means for determining V recognition margins {M 1 M 2 M 3 ... M i ... M V }, one recognition margin between each pair of identified comparisons C* and C**; selecting means for selecting the single pair of identified comparisons C* and C** having the smallest recognition margin M* of all of the V pairs of identified comparisons from the V sets of comparisons; third identifying means for identifying the single pair of pixel images I* and I** corresponding to the selected single pair of identified comparisons C* and C**; and weighting means for weighting certain pixels of the closest pixel image I* and/or the next closest pixel image I** corresponding to the selected single pair of identified comparisons C* and C** in order to incrementally increase the recognition margin M* therebetween causing the pixel image I* to become the closest enhanced pixel template T* and/or the pixel image I** to become the next closest enhanced pixel template T**; wherein said comparing means, said first, second and third identifying means, said determining means, said selecting means and said weighting means are iteratively operatable until the library of pixel images has become the library of enhanced symbol templates {T 1 T 2 T 3 ... T i ... T G } at least some of which have weighted pixel aberations not present in the pixel version within each of the pre-existing group of G corresponding symbol classes {S 1 S 2 S 3 ... S i ... S G }. Embodiments of the present invention will now be described with reference to the accompanying drawings, in which: FIGURE 1A is a comparison matrix (general case) showing VxL comparisons between pixel versions within a group of G symbol classes and a library of L images (unenhanced templates); FIGURE 1B is a VxL comparison matrix between the lower-case pixel versions of the letters a-z and a library of lower-case images (unenhanced templates) illustrating the "oce" cluster of anti-characters; FIGURE 2 is a flow chart showing the steps in the method of template enhancement; FIGURE 3A is a bar graph of the set of initial image comparison coefficients between the single lower-case input version "o 2 " and the lower-case letters a-z of Figure 1B; FIGURE 3B is a bar graph of the set of advanced template comparison coefficients between the lower-case input version "o 2 " and the lower-case letters a-z; FIGURES 4A and 4B are bar graphs for the lower-case input version "c 2 " similar to Figures 3A and 3B; FIGURES 5A and 5B are bar graphs for the lower-case input version "e 2 " similar to Figures 3A and 3B; and FIGURES 6a, 6b, and 6c shows six pixel versions forming three sub-classes of the symbol class "F" (uppercase); FIGURE 7 is a comparison matrix showing the pixel versions and sub-classes of Figure 6; and FIGURE 8 is a block diagram of a hardware system for accomplishing the recognition enhancement shown in figure 2. GENERAL METHOD OF ENHANCEMENT - (Figures 1A 1B and 2) A library of L unenhanced images or templates (pixel bit maps) is enhanced for optical character recognition (OCR) with respect to a pre-existing group of G input symbol classes. The enhancement creates a library of G recognition enhanced templates (pixel bit maps) of the G input symbols, one enhanced template corresponding to each symbol class. Some of the Symbol classes include multiple pixel versions of the same symbol, resulting in a total number of pixel versions "V". The enhancement is accomplished by comparing each unenhanced template of the library with each input pixel version of each symbol class (forming VxL comparisons), and weighting the unenhanced templates having the highest potential for confusion. The library of L unenhanced initial templates extends along the vertical axis of the VxL comparison matrix of Figure 1A (shown as images I 1 I 2 ... I j ... I L ). The pre-existing group of G symbol classes extends along the horizontal axis of the VxL matrix (shown as general symbol classes S 1 S 2 ... S i ... S G ). The "V" input pixel versions are shown in association with each symbol class. In the embodiment of Figure 1A, the input pixel versions are illustrated by three general alpha-numeric fonts extending along the horizontal axis beginning with the symbol class "S1" and the three pixel versions "s 11 ", "s 12 ", and "s 13 ". The library of G recognition enhanced templates (T 1 T 2 T 3 ... T i ... T G ) is not represented in the VxL matrix. However, the three sets of version/image comparisons for the library of G recognition enhanced templates extend along the diagonal of the VxL matrix (shown as template comparisons T 111 T 121 T 131 , T 212 T 222 T 232 ... T i1j T i2j T i3j ... T G1L T G2L T G3L ). The input pixel versions correspond to the unenhanced initial templates or images of the G recognition enhanced templates. This diagonal template relationship assumes that the symbol classes and images are presented along each axis in the same order, that is S i = I j , and S i+1 = I j+1 . A comparison matrix for lower-case symbol classes a-z (also three fonts) is shown in Figure 1B, specifically illustrating the version/image comparisons for the cluster of look-alike characters "o", "c", and "e". The steps of the template enhancement method are summarized in Figure 2, and described in detail below. Providing the library of L unenhanced pixel templates or images (I 1 I 2 I 3 ... I j ... I L ) which will evolve into the distinctive library of G enhanced templates. Providing the group of G symbol classes (S 1 S 2 S 3 ... S i ... S G ) with multiple pixel versions of the specific user design fonts of interest. Common design fonts for alpha-numeric applications are Courier and Times Roman. Typically, user fonts include upper-case ABCDEFGHIJKLMNOPQRSTUVWXYZ lower-case abcdefghijklmnopqrstuvwxyz numbers 1234567890 and punctuation !@#$%^&*()_+-=[]{};′`:"∼\|,<.>/?. However, the present template enhancement technique is general method, and may be implemented on other graphical symbols. For convenience, three font versions are shown in Figure 1A for the group; of G symbol classes. The present enhancement techniques may be applied to two font versions, or four or more. Different symbol classes may have a different number of font versions. In general each symbol class may have "n" font versions (s 1 s 2 s 3 ... s n ) where "n" is not necessarily the same integer for each symbol class. The present enhancement technique may be applied to either design font variations or implementation variations (see section Sub-Classes - Sub-Templates). The enhancement technique is applicable to many other recognition applications involving classes with multiple input versions; such as radar return signals, and audio recognition applications involving phoneme sound patterns (speech fonts). The font of the unenhanced initial templates maybe similar to the input version fonts for maximizing the initial version/image comparison, and for providing a convenient starting place for the template evolution. Alternatively, the initial unenhanced template font may be a general font or special precursor font of the input version fonts; or even a template based on random noise. The number of unenhanced templates or images L in the library may be equal to or greater than the number of symbol classes G in the group. The library may have image entries which are not included among the symbol classes. These "idle" images are not involved in the version/image comparisons, and therefore do not change and become templates. Preferably, L is not be less than G, to avoid a single image attempting to evolve in response to the input versions of two separate symbol classes. Comparing each of the V input pixel versions with each of the L unenhanced initial templates to obtain VxL comparisons as shown in the body of the VxL matrix of Figure 1. The version/image comparisons are accomplished by comparing each pixel of general unenhanced template I j with each pixel of an input version s i of general symbol class S i based on a comparison function (discussed in more detail later Cauchy-Shwartz section). The VxL comparisons form V sets of L comparisons with one set of L comparisons for each input pixel version. Each set of L comparisons includes a comparison C ij for each unenhanced template I j . The set of comparisons for three font versions s i1 , s i2 , and s i3 of general symbol class S i extends upwards in the three adjacent columns above S i . The first column is for the font version "s i1 " (shown as C i11 C i12 ... T i1j ... Ci 1L ). The second column is for the version "s i2 " (shown as C i21 C i22 ... T i2j ... C i2L ), the third column is for "s i3 " (shown as C i31 C i32 ... T i3j C i3L ). The column set of initial L comparisons for the input pixel version "o 2 " (lower-case) of the "o" symbol class, relative to an alpha-numeric image font, is displayed in the bar graph of Figure 3A. Identifying the primary comparison C* from the L comparisons within each of the V sets of comparisons having the closest comparison with the input pixel version for that set. A total of V primary comparisons C* are identified forming a primary collection (C 1 * C 2 * C 3 * ... C i * ... C V *) across the columns. The highest comparison C* for the input font version "o 2 " (lower-case) is of course the unenhanced template "o 2 " (lower-case). The highest comparison C* for the "o 1 " and "o 3 " font versions of the "o" symbol class is with the unenhanced image "o". A single unenhanced image (and enhanced template) is available for each class of pixel versions. Identifying the secondary comparison C** from the L-1 remaining comparisons within each of the V sets of comparisons having the next closest comparison with the input pixel version. The unenhanced template underlying the secondary comparison C** is the most likely unenhanced template to be confused with the input pixel version. A total of V secondary comparisons C** are identified forming a secondary collection (C 1 ** C 2 ** C 3 ** ... C i ** ... C V **) across the columns. The primary and secondary collections form V pairs of identified comparisons C* and C**, one pair from each of the V column sets of comparisons. The next highest comparison C** for the input version "o 2 " in Figure 3A is the o 2 /c secondary comparison for the unenhanced template "c" (lower-case). The symbol classes "o" and "c" and "e" form a cluster of similarly shaped images and templates which have a high potential for confusion and become "anti-characters" (see next section on anti-character and clusters). Determining V recognition margins (M 1 M 2 M 3 ... M i ... M V ), one recognition margin between each pair of identified primary and secondary comparisons C* and C**. A total of V recognition margins M are determined. The size of the margin M is the difference between the value of C* and the value of C**. The initial o 2 /c margin is .12, for the data and embodiment shown in Figure 3A. Selecting the single pair of identified comparisons C* and C** forming the smallest recognition margin M* of all of the V pairs of identified comparisons. The smaller the recognition margin, the greater is the danger of OCR confusion between the input pixel version and the unenhanced images. Identifying the single pair of images I* and I** underlying the pair of identified comparisons C* and C**. The image I* is the unenhanced template match for the input pixel version and image I** is the most probable source of confusion with this pixel version. Weighting certain pixels of either the closest pixel image I* or the next closest pixel image I** or both, which underlie the selected pair of identified comparisons C* and C**. The weighting is directed toward increasing the recognition margin M* therebetween causing the pixel images to become the closest enhanced pixel template T* or the next closest enhanced pixel template T** or both. Iterating the comparing, identifying, determining, selecting, and weighting steps until the library of unenhanced pixel images has become a library of sufficiently enhanced symbol templates (T 1 T 2 T 3 ... T i ... T G ). The weighted pixel aberations generated in the enhanced templates are not present in the corresponding pixel versions of the pre-existing group of G symbol classes (S 1 S 2 S 3 ... S i ... S G ). TERMINATION The enhancement weighting process is terminated when the smallest recognition margin generated between the input pixel versions and the templates is greater than a predetermined "safe" minimum value. That is, when even the most error prone version/template comparison has a sufficiently high probability of being correct. The process may also be terminated when the incremental increase in the smallest margin is smaller than a predetermined minimum increase. That is, when the rate of change of the recognition margin of the templates each iteration is negligible and does not merit the time required. Alternatively, the process may be stopped after a specified number of weighting iterations have been executed; or preassigned period of processing time has elapsed. The enhancement of the templates may be occasionally slowed by the formation of a "local maxima" in the margin contour between the primary comparison and the secondary comparison. If the local maxima is an unstable one, it releases during subsequent iterations; and the enhancement process returns to the prior unhindered speed. However, if the local maxima is stable, the enhancement process becomes permanently locked between the primary and secondary comparison. The recognition margin remains fixed at the same level with (approximately) zero change. ANTI-CHARACTER - (Figures 3A 4A 5A) The symbol classes "o" and "c" and "e" form a cluster of similarly shaped unenhanced images having a high potential for confusion. The characters of the cluster become mutual "anti-characters", when they come into contrast with one another during the enhancement process. That is, when one member of the cluster forms primary comparison C*, and another member of the same cluster forms secondary comparison C**. Initially only the "o" image and the "c" image are anti-characters (shown in bold in the "o 2 " bar graph of Figure 3A). The cluster of anti-characters for the unenhanced "o" template then expands to include the "censu" anti-characters (shown in bold in the "o 2 " bar graph of Figure 3B). Other clusters of lower-case look-alike anti-characters are formed by "f" and "t", and by "h" and "b". An example of a punctuation look-alike is "," and ";". A particularly difficult look-alike cluster is formed by the number "1", the lower-case letter "1", the upper-case letter "I", and the exclamation point "!". The template for each member of a cluster of look-alike anti-characters must distinguish itself against the templates of other members of the same cluster. A comparison matrix for design font versions of lower-case symbol classes a-z is shown in Figure 1B, specifically illustrating the version/image comparisons of the cluster of look-alike characters "o", "c", and "e" . The input version fonts (including "o 1 ", "o 2 ", "o 3 ", "c 1 ", "c 2 ", "c 3 ", "e 1 ", "e 2 ", and "e 3 " lower-case) extend in alpha-numeric order along the horizontal axis of the Figure 1B comparison matrix. The unenhanced template images (also including "o", "c", and "e" lower-case) extend along the vertical axis. The initial set of L comparisons of the input version "o 2 " with each of the unenhanced templates is shown in Figure 1B extending vertically in a column above the "o 2 " input version. Only the lower-case templates have been shown in Figure 1B to conserve space. The upper-case and numbers and punctuation are have been omitted. The column of L initial comparisons for the input version "o 2 " (lower-case) is displayed in a horizontal format in the unenhanced template bar graph of Figure 3A. The initial unenhanced template images extend in alphanumeric order along the x axis of the bar graph. The value of the version/image comparisons (between 0 and 1.00) are plotted against the y axis. The "o 2 " bar graph of Figure 3A is based on the lower-case comparison matrix of Figure 1B; more particularly on the "o 2 " comparisons in the vertical column extending upwards from the "o 2 " position along the horizontal axis. Each version within the symbol classes has a distinct unenhanced template bar graph containing L version/image comparisons similar to the "o 2 " bar graph of Figure 3A. That is, the "o" symbol class has an "o 1 " bar graph, an "o 2 " bar graph, and an "o 3 " bar graph. The unenhanced template bar graph of initial comparisons for the input version "c 2 " is shown Figure 4A, and the unenhanced template bar graph for "e 2 " is shown in Figure 5A. During the primary comparison step, a total of V primary comparisons C* are identified. The highest comparison C* for the input version "o 2 " (lower-case) is of course the unenhanced template "o" (lower-case). The o 2 /o comparison (bold) has a value of 1.00 because in the embodiment of Figure 3A the unenhanced template image "o" is identical to the "o 2 " version of the symbol class "o". In general however, the o 1 /o comparison and o 2 /o comparison and o 3 /o comparison will have values very close to 1.00 (but not equal to 1.00) because in general the image "o" will not be identical to any of the "o" input versions. The C* for input version "c 2 " is the unenhanced template "c" at a value of 1.00 (see Figure 4A - bold) and the C* for the input version "e 2 " is the unenhanced template "e" (see Figure 5A - bold). During the secondary comparison step, a total of V secondary comparisons C** are identified, forming V pairs of identified comparisons C* and C**, one pair from each of the V sets of comparisons. The next highest comparison C** for the input version "o 2 " in Figure 3A is the o 2 /c comparison (bold) for the unenhanced template "c" (lower-case) which is more like the version "o 2 " than any of the other L-1 images in the alphanumeric library. The o 2 /c comparison (bold) has a value of only .88 because the unenhanced template "c" is not identical to the input version "o 2 " The o 2 /e comparison of Figure 3A is slightly less at .84. In the case of input version "c 2 " (see Figure 4A), C** is the comparison c 2 /o (bold) at a value of .88. In the case of the input version "e 2 " (see Figure 5A), C** is the comparison e 2 /c (bold) at .86. The size of the recognition margin M determined in the each iteration is the difference between the value of C* and the value of C**. The initial o 2 /c margin is .12 (see Figure 3A), and the initial c 2 /o margin is also .12 (see Figure 4A). The initial e 2 /c argin is .14 (see Figure 5A). GENERAL CASE of dM/dT* and dM/dT** The general case of template enhancement with respect to a particular input version s i involves maximizing the minimum recognition margin between the primary comparison C* and the maximum secondary comparison C** which form the selected pair of identified comparisons C* and C**, in the general relationship: maximize M = min[C* - max(C**)] where M is the recognition margin between C* and C**, C* is the primary comparison for the template T* which is the closest template in the library to the input version s i , and C** is the secondary comparison for the template T** which is the second closest template in the library to the input version s i . Multi-variable functions such as the recognition margin M may be maximized by a number of general numerical optimization processes. The process employed in the embodiment of Figures 3, 4, and 5, is the "gradient ascent" or "steepest ascent" technique; and is related to the steepest descent technique employed in minimization problems. In order for the recognition margin M to increase, C** must be reduced by the weighting, or C* must be increased, or both. The incremental weighting effect within template T** evolves pixel aberations in the bit map thereof which reduces C**. That is, after multiple iterations of weighting, T** looks less and less like the input version s i , causing comparison C** to have a lower value. The resulting increase in the o 2 /c margin is displayed in advanced template bar graph of Figure 3B (shown immediately under the initial unenhanced template bar graph of Figure 3A). The "o 2 " template bar graph shows an advanced set of L comparisons for the input version "o 2 " (lower-case) relative to the templates (lower-case). The advanced template bar graph of Figure 3B has the same format as the initial image bar graph of Figure 3A. The enhanced templates extend in alpha-numeric order along the x axis of the bar graph. The value of the comparison is plotted against the y axis. The o 2 /c margin has increased from .12 as shown in the initial image bar graph of Figure 3A, to .21 as shown in the advanced template bar graph of Figure 3B. Each of the V input versions has a distinct template bar graph containing L comparisons similar to the "o 2 " set of Figure 3B, which evolves from the initial image bar graph. The template column bar graph of advanced comparisons for the input version "c 2 " is shown Figure 4B, and the template bar graph for "e 2 " is shown in Figure 5B. The incremental weighting effect also accumulates pixel aberations in the bit map of template T* and may cause a slight reduction in C*. That is, after multiple iterations of weighting, T* looks less and less like the input version s i . However, because M is maximized, each iteration, C* is maintained at a level near 1.00. The resulting decrease in the o 2 /o comparison may be seen in advanced template bar graph of Figure 3B. The o 2 /o comparison has been reduced from 1.00 in Figure 3A to .96 in Figure 3B. The c 2 /c comparison has also been reduced to .96 (see Figure 4B), and the e 2 /e comparison has become .98 (see Figure 5B). In the case of the version/image comparison o 2 /c (see Figure 3B), the o 2 /c margin increases and approaches the o 2 /e margin of .21. When the o 2 /c margin is greater than the o 2 /e margin, the C** of the o 2 /e comparison replace the C** of the o 2 /c comparison. As the iterations proceed, template T** alternates between template "c" and template "e" until both the o 2 /c margin and the o 2 /e margin drop below the margin for yet another unenhanced template such as "n" or "s". As the recognition margin increase, the cluster of "o" anti-characters expands to include "c", "e", "n", "s", and "u" as shown in Figure 3B. Further enhancement of the "o" template would increase the margin slightly to include "m" and "z". Figure 4B shows a cluster of anti-characters accumulating near the .75 comparison value for symbol class "c"; and Figure 5B shows the cluster "c", "o", and "s" at .77. The maximum margin M is established by incrementally weighting template T* and template T** during the comparing-iteration cycles. The incremental templates weights W* and W** are determined through the first derivative (vector gradient) of the recognition margin relative to the multi vector components of templates T* and T**: dM/dT* = dC*/dT* - dC**/dT* and dM/dT** = dC*/dT** - dC**/dT** The step weight increments which are added to T* and to T** each iteration are: W* = u*(dM/dT*) and W** = u**(dM/dT**) where u* is the weighting factor mu in dM/dT* for each comparing iteration and u** is the weighting factor mu in dM/dT** for each comparing iteration The weighting factors u* and u** may be the same or different depending on the enhancement application. In general, a larger mu will support a larger change in M each iteration resulting in a higher rate of evolution. However, large changes may cause tunnelling under the target maxima in the M function, and initiate unstable oscillations in the iteration process. Small mus are slower and more stable. A modest mu may be employed to approach a maxima, and reduced to a smaller mu to more precisely locate the maxima. Each iteration "n" of the enhancement process produces a new template T n+1 which is slightly different from the old template T n as shown below: T* n+1 = T* n + W* = T* n + u*(dM/dT*) = T* n + u*(dC*/dT* - dC**/dT*) T** n+1 = T** n + W** = T** n + u**(dM/dT**) = T** n + u**(dC*/dT** - dC**/dT**) With each iteration, T** and C** drift further from T* and C*, and the recognition margin M becomes larger. The separation continues until a new pair of identified primary and secondary comparisons C* and C** (with new templates T* and T**) replace the present ones. EVOLUTION OF "o" ANTI-CHARACTERS "censu" The evolution of the library of templates in response to the symbol class "o" and the expanded anti-character cluster "c", "e", "n", "s", and "u" is shown below. This iteration by iteration sequence is based on the bar graph data of Figures 3A and 3B, and the initial condition that the initial Template "o" is identical to the "o 2 " version of the symbol class "o", with a single weighting factor of u* = u** = .01. At n=0 (before any iterations) Template o 0 = Input Version o 2 At n=10 (after 10 iterations) Template o 10 = (Tem o 0 ) - .10(Tem c) The Tem c coefficient is the product (n) (u) = (10)(.01) = 10. For the first ten iterations 1-10, the template for C** is only Tem c, and the increase in M per iteration is rapid. At n=16 Template o 16 = (Tem o 0 ) - .13(Tem c) - .03(Tem e) During the six iterations 11-16, the template for C** alternates between Tem c and Tem e. Each coefficient increases by 3x.01, and the increase in M per iteration is less rapid. At n=28 Template o 28 = (Tem o 0 ) - .17(Tem c) - .07(Tem e) - .04(Tem n) During the 12 iterations 17-28, the template for C** alternates between Tem c, Tem e and Tem n. Each coefficient increases by 4x.01. At n=36 Template o 36 = (Tem o 0 ) - .19(Tem c) - .09(Tem e) - .06(Tem n) - .02(Tem s) During the 8 iterations 29-36, the template for C** alternates between Tem c, Tem e, Tem n and Tem s. Each coefficient increases by 2x.01. At n=51 Template o 51 = (Tem o 0 ) - .22(Tem c) - .12(Tem e) - .09(Tem n) - .05(Tem s) - .03(Tem u) During the 15 iterations 37-51, the template for C** alternates between Tem c Tem e Tem n Tem s and Tem u. Each coefficient increases by 3x.01, and the increase in M per iteration is very slow. Each input version and associated cluster has a similar sequence in which the comparisons for the anti-characters evolve toward a common comparison value and recognition margin. As the iterative process continues, the number of anti-characters increases slowing down the rate of evolution. The process may be terminated when the minimal improvement in enhancement for the next iteration does not merit the computer effort required. COMPARISON FUNCTION - CAUCHY-SHWARTZ The comparison function between any input version s i and the library templates (T 1 T 2 T 3 ... T i ... T G ) involves a pixel by pixel treatment and summation of the s i bit map with each of the template bit maps. The pixel by pixel treatment provides the set of numerical comparison coefficients (C i1 C i2 C i3 ... T ij ... C iL ) for the input version s i . The VxL comparisons are numerical coefficients of comparison, the value of which indicates the degree of pixel similarity between the version s i and the template under comparison. Preferably, a coefficient having a high value indicates a close comparison between s i and the template, and a coefficient having a low value indicates a remote comparison between s i and the template. Preferably, the pixel data in the template bit maps are centered within the bit map and rotationally aligned. The bit maps may be X/Y scaled to the same number of pixel rows and pixel columns which provides corresponding pixel locations in each bit map. Any suitable comparison function may be employed such as the Cauchy-Shwartz function which is the version-template dot product (the summation of the product of corresponding pixels) divided by the version norm ¦¦s i ¦¦ and the template norm ¦¦T i ¦¦: Cauchy-Shwartz Function = = (s i ) · (T i ) / (¦¦s i ¦¦)(¦¦T i ¦¦). The vector of each pixel contained in the input version bit map is multiplied by the vector of the corresponding pixel contained in the template bit map, and divided by the two norms. The norm is a normalization factor formed by the square root of the sum of the squares of each pixel value in the bit map. The Cauchy-Shwartz comparison for each version/template provides a comparison coefficient having a value of between 0 and 1.00 as shown along the vertical axis of Figures 3, 4, and 5. The above expression of the Cauchy Shwartz function may be simplified by pre-normalizing the s i term to provide: Cauchy-Shwartz Function = (S i )·(T i ) / (¦¦T i ¦¦). The s i term in the new simplified expression now represents the more complex earlier term (s i )/(¦¦s i ¦¦). In terms of the simplified Cauchy Shwartz function, the enhancement process becomes: for the primary comparison C* = (s i ) · (T*) / (¦¦T*¦¦), and for the secondary comparison C** = (s i ) · (T**) / (¦¦T**¦¦). Mathematically, the template enhancement process involves finding a set of vector templates (T 1 T 2 T 3 ... T i ... T G ) which maximizes (over all of the templates) the minimum recognition margin between the primary comparison C* and the maximum secondary comparison C**: maximize M = Min C* - Max C** maximize M = Min [(s i ) · (T*) / (¦¦T*¦¦) - - Max {(s i ) · (T**) / (¦¦T**¦¦)}] The derivatives for the Cauchy-Shwartz comparison function become: dM/dT* = dC*/dT* - dC**/dT* = s i /¦¦T*¦¦ - (s i ·T*)T*/(¦¦T*¦¦) 3 and dM/dT** = dC*/dT** - dC**/dT** = s i /¦¦T**¦¦ - (S i ·T**)T**/(¦¦T**¦¦) 3 . SUB-CLASSES - SUB-TEMPLATES (Figures 6abc and 7) The font versions of the symbol classes are not necessarily design fonts employing intentional variations for aesthetic effect. The font versions maybe unintentional variations due to implementation distortions of a single version of a letter. Some makes and models of printers produce darker (or lighter) characters with wider (or thinner) strokes which may be recognized by the OCR process as distinct font versions. Variations in paper quality and toner composition may also contribute to the implementation variations. The pixel versions within a given symbol class may therefore be design font variations or implementation variations (or both) of the alpha-numeric symbol corresponding to that symbol class. The slanted pixel version F1 shown in Figure 6a, is a Duplex Italic design font of the symbol class "F". The simple pixel version F3 shown in Figure 6b, is a Duplex Roman design font of the symbol class "F". The complex pixel versions F5 and F6 shown in Figure 6c, are two Triplex Roman fonts of the symbol "F". The simple pixel version F2 shown in Figure 6b (lefthand version) is an implementation variation (thin) of the F3 pixel version produced by a printer (or toner or paper quality) which inhibits the amount of toner deposited. The simple pixel version F4 shown in Figure 6C (lefthand version) is an implementation variation (wide) of the symbol "F" produced by a printing environment which promotes toner deposition. The six pixel fonts F1-F6 of the symbol class F are divergent and require three related sub-classes as grouped in Figures 6a, 6b, and 6c. Each sub-class is indicated in Figure 7 as "SCa", "SCb", and "SCc" along the horizontal axis. Figure 7 is a comparison matrix for design and implementation versions of upper-case symbol classes A-Z with special emphasis on the three related sub-classes of the symbol class F depicted in Figures 6a, 6b, and 6c. Each sub-class has a separate sub-template indicated in Figure 7 as sub-image "Fa", "Fb", and "Fc" along the vertical axis. Slanted pixel font F1 forms a single version sub-class which is recognized as sub-template Fa. Simple font F3 and the thin implementation font F2 form a two version sub-class which is recognized as sub-template Fb. Complex fonts F5 and F6 and wide implementation font F4 form a there version sub-class which is recognized as sub-template Fc. The sub-image of each of the sub-classes of divergent pixel versions becomes a corresponding sub-template in the library of templates as the enhancement process proceeds. The recognition margins of the divergent pixel versions in a given sub-class are determined slightly differently than in the general embodiment of Figure 1 which did not have sub-classes. The recognition margins of the pixel versions in related sub-classes are excluded from comparison. This exclusion is permitted in the sub-class embodiment because these pixel versions are all in sub-classes within the same class. During the OCR procedure, it is not critical to distinguish between the six pixel versions F1-F6 of sub-classes Fa, Fb, and Fc because the three sub-classes are all in the class "F". No OCR error results if input version F1 is identified as sub-class Fc rather than subclass Fa. The inter-sub-class recognition margins may be excluded by not comparing the input version of a given sub-class with the sub-templates of the related subclasses. This exclusion status is indicated in Figure 7 by the twelve large dashes in the body of the comparison matrix. The column above each of the input versions F1-F6 has two exclusion dashes, one for each of the related subclasses. The inter-sub-class exclusion may be effected by embedding a default zero in the comparison matrix at each inter-sub-class position. The resulting recognition margins will be large and out of the competition for the secondary comparison C**. Alternatively, the inter-subclass recognition margins may be excluded by not determining a recognition margin between the pixel versions and the sub-templates of the related sub-classes. TEMPLATE ENHANCING SYSTEM (Figure 8) Symbol Library 82:S contains a pre-existing group of G input symbol classes (S 1 S 2 S 3 ... S i ... S G ). Image Library 82:I contains L unenhanced pixel images (I 1 I 2 I 3 ... I j ... I L ) to become processed into G enhanced templates (T 1 T 2 T 3 ... T i ... T G ) of the G symbol classes. Symbol-Image Comparator 84 compares each version within each of the G symbol classes with each of the L pixel images to obtain VxL comparisons forming V sets of L comparisons (C 1 C 2 C 3 ... C j ... C L ) temporarily stored in VxL Memory 86. One set of L comparisons is formed for each version of each symbol class S i of the G symbol classes. Each set of comparisons has a comparison C i for each pixel image I j . The primary comparison C i * is identified from the L comparisons within each of the V sets of comparisons having the closest comparison with the each version within each symbol class S i for that set of comparisons. The secondary comparison C i ** is identified from the L-1 remaining comparisons within each of the V sets of comparisons having the next closest comparison with each version in each symbol class S i for that set of comparisons. V pairs of identified comparisons C i * and C i ** are formed, one pair from each of the V sets of comparisons. The V pairs are temporarily stored in Pair Memory 87. V recognition margins (M 1 M 2 M 3 ... M i ... M V ) are determined, one recognition margin between each pair of identified comparisons C i * and C i **. The V recognition margins are also stored in Pair Memory 87. The single pair of identified comparisons C i * and C i ** is selected form Pair Memory 87 which forms the smallest recognition margin M i * of all of the V pairs within Pair Memory. Pair Memory addresses the single pair of pixel images I j * and I j ** within Image Library 82:I which corresponds to the pair of identified comparisons C i * and C i **. Pixel Weighter 88 weights certain pixels of either the closest pixel images I j * or the next closest pixel image I j ** or both. The weighted images correspond to the selected pair of identified comparisons C i * and C i ** in order to increase the recognition margin M i * therebetween. The comparing, identifying, determining, selecting, and weighting steps are iterated until the L pixel images within Image Library 82:I has become a library of enhanced symbol templates (T 1 T 2 T 3 ... T i ... T G ) at least some of which have weighted pixel aberrations not present in the corresponding pixel symbol of the pre-existing group of G symbol classes (S 1 S 2 S 3 ... S i ... S G ) within Symbol Library 82:S. CONCLUSION It will be apparent to those skilled in the art that the objects of this invention have been achieved as described hereinbefore. Clearly various changes may be made in the structure and embodiments shown herein without departing from the concept of the invention. Further, features of the embodiments shown in the various Figures may be employed with the embodiments of the other Figures. Therefore, the scope of the invention is to be determined by the terminology of the following claims and the legal equivalents thereof. It will further be apparent to those skilled in the art that the template enhancement techniques described herein can be employed in a variety of optical character recognition (OCR) and other systems, and of course it will be further apparent how the enhanced templates can be used in comparison with input image data to perform image to text conversion. The scope of the present invention therefore also extends: to methods and apparatuses for recognition of image patterns, sound patterns and the like; to signals and storage devices conveying enhanced templates for use in such methods and apparatuses; and to signals and recording media conveying symbols which have been decoded from image and/or audio data in accordance with such enhanced templates.

Claims: A method of recognition enhancement of a library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L } with respect to a pre-existing group of & classes of symbols {S 1 S 2 S 3 ... S i ... S G } at least some of which include multiple pixel versions of the same symbol, for providing a library of G recognition enhanced pixel templates {T 1 T 2 T 3 ... T i ... T G }, one enhanced template corresponding to each of the symbol classes, the method comprising the steps of: providing the library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L }; providing the group of G symbol classes {S 1 S 2 S 3 ... S i ... S G } with the multiple pixel versions therein, giving a total of V pixel versions; comparing each of the V pixel versions with each of the L unenhanced pixel images to obtain VxL comparisons forming V sets of L comparison {C 1 C 2 C 3 ... C j ... C L }, one set of L comparisons for each of the V pixel versions, each set of comparisons having a comparison C i for each unenhanced pixel image I j ; identifying a primary comparison C* from the L comparisons within each of the V sets of comparison having the closest comparison with the pixel version for that set of comparisons forming a collection of V primary comparisons C* {C 1 * C 2 * C 3 * ... C i * ... C V *}; identifying the secondary comparison C** from the L-1 remaining comparisons within each of the V sets of comparisons having the next closest comparison with the pixel version for that set of comparisons forming a collection of V secondary comparisons C** {C 1 ** C 2 ** C 3 ** ... C i ** ... C V **}, to provide V pairs of identified comparisons C* and C**, one pair from each of the V sets of comparisons; determining V recognition margins {M 1 M 2 M 3 ... M i ... M V }, one recognition margin between each pair of identified comparisons C* and C**; selecting the single pair of identified comparisons C* and C** having the smallest recognition margin M* of all of the V pairs of identified comparisons from the V sets of comparisons; identifying the single pair of pixel images I* and I** corresponding to the selected single pair of identified comparisons C* and C**; weighting certain pixels of the closest pixel image I* and/or the next closest pixel image I** corresponding to the selected single pair of identified comparison C* and C** in order to incrementally increase the recognition margin M* therebetween causing the pixel image I* to become the closest enhanced pixel template T* and/or the pixel image I** to become the next closest enhanced pixel template T**; iterating the comparing, identifying, determining selecting and weighting steps until the library of pixel images has become the library of enhanced symbol templates {T 1 T 2 T 3 ... T i ... T G } at least some of which have weighted pixel aberations not present in the pixel version within each of the pre-existing group of G corresponding symbol classes {S 1 S 2 S 3 ... S i ... S G }. The method of claim 1, wherein the recognition enhancement of the unenhanced pixel images is terminated when the smallest recognition margin is greater than a predetermined minimum value. The method of claim 1, wherein the recognition enhancement of the unenhanced pixel images is terminated when the incremental increase in the smallest recognition margin each iteration is smaller than a predetermined minimum increase. The method of claim 1, wherein the recognition enhancement of the unenhanced pixel images is terminated when a specified number of weighting iterations have been executed. The method of claim 1, wherein the recognition enhancement of the unenhanced pixel images is terminated when a preassigned period of iteration processing time has expired. The method of claim 1, wherein the recognition enhancement of the unenhanced pixel images is terminated when the individual templates in clusters of similarly shaped templates have progressed to the same recognition margin and have become mutual anti-characters. The method of claim 6, wherein the pixel versions within a given symbol class are font variations of the alpha-numeric symbol corresponding to that symbol class. The method of claim 6, wherein the pixel versions within a given symbol class are implementation variations of the alpha-numeric symbol corresponding to that symbol class. The method of claim 6, wherein the pixel versions within a given symbol class are font variations and implementation variations of the alpha-numeric symbol corresponding to that symbol class. The method of claim 6, wherein the pixel versions within a given symbol class are variations of the alpha-numeric symbol corresponding to that symbol class, and divergent pixel versions in at least some of the symbol classes form related sub-classes of pixel versions within that symbol class. The method of claim 10, wherein each of the sub-classes of divergent pixel versions has a corresponding sub-image which becomes a corresponding sub-template in the library of templates. The method of claim 11, wherein during the determination of the recognition margins of a divergent pixel version in a given sub-class, the recognition margins with of the sub-templates of related sub-classes are excluded. The method of claim 12, wherein the inter-sub-class recognition margins are excluded by not determining a recognition margin with the sub-templates of the related sub-classes. The method of claim 12, wherein the inter-sub-class recognition margins are excluded by not comparing the given sub-class with the sub-templates of the related sub-classes. The method of claim 1, wherein the VxL comparisons are numerical coefficients of comparison, the value of which indicates the degree of pixel similarity between the pixel version within a symbol class S i and the pixel image I j under comparison C IJ . The method of claim 15, wherein a coefficient having a high value indicates a close comparison between the input pixel version s i and the pixel image under comparison I j , and a coefficient having a low value indicates a remote comparison between the input pixel version s i and the pixel image under comparison I j . The method of claim 15, wherein the recognition margin is the difference between the comparisons C* and C** of each selected pair of comparisons. The method of claim 17, wherein the recognition enhancement of a particular pixel image I j with respect to a particular pixel version s i involves maximizing the minimum recognition margin between the primary comparison C* and the maximum secondary comparison C** which form the selected pair of identified comparisons C* and C** for the pixel versions S i , in the general relationship: maximise M = min[C* - max(C**)] where M is the recognition margin between C* and C**; C* is the primary comparison for the template T* which is the closest template in the library to the particular pixel version s i , and C** is the secondary comparison for the template T** which is the second closest template in the library to the pixel version s i . The method of claim 18, wherein only the closest pixel image I* is weighted causing the closest pixel image I* to become the closest pixel template T*. The method of claim 19, wherein the weighting added to the closest template T* each iteration is determined by the first derivative of the recognition margin M* relative to the template T*: W* = u*(dM/dT*) = u*(dC*/dT* - dC**/dT*) where W* is the weighting added such iteration, and u* is a weighting factor mu* for dM/dT*. The method of claim 20, wherein each iteration of the enhancement process produces a new T* template which is slightly different from the old T* template: T* n+1 = T* n + W* = T* n + u*(dM/dT*) = T* n + u*(dC*/dT* - dC**/dT*) where n is the number of iteration, T* n+1 is the new T* template, and T* n is the old T* template. The method of claim 18, wherein only the next closest pixel image I** is weighted causing the next closest pixel image I** to become the next closest pixel template T**. The method of claim 22, wherein the weighting added to the next closest template T** each iteration is determined by the first derivative of the recognition margin M** relative to the template T**; W** = u**(dM/dT**) = u**(dC*/dT** - dC**/dT**) where W** is the weighting added each iteration, and u** is a weighting factor mu** for dM/dT**. The method of claim 23, wherein each iteration of the enhancement process produces a new T** template which is slightly different from the old T** template: T** n+1 = T** n + W** = T** n + u**(dM/dT**) = T** n + u**(dC/dT** - dC**/dT**) where n is the number of the iteration, T* n+1 is the new T** template, and T** n is the old T** template. The method of claim 18, wherein both the closest pixel image I* and the next closest pixel image I** are weighted causing the closest pixel image I* to become the closest pixel template T* and the next closest pixel image I** to become the next closest pixel template T**. The method of claim 25, wherein the weighting added to T* and to template T** each iteration are determined by the first derivative of the recognition margins M* and M** relative to templates T* and T**: W* = u* (dM/dT*) = u* (dC*/dT* - dC**/dT*) W** = u**(dM/dT**) = u**(dC*/dT** - dC**/dT**) where W* is the weighting added to T* each iteration, u* is a weighting factor mu* for dM/dT*, W** is the weighting added to T** each iteration, and u** is a weighting factor mu** for dM/dT**. The method of claim 26, wherein the weighting factor u* is equal to the weighting factor u**. The method of claim 26, wherein each iteration produces a new T* and T** templates which are slightly different from the old T* and T** templates; T* n+1 = T* n + W* = T* n + u*(dC*/dT* - dC**/dT*) T** n+1 = T** n + W** = T** n = u**(dC*/dT** - dC**/dT**) where n is the number of iteration, T* n+1 is the new T* template, T* n is the old T* template, T** n+1 is the new T** template, and T** n is the old T** template. The method of claim 15, wherein the value of each numerical coefficient of comparison C j is based on a pixel by pixel comparison between each pixel of pixel version s i and each pixel of pixel image I j under comparison. The method of claim 29, wherein the pixel by pixel comparison is the dot product between each pixel of pixel version s i and each pixel of pixel image I j under comparison. The method of claim 29, wherein the pixel by pixel comparison is based on the Cauchy-Shwartz Function: Cauchy-Shwartz Function = = (s i ) · (T i ) / (¦¦s i ¦¦)(¦¦T i ¦¦) where (s i ) is the input version under comparison, (T i ) is the enhanced template under comparison, (¦¦s i ¦¦) is the version norm, and (¦¦T i ¦¦) is the template norm. A signal or recording medium conveying a library of recognition templates which have been enhanced in accordance with any of claims 1 to 31. Apparatus for recognition enhancement of a library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L } with respect to a pre-existing group of & classes of symbols {S 1 S 2 S 3 ... S i ... S G } at least some of which include multiple pixel versions of the same symbol, for providing a library of G recognition enhanced pixel templates {T 1 T 2 T 3 ... T i ... T G }, one enhanced template corresponding to each of the symbol classes, the apparatus comprising: first storage means storing the library of L unenhanced pixel images {I 1 I 2 I 3 ... I j ... I L }; second storage means storing the group of G symbol classes {S 1 S 2 S 3 ... S i ... S G } with the multiple pixel versions therein, giving a total of V pixel versions; comparing means for comparing each of the V pixel versions with each of the L unenhanced pixel images to obtain VxL comparisons forming V sets of L comparisons {C 1 C 2 C 3 ... C j ... C L }, one set of L comparisons for each of the V pixel versions, each set of comparisons having a comparison C i for each unenhanced pixel image I j ; first identifying means for identifying a primary comparison C* from the L comparisons within each of the V sets of comparison having the closest comparison with the pixel version for that set of comparisons forming a collection of V primary comparison C* {C 1 * C 2 * C 3 * ... C i * ... C V *}; second identifying means for identifying the secondary comparison C** from the L-1 remaining comparisons within each of the V sets of comparisons having the next closest comparison with the pixel version for that set of comparisons forming a collection of V secondary comparisons C** {C 1 ** C 2 ** C 3 ** ... C i ** ... C V **}, to provide V pairs of identified comparisons C* and C**, one pair from each of the V sets of comparisons; determining means for determining V recognition margins {M 1 M 2 M 3 ... M i ... M V }, one recognition margin between each pair of identified comparisons C* and C**; selecting means for selecting the single pair of identified comparisons C* and C** having the smallest recognition margin M* of all of the V pairs of identified comparisons from the V sets of comparisons; third identifying means identifying the single pair of pixel images I* and I** corresponding to the selected single pair of identified comparisons C* and C**; and weighting means for weighting certain pixels of the closest pixel image I* and/or the next closest pixel image I** corresponding to the selected single pair of identified comparisons C* and C** in order to incrementally increase the recognition margin M* therebetween causing the pixel image I* to become the closest enhanced pixel template T* and/or the pixel image I** to become the next closest enhanced pixel template T**; wherein said comparing means, said first, second and third identifying means, said determining means, said selecting means and said weighting means are iteratively operable until the library of pixel images has become the library of enhanced symbol templates {T 1 T 2 T 3 ... T i ... T G } at least some of which have weighted pixel aberations not present in the pixel version within each of the pre-existing group of G corresponding symbol classes {S 1 S 2 S 3 ... S i ... S G }. The apparatus of claim 33, wherein the apparatus is arranged to terminate the recognition enhancement of the unenhanced pixel images when the smallest recognition margin is greater than a predetermined minimum value. The apparatus of claim 33, wherein the apparatus is arranged to terminate the recognition enhancement of the unenhanced pixel images when the incremental increase in the smallest recognition margin each iteration is smaller than a predetermined minimum increase. The apparatus of claim 33, wherein the apparatus is arranged to terminate the recognition enhancement of the unenhanced pixel images when a specified number of weighting iterations have been executed. The apparatus of claim 33, wherein the apparatus is arranged to terminate the recognition enhancement of the unenhanced pixel images when a preassigned period of iteration processing time has expired. The apparatus of claim 33, wherein the apparatus is arranged to terminate the recognition enhancement of the unenhanced pixel images when the individual templates in clusters of similarly shaped templates have progressed to the same recognition margin and have become mutual anti-characters. The apparatus of claim 38, wherein the pixel versions within a given symbol class are font variations of the alpha-numeric symbol corresponding to that symbol class. The apparatus of claim 38, wherein the pixel versions within a given symbol class are implementation variations of the alpha-numeric symbol corresponding to that symbol class. The apparatus of claim 38, wherein the pixel versions within a given symbol class are font variations and implementation variations of the alpha-numeric symbol corresponding to that symbol class. The apparatus of claim 38, wherein the pixel versions within a given symbol class are variations of the alpha-numeric symbol corresponding to that symbol class, and divergent pixel versions in at least some of the symbol classes form related sub-classes of pixel versions within that symbol class. The apparatus of claim 42, wherein each of the sub-classes of divergent pixel versions has a corresponding sub-image which becomes a corresponding sub-template in the library of templates. The apparatus of claim 42, wherein said determining means is adapted to during the determination of the recognition margins of a divergent pixel version in a given sub-class, exclude the recognition margins with of the sub-templates of related sub-classes. The apparatus of claim 44, wherein said determining means is adapted to exclude the inter-sub-class recognition margins by not determining a recognition margin with the sub-templates of the related sub-classes. The apparatus of claim 44, wherein said determining means is adapted to exclude the inter-sub-class recognition margins by not comparing the given sub-class with the sub-templates of the related sub-classes. The apparatus of claim 33, wherein said comparison means is adapted to carry out the VxL comparisons to obtain numerical coefficients of comparison, the value of which indicates the degree of pixel similarity between the pixel version within a symbol class S i and the pixel image I J under comparison C IJ . The apparatus of claim 47, wherein said comparing means is adapted to carry out the comparisons so that a coefficient having a high value indicates a close comparison between the input pixel version s i and the pixel image under comparison I j , and a coefficient having a low value indicates a remote comparison between the input pixel version s i and the pixel image under comparison I j . The apparatus of claim 47, wherein said determining means is adapted to determine the recognition margin as the difference between the comparisons C* and C** of each selected pair of comparisons. The apparatus of claim 49, wherein for the recognition enhancement of a particular pixel image I j with respect to a particular pixel version s i the apparatus includes means for maximizing the minimum recognition margin between the primary comparison C* and the maximum secondary comparison C** which form the selected pair of identified comparisons C* and C** for the pixel versions S i , in the general relationship: maximise M = min[C* - max(C**)] where M is the recognition margin between C* and C**; C* is the primary comparison for the template T* which is the closest template in the library to the particular pixel version s i , and C** is the secondary comparison for the template T** which is the second closest template in the library to the pixel version s i . The apparatus of claim 50, wherein said weighting means is adapted to weight only the closest pixel image I* causing the closest pixel image I* to become the closest pixel template T*. The apparatus of claim 51, wherein said weighting means is adapted to determine the weighting added to the closest template T* each iteration by the first derivative of the recognition margin M* relative to the template T*: W* = u*(dM/dT*) = u*(dC*/dT* - dC**/dT*) where W* is the weighting added such iteration, and u* is a weighting factor mu* for dM/dT*. The apparatus of claim 52, wherein the apparatus is operative each iteration of the enhancement process to produce a new T* template which is slightly different from the old T* template: T* n+1 = T* n + W* = T* n + u*(dM/dT*) = T* n + u*(dC*/dT* - dC**/dT*) where n is the number of iteration, T* n+1 is the new T* template, and T* n is the old T* template. The apparatus of claim 50, wherein said weighting means is adapted to weight only the next closest pixel image I** causing the next closest pixel image I** to become the next closest pixel template T**. The apparatus of claim 54, wherein said weighting means is adapted to determine the weighting added to the next closest template T** each iteration by the first derivative of the recognition margin M** relative to the template T**; W** = u**(dM/dT**) = u**(dC*/dT** - dC**/dT**) where W** is the weighting added each iteration, and u** is a weighting factor mu** for dM/dT**. The apparatus of claim 55, wherein the apparatus is operative each iteration of the enhancement process to produce a new T** template which is slightly different from the old T** template: T** n+1 = T** n + W** = T** n + u**(dM/dT**) = T** n + u**(dC/dT** - dC**/dT**) where n is the number of the iteration, T* n+1 is the new T** template, and T** n is the old T** template. The apparatus of claim 50, wherein said weighting means is adapted to weight both the closest pixel image I* and the next closest pixel image I** causing the closest pixel image I* to become the closest pixel template T* and the next closest pixel image I** to become the next closest pixel template T**. The apparatus of claim 57, wherein said weighting means id adapted to determine the weighting added to T* and to template T** each iteration by the first derivative of the recognition margins M* and M** relative to templates T* and T**: W* = u* (dM/dT*) = u* (dC*/dT* - dC**/dT*) W** = u**(dM/dT**) = u**(dC*/dT** - dC**/dT**) where W* is the weighting added to T* each iteration, u* is a weighting factor mu* for dM/dT*, W** is the weighting added to T** each iteration, and u** is a weighting factor mu** for dM/dT**. The apparatus of claim 58, wherein said weighting means is adapted to use the weighting factor u* which is equal to the weighting factor u**. The apparatus of claim 58, wherein the apparatus is operative each iteration to produce a new T* and T** templates which are slightly different from the old T* and T** templates; T* n+1 = T* n + W* = T* n + u*(dC*/dT* - dC**/dT*) T** n+1 = T** n + W** = T** n = u**(dC*/dT** - dC**/dT**) where n is the number of iteration, T* n+1 is the new T* template, T* n is the old T* template, T** n+1 is the new T** template, and T** n is the old T** template. The apparatus of claim 47, wherein said comparing means is adapted to base the value of each numerical coefficient of comparison C j on a pixel by pixel comparison between each pixel of pixel version s i and each pixel of pixel image I j under comparison. The apparatus of claim 61, wherein said comparing means is adapted to carry out the pixel by pixel comparison is the dot product between each pixel of pixel version s i and each pixel of pixel image I j under comparison. The apparatus of claim 61, wherein said comparing means is adapted to base the pixel by pixel comparison on the Cauchy-Shwartz Function: Cauchy-Shwartz Function = = (S i ) · (T i ) / (¦¦s i ¦¦)(¦¦T i ¦¦) where (s i ) is the input version under comparison, (T i ) is the enhanced template under comparison, (¦¦s i ¦¦) is the version norm, and (¦¦T i ¦¦) is the template norm.

Inventors: AVI-ITZHAK HADAR, AVI-ITZHAK, HADAR, AVI-ITZHAK, HADAR, C/O CANON RESEARCH CENTER
Applicants: CANON KK, CANON KABUSHIKI KAISHA
Application year: 1994
Main classification: G06K9
IPC codes: G06K9