Johannes Oehrlein

Johannes Oehrlein

Auto-generated profile, based on publicly available information

Johannes Oehrlein

University of Bonn

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2021 in ISPRS Journal of Photogrammetry and Remote Sensing
Verified
Journal Article
Closed access
YDYouness Dehbi
Youness Dehbi
JLJohannes Leonhardt
Johannes Leonhardt
JOJohannes Oehrlein
Johannes Oehrlein
JHJan-Henrik Haunert
Jan-Henrik Haunert

22 December 2017 in Journal of Spatial Information Science
Verified
Journal Article
Open access
JOJohannes Oehrlein
Johannes Oehrlein
JHJan-Henrik Haunert
Jan-Henrik Haunert

26 January 2021 in Cartography and Geographic Information Science
Verified
Journal Article
Closed access
SGSven Gedicke
Sven Gedicke
JOJohannes Oehrlein
Johannes Oehrlein
JHJan-Henrik Haunert
Jan-Henrik Haunert
Map generalization is the process of deriving small-scale target maps from a large-scale source map or database while preserving valuable information. In this paper we focus on topographic data, in particular areas of different land-use classes and line features representing the road network. When reducing the map scale, some areas need to be merged to larger composite regions. This process is known as area aggregation. Given a planar partition of areas, one usually aims to build geometrically compact regions of sufficient size while keeping class changes small. Since line features (e.g. roads) are perceived as separating elements in a map, we suggest integrating them into the process of area aggregation. Our aim is that boundaries of regions coincide with line features in such a way that strokes (i.e. chains of line features with small angles of deflection) are not broken into short sections. Complementing the criteria of compact regions and preserving land-use information, we consider this aim as a third criterion. Regarding all three criteria, we formalize an optimization problem and solve it with a heuristic approach using simulated annealing. Our evaluation is based on experiments with different parameter settings. In particular, we compare results of a baseline method that considers two criteria, namely compactness and class changes, with results of our new method that additionally considers our stroke-based criterion. Our results show that this third criterion can be substantially improved while keeping the quality with respect to the original two criteria on a similar level.

1 October 2019 in PFG – Journal of Photogrammetry, Remote Sensing and Geoinformation Science
Verified
Journal Article
Closed access
PDF file
JOJohannes Oehrlein
Johannes Oehrlein
BNBenjamin Niedermann
Benjamin Niedermann
JHJan-Henrik Haunert
Jan-Henrik Haunert

17 May 2023 in Journal of Spatial Information Science
Verified
Journal Article
Open access
PDF file
AFAxel Forsch
Axel Forsch
JOJohannes Oehrlein
Johannes Oehrlein
BNBenjamin Niedermann
Benjamin Niedermann
JHJan-Henrik Haunert
Jan-Henrik Haunert
The optimal path between two vertices in a graph depends on the optimization objective, which is often defined as a weighted sum of multiple criteria. When integrating two criteria, their relative importance is expressed with a balance factor α. We present a new approach for inferring α from trajectories. The core of our approach is a compression algorithm that requires a graph G representing a transportation network, two edge costs modeling routing criteria, and a path P in G representing the trajectory. It yields a minimum subsequence S of the sequence of vertices of P and a balance factor α, such that the path P can be fully reconstructed from S, G, its edge costs, and α. By minimizing the size of S over α, we learn the balance factor that corresponds best to the user's routing preferences. In an evaluation with crowd-sourced cycling trajectories, we weigh the usage of official signposted cycle routes against other routes. More than 50% of the trajectories can be segmented into five optimal sub-paths or less. Almost 40% of the trajectories indicate that the cyclist is willing to take a detour of 50% over the geodesic shortest path to use an official cycle path.

7 November 2017
Verified
Conference Paper
Open access
PDF file
JOJohannes Oehrlein
Johannes Oehrlein
BNBenjamin Niedermann
Benjamin Niedermann
JHJan-Henrik Haunert
Jan-Henrik Haunert