Repository of University of Nova Gorica

Show document
A+ | A- | Help | SLO | ENG

Title:A map-matching algorithm dealing with sparse cellular fingerprint observations
Authors:ID Dalla Torre, Andrea (Author)
ID Gallo, Paolo (Author)
ID Gubiani, Donatella (Author)
ID Marshall, Chris (Author)
ID Montanari, Angelo (Author)
ID Pittino, Federico (Author)
ID Viel, Andrea (Author)
Files:.pdf A_map_matching_algorithm_dealing_with_sparse_cellular_fingerprint_observations.pdf (3,93 MB)
MD5: DE7EAC6618E2E82F887D344FE902A615
 
Language:English
Work type:Not categorized
Typology:1.01 - Original Scientific Article
Organization:UNG - University of Nova Gorica
Abstract:The widespread availability of mobile communication makes mobile devices a resource for the collection of data about mobile infrastructures and user mobility. In these contexts, the problem of reconstructing the most likely trajectory of a device on the road network on the basis of the sequence of observed locations (map-matching problem) turns out to be particularly relevant. Different contributions have demonstrated that the reconstruction of the trajectory of a device with good accuracy is technically feasible even when only a sparse set of GNSS positions is available. In this paper, we face the problem of coping with sparse sequences of cellular fingerprints. Compared to GNSS positions, cellular fingerprints provide coarser spatial information, but they work even when a device is missing GNSS positions or is operating in an energy saving mode. We devise a new map-matching algorithm, that exploits the well-known Hidden Markov Model and Random Forests to successfully deal with noisy and sparse cellular observations. The performance of the proposed solution has been tested over a medium-sized Italian city urban environment by varying both the sampling of the observations and the density of the fingerprint map as well as by including some GPS positions into the sequence of fingerprint observations.
Keywords:Map-matching algorithm, trajectory, cellular fingerprint, Hidden Markov Model
Year of publishing:2019
Number of pages:18
Numbering:22, 2
PID:20.500.12556/RUNG-4386-26571330-0722-f33b-9fe2-22b8d20ceb74 New window
COBISS.SI-ID:5404411 New window
DOI:10.1080/10095020.2019.1616933 New window
NUK URN:URN:SI:UNG:REP:C5IDSXWZ
Publication date in RUNG:11.06.2019
Views:3270
Downloads:97
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Geo-spatial Information Science
Publisher:Taylor and Francis
Year of publishing:2019
ISSN:1009-5020

Licences

License:CC BY-NC 4.0, Creative Commons Attribution-NonCommercial 4.0 International
Link:http://creativecommons.org/licenses/by-nc/4.0/
Description:A creative commons license that bans commercial use, but the users don’t have to license their derivative works on the same terms.
Licensing start date:06.02.2019

Back