Method and system for recognizing machine generated character glyphs and icons in graphic images
First Claim
Patent Images
1. A method for constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs in a graphic image, comprising:
- collecting character glyphs of a font instance, including all combinations of overlapping glyphs;
merging the identical prefixes of these character glyphs together;
generating the DFA from the merged prefixes; and
storing the DFA in a sparse matrix representation.
0 Assignments
0 Petitions
Accused Products
Abstract
A deterministic finite automaton uses binary search (and optionally hashing) method(s) of sparse matrix representation to recognize the graphical representations of characters or icons from a bitmap representation of the computer screen. This recognition can be applied to translate data from an unknown form of original specification (file format) into a known form of representation, such as HTML. Alternatively this recognition can be applied to another process that can “see” what is on the screen, and perform programmed actions, based on what it “sees”.
-
Citations
27 Claims
-
1. A method for constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs in a graphic image, comprising:
-
collecting character glyphs of a font instance, including all combinations of overlapping glyphs; merging the identical prefixes of these character glyphs together; generating the DFA from the merged prefixes; and storing the DFA in a sparse matrix representation. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for translating a source file in a source file format to a destination file in a destination file format using a graphic image of the source file, comprising:
-
constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs in a graphic image, comprising; collecting character glyphs of a font instance, including all combinations of overlapping glyphs; merging the identical prefixes of these character glyphs together; generating the DFA from the merged prefixes; and storing the DFA in a sparse matrix representation; using the deterministic finite automaton (DFA) to translate the source file in the source file format into the destination file in the destination file format. - View Dependent Claims (10, 11)
-
-
12. A method for translating a source file in a source file format to a destination file in a destination file format using a graphic image of the source file, comprising:
-
constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs in a graphic image, comprising; collecting character glyphs of a font instance, including all combinations of overlapping glyphs; merging the identical prefixes of these character glyphs together; generating the DFA from the merged prefixes; and storing the DFA in a sparse matrix representation; using the deterministic finite automaton (DFA) to translate the source file in the source file format into the destination file in the destination file format wherein the destination file format is a page layout language. - View Dependent Claims (13)
-
-
14. A method for second program to control a first program on a first computer comprising:
constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs in a graphic image, comprising; collecting character glyphs of a font instance, including all combinations of overlapping glyphs; merging the identical prefixes of these character glyphs together; generating the DFA from the merged prefixes; and storing the DFA in a sparse matrix representation; adapting the DFA to recognize icons and multiple font instances; using the DFA by a second program to control a first program on a first computer.
-
15. A method for second program to control a first program on a first computer comprising:
-
constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs in a graphic image, comprising; collecting character glyphs of a font instance, including all combinations of overlapping glyphs; merging the identical prefixes of these character glyphs together; generating the DFA from the merged prefixes; and storing the DFA in a sparse matrix representation; adapting the DFA to recognize icons and multiple font instances; using the DFA by a second program to control a first program on a first computer, wherein the second program is invoiced by a set of keystroke combinations.
-
-
16. A method for second program to control a first program on a first computer comprising:
-
constructing a deterministic finite automaton (DFA) for recognizing machine generated character glyphs and or icons in a graphic image, comprising; collecting character glyphs and or icons; merging the identical prefixes of these character glyphs and or icons together; generating the DFA from the merged prefixes; and storing the DFA in a sparse matrix representation; using the DFA by a second program to control a first program on a first computer. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)
-
Specification