Machine print, hand print, and signature discrimination

Patent metadata

Field	Value
Publication number	US-10140510-B2
Application number	US-201815910797-A
Country	US
Kind code	B2
Filing date	Mar 2, 2018
Priority date	May 30, 2014
Publication date	Nov 27, 2018
Grant date	Nov 27, 2018

Abstract

Computer program products for discriminating hand and machine print from each other, and from signatures, are disclosed and include program code readable and/or executable by a processor to: receive an image, determine a color depth of the image; reducing the color depth of non-bi-tonal images to generate a bi-tonal representation of the image; identify a set of one or more graphical line candidates in either the bi-tonal image or the bi-tonal representation, the graphical line candidates including true graphical lines and/or false positives; discriminate any of the true graphical lines from any of the false positives; remove the true graphical lines from the bi-tonal image or the bi-tonal representation without removing the false positives to generate a component map comprising connected components and excluding graphical lines; identify one or more of the connected components in the component map; and output and/or display and indicator of each of the connected components.

First claim

What is claimed is:

1. A non-transitory computer readable medium having program code readable and/or executable by a processor to:
receive an image;
determine a color depth of the received image, the color depth being selected from the group consisting of: grayscale, bi-tonal and color;
reduce the color depth of the received image to generate a bi-tonal representation of the image in response to determining the color depth of the received image is not bi-tonal;
identify a set of one or more graphical line candidates in the bi-tonal representation, each of the graphical line candidates being independently selected from the group consisting of: true graphical lines and false positives;
discriminate any of the true graphical lines from any of the false positives;
remove the true graphical lines from the bi-tonal representation without removing the false positives to generate a component map comprising connected components and excluding graphical lines;
identify one or more of the connected components in the component map; and
perform one or more operations selected from the group consisting of:
output an indicator of each of the connected components, each indicator identifying one or more of the connected component and a particular class to which the connected component corresponds, and
display the indicator of each of the connected components; wherein the indicator comprises either or both of: a label identifying the particular class to which the connected component corresponds, and a bounding box surrounding the connected component.

2. The computer readable medium as recited in claim 1 , the program code readable and/or executable by the processor to identify the one or more connected components further comprising program code readable and/or executable by the processor to:
determine a connectedness of the one or more connected components in the component map;
determine whether each of the one or more connected components corresponds to a particular class of components based on the connectedness thereof, wherein the class of components to which each of the one or more connected components corresponds is selected from the group consisting of: unknown, handwritten characters, a signature, and machine-printed characters; and
label each of the one or more connected components based on the particular class of components to which the connected component corresponds.

3. The computer readable medium as recited in claim 2 , wherein determining the connectedness of the one or more connected components comprises determining, for each of the one or more connected components, a number of connected component transitions across a vertical threshold position.

4. The computer readable medium as recited in claim 3 , further comprising program code readable and/or executable by the processor to: define the vertical threshold position at approximately a midpoint of a maximum vertical stroke height of each of the one or more connected components prior to determining the connectedness of the connected component.

5. The computer readable medium as recited in claim 3 , further comprising program code readable and/or executable by the processor to: define the vertical threshold position at approximately two thirds of a maximum vertical stroke height of each of the one or more connected components prior to determining the connectedness of the connected component.

6. The computer readable medium as recited in claim 3 , further comprising program code readable and/or executable by the processor to: define the vertical threshold position at approximately three quarters of a maximum vertical stroke height of each of the one or more connected components prior to determining the connectedness of the connected component.

7. The computer readable medium as recited in claim 2 , further comprising program code readable and/or executable by the processor to: output and/or display an indicator of each connected component, each indicator identifying either or both of: the connected component and the particular class to which the connected component corresponds; and
wherein the indicator comprises either or both of: the label identifying the particular class to which the connected component corresponds, and a bounding box surrounding the connected component.

8. The computer readable medium as recited in claim 7 , the outputting comprising associating each indicator as metadata with one or more elements selected from the group consisting of: the bi-tonal image, the bi-tonal representation, and the received image; and
wherein the metadata identify either or both of: a position of the connected component, and the particular class to which the connected component corresponds.

9. The computer readable medium as recited in claim 8 , wherein the position of the connected component identifies each pixel of the image forming the connected component.

10. The computer readable medium as recited in claim 2 , further comprising program code readable and/or executable by the processor to: perform a neighbor analysis to determine whether the particular class to which one or more adjacent components correspond is identical to the particular class to which the connected component corresponds; and either:
confirm the particular class to which the connected component corresponds in response to determining the particular class to which the one or more adjacent components corresponds is identical to the particular class to which the connected component corresponds; or
refute a label associated with the connected component and identify the particular class to which the connected component corresponds in response to determining the particular class to which the connected component corresponds is different than the particular class to which the one or more adjacent components correspond.

11. The computer readable medium as recited in claim 10 , the program code readable and/or executable by the processor to perform the neighbor analysis further comprising program code readable and/or executable by the processor to, in response to refuting the connected component label: modify the particular class to which the connected component corresponds so as to match the particular class to which one or more of the adjacent components correspond.

12. The computer readable medium as recited in claim 1 , wherein determining whether each connected component corresponds to a particular class of connected components comprises one or more operations selected from the group consisting of: support vector analysis, maximum entropy discrimination analysis, and neural network analysis.

13. The computer readable medium as recited in claim 1 , wherein the program code readable and/or executable by the processor to discriminate the true graphical lines from the false positives comprises program code readable and/or executable by the processor to: filter the image to remove one or more at least partially globular features from the set of graphical line candidates; and
wherein the filtering is based on one or more characteristics selected from the group consisting of: feature length, feature thickness, feature pixel density, and feature size.

14. The computer readable medium as recited in claim 13 , wherein the set of graphical line candidates are characterized by a thickness less than a threshold thickness, the thickness being measured in a direction substantially perpendicular to an orientation along which the true graphical line lies.

15. The computer readable medium as recited in claim 14 , wherein the threshold thickness corresponds to a value less than about 0.1 inches.

Assignees

• Kofax Inc

Inventors

• Shustorovich Alexander
• Thrasher Christopher W
• Macciola Anthony
• Amtrup Jan W

Classifications

• G06V40/382 Primary

  Preprocessing; Feature extraction · CPC title

• G06V30/36

  Matching; Classification · CPC title

• G06V10/273

  removing elements interfering with the pattern to be recognised · CPC title

• G06K9/00187

  Physics · mapped topic

• G06K9/00422 Primary

  Physics · mapped topic