EFFICIENT INTEGRATION OF ROAD MAPS

• US 20080253688A1
• Filed: 04/09/2008
• Published: 10/16/2008
• Est. Priority Date: 11/09/2006
• Status: Abandoned Application

• Current Assignee: Yissum Research Development Company of the Hebrew University of Jerusalem Ltd. (Hebrew University of Jerusalem), TECHNION RESEARCH AND DEVELOPMENT FOUNDATION, LTD. (Technion-Israel Institute Of Technology), University of Toronto
• Original Assignee: Yissum Research Development Company of the Hebrew University of Jerusalem Ltd. (Hebrew University of Jerusalem), TECHNION RESEARCH AND DEVELOPMENT FOUNDATION, LTD. (Technion-Israel Institute Of Technology), University of Toronto
• Inventors: Sagiv, Yehoshua, Kanza, Yaron, Doytsher, Yerach, SAFRA, Eliyahu
• Application Number:
  US12/100,165
• Publication Number:
  US 20080253688A1
• Time in Patent Office: Days
• US Class Current: 382/294
• CPC Class Codes: G01C 21/3819 Road shape data, e.g. outline of a route
• CPC Class Codes: G01C 21/3867 Geometry of map features, e.g. shape points, polygons or for simplified maps
• CPC Class Codes: G09B 29/005 Map projections or methods associated specifically therewith

Abstract

Systems and methods for integrating maps in which roads are represented as polylines. The main novelty of the invention is in using only the locations of the endpoints of the polylines rather than trying to match whole lines. Experiments on real-world data are given, showing that this approach of integration based on matching merely endpoints is efficient and accurate (that is, it provides high recall and precision).

Claims

1. A method for integrating a plurality of spatial datasets comprising a plurality of topological nodes and polylines, said method comprising the steps of:

(i) finding the topological nodes of each spatial dataset and generating a plurality of pairs, each pair consisting of a topological node and an associated polyline such that said topological node is an endpoint of said associated polyline;

(ii) matching the topological node of each generated pair in said plurality of spatial datasets with another topological node in a generated pair of a different spatial dataset, such that two topological nodes are matched if they represent the same real-world location in the corresponding spatial datasets; and

(iii) matching the polylines in said plurality of spatial datasets based on the previously matched topological nodes.

2. A method according to claim 1, wherein the step of finding the topological nodes is done as a separate preprocessing operation for each spatial dataset.

3. A method according to claim 1, wherein matching said topological nodes takes into account the mutual bound error such that two topological nodes are matched if the distance between them is not greater than the mutual bound error.

4. A method according to claim 1, wherein matching two polylines is successful if one of the following relationships between said two polylines occur:

(i) complete overlap between said two polylines;

(ii) one polylines is an extension of the second polylines;

(iii) one polylines is contained in the second polylines; and

(iv) partial overlap of said two polylines.

5. A method according to claim 1, wherein said plurality of spatial datasets are road maps.

6. A method according to claim 5, wherein said real-world location is a real-world intersection.

7. A method according to claim 1, wherein two polylines are matched either when the topological nodes associated with each polyline are matched or when at least one topological node of one polyline is an intermediate point of the other polyline.

8. A method according to claim 1, wherein a topological node of one polyline is an intermediate point of another polyline when the distance between the topological node and the other polyline is smaller than β

.

9. A method according to claim 1, wherein said matching the polylines is performed by matching of polylines where at least one of the topological nodes was matched in phase ii, and then by matching of polylines with only matching intermediate points.

10. A method according to claim 1, wherein the contents of each spatial dataset are updated individually.

11. A method for integrating two spatial datasets comprising a plurality of topological nodes and polylines representing real-world roads, said method comprising the steps of:

(i) finding the topological nodes of each spatial dataset and generating a plurality of pairs, each pair consisting of a topological node and an associated polyline such that said topological node is an endpoint of said associated polyline;

(ii) matching the topological node of each generated pair in one spatial dataset with another topological node in a generated pair of the other spatial dataset, such that two topological nodes are matched if they represent the same real-world intersection in the corresponding spatial datasets; and

(iii) matching the polylines in the two spatial datasets based on the previously matched topological nodes.

12. A system for integrating a plurality of spatial datasets comprising a plurality of topological nodes and polylines, said system comprising:

(i) means for finding the topological nodes of each spatial dataset and generating a plurality of pairs, each pair consisting of a topological node and an associated polyline such that said topological node is an endpoint of said associated polyline;

(ii) means for matching the topological node of each generated pair in said plurality of spatial datasets with another topological node in a generated pair of a different spatial dataset, such that two topological nodes are matched if they represent the same real-world location in the corresponding spatial datasets; and

(iii) means for matching the polylines in said plurality of spatial datasets based on the previously matched topological nodes.

13. A system according to claim 12, wherein the step of finding the topological nodes is done as a separate preprocessing operation for each spatial dataset.

14. A system according to claim 12, wherein matching said topological nodes takes into account the mutual bound error such that two topological nodes are matched if the distance between them is not greater than the mutual bound error.

15. A system according to claim 12, wherein matching two polylines is successful if one of the following relationships between said two polylines occur:

(i) complete overlap between said two polylines;

(ii) one polylines is an extension of the second polylines;

(iii) one polylines is contained in the second polylines; and

(iv) partial overlap of said two polylines.

16. A system according to claim 12, wherein said plurality of spatial datasets are road maps.

17. A system according to claim 16, wherein said real-world location is a real-world intersection.

18. A system according to claim 12, wherein two polylines are matched either when the topological nodes associated with each polyline are matched or when at least one topological node of one polyline is an intermediate point of the other polyline.

19. A system according to claim 12, wherein a topological node of one polyline is an intermediate point of another polyline when the distance between the topological node and the other polyline is smaller than P.

20. A system according to claim 12, wherein said matching the polylines is performed by matching of polylines where at least one of the topological nodes was matched in phase ii, and then by matching of polylines with only matching intermediate points.

21. A system according to claim 12, wherein the contents of each spatial dataset are updated individually.

22. A system for integrating two spatial datasets comprising a plurality of topological nodes and polylines representing real-world roads, said system comprising:

(i) means for finding the topological nodes of each spatial dataset and generating a plurality of pairs, each pair consisting of a topological node and an associated polyline such that said topological node is an endpoint of said associated polyline;

(ii) means for matching the topological node of each generated pair in one spatial dataset with another topological node in a generated pair of the other spatial dataset, such that two topological nodes are matched if they represent the same real-world intersection in the corresponding spatial datasets; and

(iii) means for matching the polylines in the two spatial datasets based on the previously matched topological nodes.

23. A computer-readable medium encoded with a program module that integrates a plurality of spatial datasets comprising a plurality of topological nodes and polylines, by:

(i) finding the topological nodes of each spatial dataset and generating a plurality of pairs, each pair consisting of a topological node and an associated polyline such that said topological node is an endpoint of said associated polyline;

(ii) matching the topological node of each generated pair in said plurality of spatial datasets with another topological node in a generated pair of a different spatial dataset, such that two topological nodes are matched if they represent the same real-world location in the corresponding spatial datasets; and

(iii) matching the polylines in said plurality of spatial datasets based on the previously matched topological nodes.

24. A medium according to claim 23, wherein the step of finding the topological nodes is done as a separate preprocessing operation for each spatial dataset.

25. A medium according to claim 23, wherein matching said topological nodes takes into account the mutual bound error such that two topological nodes are matched if the distance between them is not greater than the mutual bound error.

26. A medium according to claim 23, wherein matching two polylines is successful if one of the following relationships between said two polylines occur:

(i) complete overlap between said two polylines;

(ii) one polylines is an extension of the second polylines;

(iii) one polylines is contained in the second polylines; and

(iv) partial overlap of said two polylines.

27. A medium according to claim 23, wherein said plurality of spatial datasets are road maps.

28. A medium according to claim 27, wherein said real-world location is a real-world intersection.

29. A medium according to claim 23, wherein two polylines are matched either when the topological nodes associated with each polyline are matched or when at least one topological node of one polyline is an intermediate point of the other polyline.

30. A medium according to claim 23, wherein a topological node of one polyline is an intermediate point of another polyline when the distance between the topological node and the other polyline is smaller than β

.

31. A medium according to claim 23, wherein said matching the polylines is performed by matching of polylines where at least one of the topological nodes was matched in phase ii, and then by matching of polylines with only matching intermediate points.

32. A medium according to claim 23, wherein the contents of each spatial dataset are updated individually.

33. A computer-readable medium encoded with a program module that integrates two spatial datasets comprising a plurality of topological nodes and polylines representing real-world roads, by:

(i) finding the topological nodes of each spatial dataset and generating a plurality of pairs, each pair consisting of a topological node and an associated polyline such that said topological node is an endpoint of said associated polyline;

(ii) matching the topological node of each generated pair in one spatial dataset with another topological node in a generated pair of the other spatial dataset, such that two topological nodes are matched if they represent the same real-world intersection in the corresponding spatial datasets; and

(iii) matching the polylines in the two spatial datasets based on the previously matched topological nodes.