Similarity determination among patterns using affine-invariant features

Claim 2

A computer-implemented process of detecting, analyzing and recognizing a physical pattern, regardless of particular handwriting style or font, among a set of known template patterns, the physical pattern and the template patterns each having a plurality of lines connecting a plurality of line endpoints and line intersections, the process comprising the steps of: a) detecting and labeling as a plurality of nodes said line endpoints and line intersections of said physical pattern; b) determining a set of connected node pairs responsive to existence of said lines among said nodes; c) forming a detected connectivity matrix responsive to the results of step b; d) determining, by a computer system, a spectrum for said detected connectivity matrix; e) determining, by said computer system, a spectral distance metric indicating a degree of relative similarity between said detected connectivity matrix and each of a set of template connectivity matrices corresponding to said set of known template patterns; and f) recognizing said physical pattern as that template pattern whose connectivity matrix has a minimum spectral distance metric indicating a maximum degree of similarity to said detected connectivity matrix.

Claim 3

A computer-implemented process as set forth in claim 1, further comprising the steps of: determining a degree of curvature of one of said lines; replacing the connected node pair corresponding to said one line with at least two new connected node pairs responsive to said degree of curvature to increase the total number of node pairs in the physical pattern; and forming said detected connectivity matrix responsive to the results of said replacing step.

Claim 4

A computer-implemented process of detecting, analyzing and recognizing a physical pattern among a set of known template patterns, the physical pattern and the template patterns each having a plurality of lines connecting a plurality of line endpoints and line intersections, the physical pattern having a thickness of stroke, the process comprising the steps of: a) detecting and labeling as a plurality of nodes said line endpoints and line intersections of said physical pattern; b) determining a set of connected node pairs responsive to existence of said lines amount said nodes; c) determining a degree of closeness among a subset of said set of connected node pairs relative to said thickness of stroke; d) replacing said subset with a single node responsive to said degree of closeness; e) forming a detected connectivity matrix responsive to the results of steps b and d; f) determining, by a computer system, a spectrum for said detected connectivity matrix; g) determining, by said computer system, a spectral distance metric between said detected connectivity matrix and each of a set of template connectivity matrices corresponding to said set of known template patterns; and f) recognizing said physical pattern as that template pattern whose connectivity matrix has a minimum spectral distance metric to said detected connectivity matrix.

Claim 5

A computer-implemented process of detecting, analyzing and recognizing a physical pattern among a set of known template patterns, the physical pattern and the template patterns each having a plurality of lines connecting a plurality of line endpoints and line intersections, the physical pattern having a thickness of stroke, the process comprising the steps of: a) detecting and labeling as a plurality of nodes said line endpoints and line intersections of said physical pattern; b) determining a set of connected node pairs responsive to existence of said lines amount said nodes; c) determining a degree of closeness among a subset of said set of connected node pairs relative to said thickness of stroke; d) replacing said subset with a single node responsive to said degree of closeness; e) forming a detected connectivity matrix responsive to the results of steps b and d; f) determining, by a computer system, a spectrum for said detected connectivity matrix; g) determining, by said computer system, a spectral distance metric between said detected connectivity matrix and each of a set of template connectivity matrices corresponding to said set of known template patterns; and f) recognizing said physical pattern as that template pattern whose connectivity matrix has a minimum spectral distance metric to said detected connectivity matrix.

Claim 6

A computer-implemented process as set forth in claim 1, wherein the physical pattern is an optical character and the set of known template patterns comprises alphanumeric characters.

Claim 7

A computer-implemented process as set forth in claim 1, wherein said spectrum comprises a set of eigenvalues for said detected connectivity matrix.

Claim 8

Apparatus for detecting, analyzing and recognizing a physical pattern, regardless of particular handwriting style or font, among a set of known template patterns, the physical pattern and the template patterns each having a plurality of lines connecting a plurality of line endpoints and line intersections, the apparatus comprising: a first processing element for detecting and labeling as a plurality of nodes said line endpoints and line intersections of said physical pattern, determining therefrom a set of connected node pairs responsive to existence of said lines among said nodes, and forming therefrom a detected connectivity matrix; detected pattern memory for storing a first data set representative of said detected connectivity matrix; template memory for storing a second data set representative of template connectivity matrices corresponding to said set of known template patterns; and a second processing element for receiving said first data set and said second data set, for determining therefrom a minimum spectral distance metric indicating a degree of relative similarity between said detected connectivity matrix and said template connectivity matrices, and for recognizing said physical pattern as one of said set of known template patterns responsive to said minimum spectral distance metric indicating a maximum degree of similarity.

Claim 9

Apparatus for detecting, analyzing and recognizing a physical pattern, regardless of particular handwriting style or font, among a set of known template patterns, the physical pattern and the template patterns each having a plurality of lines connecting a plurality of line endpoints and line intersections, the apparatus comprising: a first processing element for detecting and labeling as a plurality of nodes said line endpoints and line intersections of said physical pattern, determining therefrom a set of connected node pairs responsive to existence of said lines among said nodes, and forming therefrom a detected connectivity matrix; detected pattern memory for storing a first data set representative of said detected connectivity matrix; template memory for storing a second data set representative of template connectivity matrices corresponding to said set of known template patterns; and a second processing element for receiving said first data set and said second data set, for determining therefrom a minimum spectral distance metric indicating a degree of relative similarity between said detected connectivity matrix and said template connectivity matrices, and for recognizing said physical pattern as one of said set of known template patterns responsive to said minimum spectral distance metric indicating a maximum degree of similarity.

Claim 10

Apparatus as in claim 6, wherein said first processing element comprises a scanner and a computer controlled by a first stored processing program, and said second processing element comprises said computer controlled by a second stored processing program.

Claim 11

Apparatus as in claim 7, wherein said first stored processing program and said second stored processing program form modules of an overall stored processing program.

Claim 12

Apparatus as in claim 6, wherein said first data set representative of said detected connectivity matrix comprises spectral data.

Claim 13

Apparatus as in claim 6, wherein said second data set representative of template connectivity matrices comprises spectral data.