Automatic chain-based conflation of digital maps
First Claim
1. A method of making a third digital map C from first and second digital maps A and B comprising the steps of:
- a. creating an initial version of map C by importing into map C all cells present in map A together with their attributes;
b. matching chains of 1-cells in the map A and chains of 1-cells in the map B so as to create a corresponding pair of isomorphic factor-graphs;
c. importing unmatched 0-cells belonging to matched chains of 1-cells from map B into map C;
d. importing non-interfering unmatched 1-cells from map B into map C;
e. importing attributes of matched 0-cells and 1-cells from map B into map C according to user supplied criteria;
f. importing attributes into map C of said 1-cells from map B which were imported into map C in step d; and
g. importing attributes for 2-cells according to said user supplied criteria.
2 Assignments
0 Petitions
Accused Products
Abstract
The method of the present invention which employs conflation is based on pairing chains of arcs in order to determine the matching intersections between them. The chains are formed a priori in each map by using both attributes and geometric properties of the arcs. The intersections of chains are treated as relations, stored in a simple external custom relational database. The matching procedure is a set of the standard operations on RDBMS, as well as the sieving out of all possible ambiguous identifications. As a result, both maps become partitioned by the chains into much smaller pairwise matched areas called wards. The positional and semantic information from the matched chains is mapped onto the merged map. The mapping is performed by a general nonlinear transformation function. The transformation is then extended to the mapping of the unmatched content of wards onto the ultimate map. Any combination of geometry and attribute can be selected from either of a pair of matched wards for inclusion in the merged ward.
-
Citations
40 Claims
-
1. A method of making a third digital map C from first and second digital maps A and B comprising the steps of:
-
a. creating an initial version of map C by importing into map C all cells present in map A together with their attributes; b. matching chains of 1-cells in the map A and chains of 1-cells in the map B so as to create a corresponding pair of isomorphic factor-graphs; c. importing unmatched 0-cells belonging to matched chains of 1-cells from map B into map C; d. importing non-interfering unmatched 1-cells from map B into map C; e. importing attributes of matched 0-cells and 1-cells from map B into map C according to user supplied criteria; f. importing attributes into map C of said 1-cells from map B which were imported into map C in step d; and g. importing attributes for 2-cells according to said user supplied criteria. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A method of making a third digital map C from a first digital map A and a second digital map B, maps A and B including 0-cells, 1-cells and 2-cells, the 0-cells, 1-cells and 2 cells having associated attributes, the method comprising the steps of:
-
creating an initial version of map C by in, porting into map C 0-cells, 1-cells and 2-cells present in map A together with the associated attributes; creating chains of 1-cells of map A such that each chain includes 1-cells having a similar attribute; creating chains of 1-cells of map B such that each chain includes 1-cells having a similar attribute; matching said chains of 1-cells of map A with said chains of 1-cells of map B; importing non-interfering unmatched 1-cells from map B into map C; importing attributes of matched 1-cells and non-interfering unmatched 1-cells from map B into map C according to user supplied criteria; and importing attributes for 2-cells from map B to map C according to said user supplied criteria. - View Dependent Claims (33, 34, 35, 36, 37, 38)
-
-
39. A method of making a third digital map C from a first digital map A and a second digital map B, maps A and B including 0-cells, 1-cells and 2-cells, the cells having attributes, the method comprising the steps of:
-
creating an initial version of map C by importing into map C 0-cells, 1-cells and 2-cells present in map A together with the attributes; creating chains of 1-cells of map A such that each chain includes 1-cells having a similar attribute; creating chains of 1-cells of map B such that each chain includes 1-cells having a similar attribute; matching said chains of 1-cells of map A with said chains of 1-cells of map B; determining that an unmatched 1-cell is non-interfering by determining that said unmatched 1-cell, except for a predetermined portion of both ends of said unmatched 1-cell, is a predetermined distance from any adjacent 1-cell in map C; importing non-interfering unmatched 1-cells from map B into map C; importing unmatched 0-cells belonging to matched chains of 1-cells from map B into map C; importing attributes of said unmatched 0-cells belonging to matched chains from map B to map C; importing attributes of matched 1-cells and non-interfering unmatched 1-cells from map B into map C according to said user supplied criteria; and importing attributes for 2-cells from map B to map C according to said user supplied criteria. - View Dependent Claims (40)
-
Specification