Method for generating a graph lattice from a corpus of one or more data graphs
First Claim
Patent Images
1. A method for generating a graph lattice from a corpus of one or more data graphs, said method comprising:
- a) generating, by a at least one processing device, candidate graph lattice nodes from accepted graph lattice nodes, the accepted graph lattice nodes being graph lattice nodes within the graph lattice, and the accepted and candidate graph lattice nodes each including a subgraph mapping to a data graph of the corpus, the subgraph being of degree i and formed from a subgraph of an accepted graph lattice node of degree i−
1 and a primitive, wherein the generating includes;
selecting one of the accepted graph lattice nodes;
identifying an extension of the of the selected graph lattice node from the mapping of the selected graph lattice node, the extension being a subgraph mapping to a data graph of the corpus and formed from a primitive added to the subgraph of the selected graph lattice node; and
generating a candidate graph lattice including the extension;
b) selecting, by the at least one processing device, one or more of the candidate graph lattice nodes according to a selection criteria;
c) promoting, by the at least one processing device, the selected graph lattice nodes to accepted graph lattice nodes; and
,d) repeating, by the at least one processing device, actions a) through c) until a termination condition is met, wherein the accepted graph lattice nodes at termination define the graph lattice.
6 Assignments
0 Petitions
Accused Products
Abstract
A document recognition system and method, where images are represented as a collection of primitive features whose spatial relations are represented as a graph. Useful subsets of all the possible subgraphs representing different portions of images are represented over a corpus of many images. The data structure is a lattice of subgraphs, and algorithms are provided means to build and use the graph lattice efficiently and effectively.
50 Citations
20 Claims
-
1. A method for generating a graph lattice from a corpus of one or more data graphs, said method comprising:
-
a) generating, by a at least one processing device, candidate graph lattice nodes from accepted graph lattice nodes, the accepted graph lattice nodes being graph lattice nodes within the graph lattice, and the accepted and candidate graph lattice nodes each including a subgraph mapping to a data graph of the corpus, the subgraph being of degree i and formed from a subgraph of an accepted graph lattice node of degree i−
1 and a primitive, wherein the generating includes;selecting one of the accepted graph lattice nodes; identifying an extension of the of the selected graph lattice node from the mapping of the selected graph lattice node, the extension being a subgraph mapping to a data graph of the corpus and formed from a primitive added to the subgraph of the selected graph lattice node; and generating a candidate graph lattice including the extension; b) selecting, by the at least one processing device, one or more of the candidate graph lattice nodes according to a selection criteria; c) promoting, by the at least one processing device, the selected graph lattice nodes to accepted graph lattice nodes; and
,d) repeating, by the at least one processing device, actions a) through c) until a termination condition is met, wherein the accepted graph lattice nodes at termination define the graph lattice. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for generating a graph lattice from a corpus of one or more data graphs, said method comprising:
-
a) generating by a at least one processing device candidate graph lattice nodes from accepted graph lattice nodes, the accepted graph lattice nodes being graph lattice nodes within the graph lattice, and the accepted and candidate graph lattice nodes each including a subgraph mapping to a data graph of the corpus, the subgraph being of degree i and formed from a subgraph of an accepted graph lattice node of degree i−
1 and a primitive, the primitive being one of a fixed number of primitive types, the primitive types being line art junctions;b) selecting, by the at least one processing device, one or more of the candidate graph lattice nodes having a highest diversity of primitive types; c) promoting, by the at least one processing device, the selected graph lattice nodes to accepted graph lattice nodes; and
,d) repeating, by the at least one processing device, actions a) through c) until a termination condition is met, wherein the accepted graph lattice nodes at termination define the graph lattice.
-
-
11. A method for mapping a graph lattice to a data graph, wherein the graph lattice is comprised of a graph of related subgraphs, said method comprising:
-
mapping, by a at least one processing device, subgraphs of degree 1 of the graph lattice to the data graph, the subgraphs of degree 1 being primitives; and
,iteratively mapping, by the at least one processing device, subgraphs of degree i>
1 of the graph lattice to the data graph, each subgraph of degree i>
1 being formed from a subgraph of degree i−
1 and a primitive, wherein mappings of the subgraphs of degree i>
1 to the data graph are incremental extensions of mappings of the subgraphs of degree i−
1 to the data graph, wherein the iterative mapping includes;
selecting one of the subgraphs of degree i>
1;receiving a previously determined mapping to the data graph of the subgraph of degree i−
1 forming the selected subgraph; and
extending the received mapping by mapping the primitive forming the selected subgraph to the data graph. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification