Please use this identifier to cite or link to this item:
https://doi.org/10.1109/IWCMC.2013.6583784
DC Field | Value | |
---|---|---|
dc.title | An indoor dead-reckoning algorithm with map matching | |
dc.contributor.author | Bao, H. | |
dc.contributor.author | Wong, W.-C. | |
dc.date.accessioned | 2014-06-19T02:59:25Z | |
dc.date.available | 2014-06-19T02:59:25Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Bao, H.,Wong, W.-C. (2013). An indoor dead-reckoning algorithm with map matching. 2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013 : 1534-1539. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/IWCMC.2013.6583784" target="_blank">https://doi.org/10.1109/IWCMC.2013.6583784</a> | |
dc.identifier.isbn | 9781467324793 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/69327 | |
dc.description.abstract | Step counting based dead-reckoning has been widely accepted as a cheap and effective solution for indoor pedestrian tracking using hand held device equipped with motion sensors. To calibrate the accumulating error in a dead-reckoning tracking system, extra techniques are always fused to form a hybrid system. Currently various particle filter based map filtering algorithms have been proposed in the literature. However, more improvement can be achieved by using map information. In this paper, a map matching involved step counting algorithm is proposed. It is shown that by applying map matching in an indoor environment with corridors, not only can the estimated location be calibrated, but also the estimated sensor's orientation and the walking direction, which reduces the error in the ensuing location update process. The computational complexity is also less than the particle filter. Experimental results show that map matching algorithm returns more accurate results than the particle filter given the same map information. Further experiments indicate that when incomplete map information is given, the particle filter is much easier in returning a drifted path compared to map matching. This indicates that less map information is required by map matching to achieve a robust performance. This reduced reliance on accurate map information implies less labour cost and error in map maintenance. © 2013 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/IWCMC.2013.6583784 | |
dc.source | Scopus | |
dc.subject | Dead-reckoning | |
dc.subject | Map filtering | |
dc.subject | Map matching | |
dc.subject | Particle filter | |
dc.subject | Step counting | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/IWCMC.2013.6583784 | |
dc.description.sourcetitle | 2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013 | |
dc.description.page | 1534-1539 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.