Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autorschaft

  • Steffen Busch
  • Claus Brenner
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des Sammelwerks2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019
UntertitelProceedings
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten1475-1481
Seitenumfang7
ISBN (elektronisch)978-1-5386-7024-8
ISBN (Print)978-1-5386-7025-5
PublikationsstatusVeröffentlicht - Okt. 2019
Veranstaltung2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019 - Auckland, Neuseeland
Dauer: 27 Okt. 201930 Okt. 2019

Abstract

We present a discrete reversible jump Markov Chain Monte Carlo (rjMCMC) algorithm to build lane accurate maps by solving a partition problem. Our algorithm finds lane middle axes by 2D cubic Hermite splines least squares alignment to trajectory clusters. The steps of the rjMCMC optimization are designed to change the number of clusters and the trajectory assignment. Furthermore, we introduce our tracking approach, which is used to generate our trajectory data base by tracking vehicles in Velodyne LiDAR scans at several junctions in Hannover, Germany. We validate our results by comparing them to a manually generated ground truth map, based on LiDAR mobile mapping data, and a manually generated reference map on base of the trajectory data to evaluate our result by ignoring accuracy errors of the tracking process. Finally, we show the transferability of our approach by applying it to datasets from the map construction data base.

ASJC Scopus Sachgebiete

Zitieren

Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering. / Busch, Steffen; Brenner, Claus.
2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019: Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. S. 1475-1481 8917150.

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Busch, S & Brenner, C 2019, Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering. in 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019: Proceedings., 8917150, Institute of Electrical and Electronics Engineers Inc., S. 1475-1481, 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019, Auckland, Neuseeland, 27 Okt. 2019. https://doi.org/10.1109/ITSC.2019.8917150
Busch, S., & Brenner, C. (2019). Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering. In 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019: Proceedings (S. 1475-1481). Artikel 8917150 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITSC.2019.8917150
Busch S, Brenner C. Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering. in 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019: Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. S. 1475-1481. 8917150 doi: 10.1109/ITSC.2019.8917150
Busch, Steffen ; Brenner, Claus. / Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering. 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019: Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. S. 1475-1481
Download
@inproceedings{a2e7a9ae32ef4d26bf126da1e0323110,
title = "Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering",
abstract = "We present a discrete reversible jump Markov Chain Monte Carlo (rjMCMC) algorithm to build lane accurate maps by solving a partition problem. Our algorithm finds lane middle axes by 2D cubic Hermite splines least squares alignment to trajectory clusters. The steps of the rjMCMC optimization are designed to change the number of clusters and the trajectory assignment. Furthermore, we introduce our tracking approach, which is used to generate our trajectory data base by tracking vehicles in Velodyne LiDAR scans at several junctions in Hannover, Germany. We validate our results by comparing them to a manually generated ground truth map, based on LiDAR mobile mapping data, and a manually generated reference map on base of the trajectory data to evaluate our result by ignoring accuracy errors of the tracking process. Finally, we show the transferability of our approach by applying it to datasets from the map construction data base.",
author = "Steffen Busch and Claus Brenner",
note = "Funding information: This work was funded by the German Science Foundation DFG within the priority programme SPP 1835, “Cooperative Interacting Automobiles”.; 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019 ; Conference date: 27-10-2019 Through 30-10-2019",
year = "2019",
month = oct,
doi = "10.1109/ITSC.2019.8917150",
language = "English",
isbn = "978-1-5386-7025-5",
pages = "1475--1481",
booktitle = "2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Download

TY - GEN

T1 - Discrete Reversible Jump Markov Chain Monte Carlo Trajectory Clustering

AU - Busch, Steffen

AU - Brenner, Claus

N1 - Funding information: This work was funded by the German Science Foundation DFG within the priority programme SPP 1835, “Cooperative Interacting Automobiles”.

PY - 2019/10

Y1 - 2019/10

N2 - We present a discrete reversible jump Markov Chain Monte Carlo (rjMCMC) algorithm to build lane accurate maps by solving a partition problem. Our algorithm finds lane middle axes by 2D cubic Hermite splines least squares alignment to trajectory clusters. The steps of the rjMCMC optimization are designed to change the number of clusters and the trajectory assignment. Furthermore, we introduce our tracking approach, which is used to generate our trajectory data base by tracking vehicles in Velodyne LiDAR scans at several junctions in Hannover, Germany. We validate our results by comparing them to a manually generated ground truth map, based on LiDAR mobile mapping data, and a manually generated reference map on base of the trajectory data to evaluate our result by ignoring accuracy errors of the tracking process. Finally, we show the transferability of our approach by applying it to datasets from the map construction data base.

AB - We present a discrete reversible jump Markov Chain Monte Carlo (rjMCMC) algorithm to build lane accurate maps by solving a partition problem. Our algorithm finds lane middle axes by 2D cubic Hermite splines least squares alignment to trajectory clusters. The steps of the rjMCMC optimization are designed to change the number of clusters and the trajectory assignment. Furthermore, we introduce our tracking approach, which is used to generate our trajectory data base by tracking vehicles in Velodyne LiDAR scans at several junctions in Hannover, Germany. We validate our results by comparing them to a manually generated ground truth map, based on LiDAR mobile mapping data, and a manually generated reference map on base of the trajectory data to evaluate our result by ignoring accuracy errors of the tracking process. Finally, we show the transferability of our approach by applying it to datasets from the map construction data base.

UR - http://www.scopus.com/inward/record.url?scp=85076823765&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2019.8917150

DO - 10.1109/ITSC.2019.8917150

M3 - Conference contribution

AN - SCOPUS:85076823765

SN - 978-1-5386-7025-5

SP - 1475

EP - 1481

BT - 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019

Y2 - 27 October 2019 through 30 October 2019

ER -