Consistent dynamic map labeling with fairness and importance

2020 ◽  
Vol 81 ◽  
pp. 101892
Author(s):  
Xiao Zhang ◽  
Sheung-Hung Poon ◽  
Shengxin Liu ◽  
Minming Li ◽  
Victor C.S. Lee
Keyword(s):  
Algorithmica ◽  
2020 ◽  
Vol 82 (10) ◽  
pp. 2709-2736
Author(s):  
Andreas Gemsa ◽  
Benjamin Niedermann ◽  
Martin Nöllenburg

Abstract We consider map labeling for the case that a map undergoes a sequence of operations such as rotation, zoom and translation over a specified time span. We unify and generalize several previous models for dynamic map labeling into one versatile and flexible model. In contrast to previous research, we completely abstract from the particular operations and express the labeling problem as a set of time intervals representing the labels’ presences, activities and conflicts. One of the model’s strength is manifested in its simplicity and broad range of applications. In particular, it supports label selection both for map features with fixed position as well as for moving entities (e.g., for tracking vehicles in logistics or air traffic control). We study the active range maximization problem in this model. We prove that the problem is -complete and [1]-hard, and present constant-factor approximation algorithms. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we give polynomial-time algorithms as well as constant-factor approximation algorithms.


2010 ◽  
Vol 43 (3) ◽  
pp. 312-328 ◽  
Author(s):  
Ken Been ◽  
Martin Nöllenburg ◽  
Sheung-Hung Poon ◽  
Alexander Wolff
Keyword(s):  

2016 ◽  
Vol 640 ◽  
pp. 84-93 ◽  
Author(s):  
Chung-Shou Liao ◽  
Chih-Wei Liang ◽  
Sheung Hung Poon

2006 ◽  
Vol 12 (5) ◽  
pp. 773-780 ◽  
Author(s):  
Ken Been ◽  
Eli Daiches ◽  
Chee Yap
Keyword(s):  

Author(s):  
Andreas Gemsa ◽  
Benjamin Niedermann ◽  
Martin Nöllenburg
Keyword(s):  

Author(s):  
JUAN ANDRADE-CETTO ◽  
ALBERTO SANFELIU

A system that builds and maintains a dynamic map for a mobile robot is presented. A learning rule associated to each observed landmark is used to compute its robustness. The position of the robot during map construction is estimated by combining sensor readings, motion commands, and the current map state by means of an Extended Kalman Filter. The combination of landmark strength validation and Kalman filtering for map updating and robot position estimation allows for robust learning of moderately dynamic indoor environments.


Data ◽  
2020 ◽  
Vol 5 (4) ◽  
pp. 117
Author(s):  
Céline Bassine ◽  
Julien Radoux ◽  
Benjamin Beaumont ◽  
Taïs Grippa ◽  
Moritz Lennert ◽  
...  

Land cover maps contribute to a large diversity of geospatial applications, including but not limited to land management, hydrology, land use planning, climate modeling and biodiversity monitoring. In densely populated and highly fragmented landscapes as observed in the Walloon region (Belgium), very high spatial resolution is required to depict all the infrastructures, buildings and most of the structural elements of the semi-natural landscapes (like hedges and small water bodies). Because of the resolution, the vertical dimension needs explicit handling to avoid discontinuities incompatible with many applications. For example, how to map a river flowing under a bridge? The particularity of our data is to provide a two-digit land cover code to label all the overlapping items. The identification of all the overlaps resulted from the combination of remote sensing image analysis and decision rules involving ancillary data. The final product is therefore semantically precise and accurate in terms of land cover description thanks to the addition of 24 classes on top of the 11 pure land cover classes. The quality of the map has been assessed using a state-of-the-art validation scheme. Its overall accuracy is as high as 91.5%, with an average producer’s accuracy of 86% and an average user’s accuracy of 91%.


Sign in / Sign up

Export Citation Format

Share Document