Mapping Infrastructure Layout Between Non-Corresponding Datasets

• US 20140101180A1
• Filed: 02/23/2013
• Published: 04/10/2014
• Est. Priority Date: 10/08/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Murphy, Liam J., Nesbitt, Pamela A., O'Sullivan, Shane
• Granted Patent: US 9,928,620 B2
• Time in Patent Office: Days
• US Class Current: 707/756
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G01C 21/30 Map- or contour-matching
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: G01C 21/3492 employing speed data or traffic data, e.g. real-time or historical traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G01C 21/3694 Output thereof on a road map
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/34 Browsing; Visualisation therefor
• CPC Class Codes: G06T 11/001 Texturing; Colouring; Generation of texture or colour inpainting G06T5/77
• CPC Class Codes: G06T 11/203 Drawing of straight lines or curves
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs
• CPC Class Codes: G06T 2207/30184 Infrastructure
• CPC Class Codes: G06T 2207/30236 Traffic on road, railway or crossing
• CPC Class Codes: G08G 1/096833 where different aspects are considered when computing the route
• CPC Class Codes: G08G 1/123 indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, tramstransmission of navigation instructions to vehicles G08G1/0968
• CPC Class Codes: H04H 20/55 for traffic information

Abstract

A method for mapping infrastructure layout between non-corresponding datasets including accessing from a memory a set of long links with points that trace the curvature of a set of linestrings, accessing from the memory a set of short links that are short enough for analytical purposes wherein each short link represents a straight line, and from the set of long links and the set of short links, using a processor to create a set of hybrid links for storage in the memory, each hybrid link corresponding to one short link for analytic purposes, a plurality of the hybrid links including at least one of the points for tracing the curvature of the set of linestrings.

Claims

1. A method of mapping infrastructure layout between non-corresponding datasets comprising:

accessing from a memory a set of long links with points that trace the curvature of a set of linestrings;

accessing from the memory a set of short links that are short enough for analytical purposes wherein each short link represents a straight line; and

from the set of long links and the set of short links, using a processor to create a set of hybrid links for storage in the memory, each hybrid link corresponding to one short link for analytic purposes, a plurality of the hybrid links including at least one of the points for tracing the curvature of the set of linestrings.

2. The method of claim 1 wherein a first mapping service uses the set of long links to map linestrings and a second mapping service uses the set of short links to map linestrings, so that linestrings from the first and second mapping services can be related.

3. The method of claim 2 wherein the first mapping service is a transportation application.

4. The method of claim 1 wherein each short link has two endpoints and each long link has a plurality of points, wherein the endpoints of each short link are compared to the points of at least one long link to determine which points are included with the corresponding hybrid link.

5. The method of claim 4 wherein a location of the endpoints of each short link is compared to a location of the points of at least one long link to determine for each short link which points are located between the endpoints for inclusion in the corresponding hybrid link.

6. The method of claim 1 wherein traffic information used to update a plurality of short links is utilized by the processor to update a plurality of corresponding hybrid links.

7. The method of claim 6 wherein analysis is performed by the processing unit on a plurality of the short links to generate traffic information results and wherein the traffic information results are utilized by the processor to update a plurality of corresponding of hybrid links.

8. The method of claim 6 wherein analysis is performed by the processor directly on the set of hybrid links to generate traffic information results.

9-24. -24. (canceled)