1 Ocak 2018 Dergi makalesi Açık Erişim

Ozdemir, Erdem; Topcu, Ahmet E.; Ozdemir, Mehmet Kemal

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">A hybrid HMM model for travel path inference with sparse GPS samples</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">TRANSPORTATION</subfield>
    <subfield code="v">45</subfield>
    <subfield code="n">1</subfield>
    <subfield code="c">233-246</subfield>
  </datafield>
  <controlfield tag="001">36259</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">In this study, we propose a novel method for a travel path inference problem from sparse GPS trajectory data. This problem involves localization of GPS samples on a road network and reconstruction of the path that a driver might have been following from a low rate of sampled GPS observations. Particularly, we model travel path inference as an optimization problem in both the spatial and temporal domains and propose a novel hybrid hidden Markov model (HMM) that uses a uniform cost search (UCS)-like novel combinational algorithm. We provide the following improvements over the previous studies that use HMM-based methods: (1) for travel path inference between matched GPS positions, the proposed hybrid HMM algorithm evaluates all candidate paths to find the most likely path for both the temporal and spatial domains. In contrast, previous studies either create interpolated trajectories or connect matched GPS positions using the shortest path assumption, which might not be true, especially in urban road networks (Goh et al. 2012; Lou et al. 2009). (2) The proposed algorithm uses legal speed limits for the evaluation of discrepancy in the temporal domain as in Goh et al. (2012), and Lou et al. (2009) only if there is not sufficient historical average speed data; otherwise, we use historical average speed computed from data. Our experiments with real datasets show that our algorithm performs better than the state of the art VTrack algorithm (Thiagarajan et al. 2009), especially for cases where GPS data is sampled infrequently.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Yildirim Beyazit Univ, Dept Comp Engn, Ankara, Turkey</subfield>
    <subfield code="a">Topcu, Ahmet E.</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Istanbul Sehir Univ, Dept Elect &amp; Elect Engn, Istanbul, Turkey</subfield>
    <subfield code="a">Ozdemir, Mehmet Kemal</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Yildirim Beyazit Univ, Dept Comp Engn, Ankara, Turkey</subfield>
    <subfield code="a">Ozdemir, Erdem</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018-01-01</subfield>
  </datafield>
  <controlfield tag="005">20210315193321.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:36259</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:902e24dde91b61ad15ee15b1edab6d9a</subfield>
    <subfield code="s">146</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/36259/files/bib-d0999a91-c948-4ce1-be6e-8dbbd8c0f574.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s11116-016-9734-2</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>