Mapping infrastructure layout between non-corresponding datasets

US9552372B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9552372-B2
Application numberUS-201213647056-A
CountryUS
Kind codeB2
Filing dateOct 8, 2012
Priority dateOct 8, 2012
Publication dateJan 24, 2017
Grant dateJan 24, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A system or computer usable program product 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.

First claim

Opening claim text (preview).

What is claimed is: 1. A data processing system for mapping infrastructure layout between non-corresponding traffic datasets, the data processing system comprising: a processor; and a memory storing program instructions which when executed by the processor execute the steps of: accessing from the memory a set of long links with segments that trace a detailed shape of a first set of geospatial linestrings of roadways, each long link having a set of segments, each segment having two points with geospatial coordinates; accessing from the memory a set of short links that are short enough for traffic analytical purposes wherein each short link has two endpoints with geospatial coordinates that represent a straight line with endpoints that trace a shape of a second set of geospatial linestrings of the roadways, each of the endpoints having geospatial coordinates; from the set of long links and the set of short links, using the processor to create a set of hybrid links for storage in the memory, each hybrid link having two endpoints corresponding to the two endpoints of one short link for traffic analytic purposes, a plurality of the hybrid links including at least one of the long link segments for tracing the detailed shape of the first set of geospatial linestrings of the roadways, wherein a location of the endpoints of each short link is compared to a location of the segment points of at least one long link to determine for each short link which segment points are located closest to the short link endpoints for inclusion in the corresponding hybrid link, wherein the geospatial coordinates of the endpoints of each short link are compared to the geospatial coordinates of the segment points of at least one long link to determine which segment points are included between the endpoints of the corresponding hybrid link, and wherein the set of hybrid links are created based a distance between geospatial coordinates of long link segment points and short link endpoints, each hybrid link having endpoints of the corresponding short link endpoints and points of the corresponding long link segment points to trace the shape of the first set of geospatial linestrings; determining whether the segment points located closest to the short link endpoints are within a minimum distance from the short link endpoints; and upon a negative determination identifying the short link endpoints for manual processing; receiving traffic information for an endpoint of a first short link of the set of short links; utilizing the processor to update a corresponding endpoint of a first hybrid link of the set of hybrid links associated with the first short link with the traffic information; and providing the traffic information of the updated endpoint of the first hybrid link for display to a user. 2. The data processing system of claim 1 wherein a first mapping service uses the set of long links to map the first set of geospatial linestrings of the roadways and a second mapping service uses the set of short links to map the second set of geospatial linestrings of the roadways, so that linestrings from the first and second mapping services can be related by the hybrid links based on geospatial coordinates of the linestrings. 3. The data processing system of claim 1 further comprising normalizing the long link segment points geospatial coordinates with the short links endpoint geospatial coordinate prior to creating the hybrid links. 4. The data processing system of claim 1 wherein traffic information provided for updating a plurality of short links is utilized by the processor to update a plurality of corresponding hybrid links. 5. The data processing system of claim 4 wherein analysis is performed by the processor on a plurality of the short links to generate traffic information results and wherein the traffic information results are utilized by the processing unit to update a plurality of corresponding of hybrid links. 6. The data processing system of claim 4 wherein analysis is performed by the processor directly on the set of hybrid links to predict traffic flow including traffic speed and volume. 7. A computer usable program product comprising a non-transitory computer usable storage medium including computer usable code for use in mapping infrastructure layout between non-corresponding traffic datasets, the computer usable program product comprising code for performing the steps of: accessing from a memory a set of long links with segments that trace a detailed shape of a first set of geospatial linestrings of roadways, each long link having a set of segments, each segment having two points with geospatial coordinates; accessing from the memory a set of short links that are short enough for traffic analytical purposes wherein each short link has two endpoints with geospatial coordinates that represent a straight line with endpoints that trace a shape of a second set of geospatial linestrings of the roadways, each of the endpoints having geospatial coordinates; from the set of long links and the set of short links, using the processor to create a set of hybrid links for storage in the memory, each hybrid link having two endpoints corresponding to the two endpoints of one short link for traffic analytic purposes, a plurality of the hybrid links including at least one of the long link segments for tracing the detailed shape of the first set of geospatial linestrings of the roadway, wherein a location of the endpoints of each short link is compared to a location of the segment points of at least one long link to determine for each short link which segment points are located closest to the short link endpoints for inclusion in the corresponding hybrid link, wherein the geospatial coordinates of the endpoints of each short link are compared to the geospatial coordinates of the segment points of at least one long link to determine which segment points are included between the endpoints of the corresponding hybrid link, and wherein the set of hybrid links are created based a distance between geospatial coordinates of long link segment points and short link endpoints, each hybrid link having endpoints of the corresponding short link endpoints and points of the corresponding long link segment points to trace the shape of the first set of geospatial linestrings; determining whether the segment points located closest to the short link endpoints are within a minimum distance from the short link endpoints; and upon a negative determination identifying the short link endpoints for manual processing; receiving traffic information for an endpoint of a first short link of the set of short links; utilizing the processor to update a corresponding endpoint of a first hybrid link of the set of hybrid links associated with the first short link with the traffic information; and providing the traffic information of the updated endpoint of the first hybrid link for display to a user. 8. The computer usable program product of claim 7 wherein a first mapping service uses the set of long links to map the first set of geospatial linestrings of the roadways and a second mapping service uses the set of short links to map the second set of geospatial linestrings of the roadways, so that linestrings from the first and second mapping services can be related by the hybrid links based on geospatial coordinates of the linestrings. 9. The computer usable program product of claim 7 further comprising normalizing the long link segment points geospatial coordinates with the short links endpoint geospatial coordinate prior to creating the hybrid links. 10. The computer usable program product of claim 7 wherein traffic information provided for updating a plurality of short links is utiliz

Assignees

Inventors

Classifications

  • Drawing of charts or graphs · CPC title

  • Texturing; Colouring; Generation of textures or colours (retouching, inpainting or scratch removal G06T5/77) · CPC title

  • G06T11/23Primary

    using straight lines or curves · CPC title

  • specially adapted for navigation in a road network · CPC title

  • Visual data mining; Browsing structured data · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9552372B2 cover?
A system or computer usable program product 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 lon…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06T11/23. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 24 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).