This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
teaching:mfe:is [2019/07/09 13:24] msakr |
teaching:mfe:is [2020/09/29 17:02] mahmsakr [Python driver for Trajectories] |
||
|---|---|---|---|
| Line 49: | Line 49: | ||
| **Interested?** Contact : [[svsummer@ulb.ac.be|Stijn Vansummeren]] | **Interested?** Contact : [[svsummer@ulb.ac.be|Stijn Vansummeren]] | ||
| - | **Status**: available | + | **Status**: taken |
| ===== Graph Indexing for Fast Subgraph Isomorphism Testing ===== | ===== Graph Indexing for Fast Subgraph Isomorphism Testing ===== | ||
| Line 96: | Line 96: | ||
| * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| - | **Status**: available | + | **Status**: taken |
| - | =====Python driver for Trajectories===== | ||
| - | Similar to the previous topic, yet for Python. | ||
| - | |||
| - | **Interested?** | ||
| - | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| - | |||
| - | **Status**: available | ||
| =====Mobility data exchange standards===== | =====Mobility data exchange standards===== | ||
| Line 145: | Line 138: | ||
| **Status**: not available | **Status**: not available | ||
| + | =====Scalable Map-Matching===== | ||
| + | GPS trajectories originate in the form of a series of absolute lat/lon coordinates. Map-matching is the method of locating the GPS observations onto a road network. It transforms the lat/lon pairs into pairs of a road identifier and a fraction representing the relative position on the road. This preprocessing is essential to trajectory data analysis. It contributes to cleaning the data, as well as preparing it for network-related analysis. There are two modes of map-matching: (1) offline, where all the observations of the trajectory exist before starting the map-matching, and (2) online, where the observation arrive to the map-matcher one by one in a streaming fashion. Map-matching is known to be an expensive pre-processing, in terms of processing time. The growing amount of trajectory data (e.g., autonomous cars) call for map-matching methods that can scale-out. This thesis is about proposing such a solution. It shall survey the existing Algorithms, benchmark them, and propose a scale out architecture. | ||
| + | MobilityDB has types for lat/lon trajectories, as well as map-matched trajectories. the implementation of this thesis shall be integrated with MobilityDB. | ||
| + | |||
| + | **Interested?** | ||
| + | * Contact : [[ezimanyi@ulb.ac.be|Esteban Zimanyi]] | ||
| + | |||
| + | **Status**: available | ||