This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:projh402 [2021/08/18 13:46] ezimanyi [Visualization of Moving Objects on the Web] |
teaching:projh402 [2021/08/18 15:03] ezimanyi [Course objective] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| ===== Course objective ===== | ===== Course objective ===== | ||
| - | The course PROJ-H-402 is managed by Dr. Mauro Birattari. Please refer to the course description page http://iridia.ulb.ac.be/proj-h-402/index.php/Main_Page for the rules concerning the project. What follows is a list of project proposals supervised by academic members of the WIT laboratory. | + | The course PROJ-H-402 is managed by Dr. Mauro Birattari. Please refer to the [[http://iridia.ulb.ac.be/wiki/PROJ-H-402_-_Computing_Project:_Rules|course description page]] for the rules concerning the project. What follows is a list of project proposals supervised by academic members of the WIT laboratory. |
| ===== Projects in Mobility Databases ===== | ===== Projects in Mobility Databases ===== | ||
| Line 55: | Line 55: | ||
| Map-matched trajectory | Map-matched trajectory | ||
| - | The goal of this project is to build an architecture for a Map-Matching service. The challanges are that the GPS data arrives in different formats, and that Map-Matching is a time consuming Algorithm. This architecture should thus allow different input formats, and should be able to automatically scale according to the request rate. Another key outcome of this project is to compare the existing Map-Matching implementations, and to discuss their suitability in real world problems. | + | The goal of this project is to build an architecture for a Map-Matching service. The challenges are that the GPS data arrives in different formats, and that Map-Matching is a time consuming Algorithm. This architecture should thus allow different input formats, and should be able to automatically scale according to the request rate. Another key outcome of this project is to compare the existing Map-Matching implementations, and to discuss their suitability in real world problems. |
| Links: | Links: | ||
| Line 62: | Line 62: | ||
| * [[https://github.com/graphhopper/map-matching|GraphHopper]] | * [[https://github.com/graphhopper/map-matching|GraphHopper]] | ||
| * [[https://github.com/cyang-kth/fmm|Fast Map Matching]] | * [[https://github.com/cyang-kth/fmm|Fast Map Matching]] | ||
| + | |||
| + | ===== Symbolic trajectories ===== | ||
| + | |||
| + | Symbolic trajectories enable to attach semantic information to geometric trajectories. Essentially, symbolic trajectories are just time-dependent labels representing, for example, the names of roads traversed obtained by map matching, transportation modes, speed profile, cells of a cellular network, behaviors of animals, cinemas within 2km distance, and so forth. Symbolic trajectories can be combined with geometric trajectories to obtain annotated trajectories. | ||
| + | |||
| + | The goal of this project is to explore how to implement symbolic trajectories in MobilityDB. This implementation will be based on the ttext (temporal text) data type implemented in MobilityDB and will explore how to extend it with regular expressions. This extension can be inspired from the [[https://www.postgresql.org/docs/13/functions-json.html|jsonb]] data type implemented in PostgreSQL. | ||
| + | |||
| + | Links: | ||
| + | * {{:teaching:symbolic_trajectories.pdf|}} | ||
| + | |||
| + | |||