IP Library Granted Patent US 9,251,277
Granted Patent B2
US 9,251,277 · App. 13/800,928 · Granted Feb 2, 2016

Mining trajectory for spatial temporal analytics

Inventors: Arun Hampapur (Norwalk, CT); Qing He (Ossining, NY); Xuan Liu (Yorktown Heights, NY); Songhua Xing (Yorktown Heights, NY)
Assignee: International Business Machines Corporation
G06F17/3087G06F17/30241
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,251,277
App. No.
13/800,928
Granted
Feb 2, 2016
Kind
B2
Abstract

A method is provided to generate a heat map to show traffic congestion based on transit points. The method includes generating, by a processing device, a trajectory database from time-stamped global positioning system (GPS) sample points, and computing transit points for each trajectory in the trajectory database. The method further includes constructing a temporal transit graph. The transit graph captures the shortest paths among the transit points. The method further includes indexing and storing the transit graph in a spatial-temporal database for online analytic processing.

Claims (34)

1. A computer-implemented method, comprising:

generating, by a processing device, a trajectory database from time-stamped global positioning system (GPS) sample points;

computing transit points for each trajectory in the trajectory database, each transit point computed from a respective time-stamped GPS sample point, wherein computing the transit points includes computing a connectivity among all point transit clusters and clustering transit points located in similar network locations of the trajectory graph, whereby the centroids of transit point clusters form a node for the transit graph;

grouping the transit points into individual transit clusters, and constructing a temporal transit graph based on the transit clusters to define an aggregated trajectory of traffic patterns, the transit graph capturing the shortest paths among the transit points;

determining a common route of at least two vehicles whose GPS sampling intervals are different based on performing a trajectory alignment of the transit points with respect to a road network;

when two consecutive GPS points do not locate on the same or adjacent road segments, connecting the consecutive GPS points by the shortest path and performing a temporal interpolation to generate modified time stamps corresponding to the connected GPS points; and

indexing and storing the transit graph in a spatial-temporal database for online analytic processing, the online analytic processing comprising receiving spatial-temporal queries on the transit graph via a user interface,

wherein the GPS sample points that are collected from GPS logs of a plurality of vehicles in a street network table to define traffic patterns.

2. The computer-implemented method of claim 1 , wherein the transit points divide each trajectory into a number of sub-trajectories, each sub-trajectory being an exact shortest path between each transit point.

3. The computer-implemented method of claim 1 , wherein the generating of the trajectory database further comprises:

removing corrupted GPS sample points; and

aligning qualified GPS sample points to a road network.

4. The computer-implemented method of claim 1 , wherein the constructing of the temporal transit graph further comprises:

color coding the transit graph based on a number of routes passed on each transit edge of the transit graph.

5. The computer-implemented method of claim 1 , wherein the online analytic processing comprises receiving spatial-temporal queries on the transit graph via a user interface.

6. The computer-implemented method of claim 1 , wherein the temporal transit graph is constructed offline and the online analytics processing occurs online.

7. A computer program product, comprising:

a computer readable storage medium having program code embodied therewith, the program code executable by a processing device for:

generating, by the processing device, a trajectory database from time-stamped global positioning system (GPS) sample points;

computing transit points for each trajectory in the trajectory database, each transit point computed from a respective time-stamped GPS sample point, wherein computing the transit points includes computing a connectivity among all point transit clusters and clustering transit points located in similar network locations of the trajectory graph, whereby the centroids of transit point clusters form a node for the transit graph;

grouping the transit points into individual transit clusters, and constructing a temporal transit graph based on the transit clusters to define an aggregated trajectory of traffic patterns, the transit graph capturing the shortest paths among the transit points;

determining a common route of at least two vehicles whose GPS sampling intervals are different based on performing a trajectory alignment of the transit points with respect to a road network;

when two consecutive GPS points do not locate on the same or adjacent road segments, connecting the consecutive GPS points by the shortest path and performing a temporal interpolation to generate modified time stamps corresponding to the connected GPS points; and

indexing and storing the transit graph in a spatial-temporal database for online analytic processing, the online analytic processing comprising receiving spatial-temporal queries on the transit graph via a user interface,

wherein the GPS sample points that are collected from GPS logs of a plurality vehicles in a street network table define the traffic patterns.

8. The computer program product of claim 7 , wherein the transit points divide each trajectory into a number of sub-trajectories, each sub-trajectory being an exact shortest path between each transit point.

9. The computer program product of claim 7 , wherein the generating of the trajectory database further comprises:

removing corrupted GPS sample points; and

aligning qualified GPS sample points to a road network.

10. The computer program product of claim 7 , wherein the constructing of the temporal transit graph further comprises:

computing a connectivity among all point transit clusters; and

color coding the transit graph based on a number of routes passed on each transit edge of the transit graph.

11. The computer program product of claim 7 , wherein the online analytic processing comprises receiving spatial-temporal queries on the transit graph via a user interface.

12. The computer program product of claim 7 , wherein the temporal transit graph is constructed offline and the online analytics processing occurs online.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 13, 2013
From: HAMPAPUR, ARUN; HE, QING; LIU, XUAN; XING, SONGHUA
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 029987/0838 →
Continuity (2)
Provisional Application 61734453 · Dec 7, 2012
Related Publication 20140164389A1 · Jun 12, 2014