Efficient viewpoint assignment for urban texture documentation

We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones participate in collaborative collection of urban texture information. PTD enables inexpensive, scalable and high resolution urban texture documentation. We have proposed to implement PTD in two steps [10]. At the first step, termed viewpoint selection, a minimum number of points in the urban environment are selected from which the texture of the entire urban environment (the part visible to cameras) can be collected/captured. At the second step, called viewpoint assignment, the selected viewpoints are assigned to the participating users such that given a limited number of users with various constraints (e.g., restricted available time) users can collectively capture the maximum amount of texture information within a limited time interval. In this paper, we focus on the viewpoint assignment problem. We first prove that this problem is an NP-hard problem, and therefore, the optimal solution for viewpoint assignment fails to scale as the extent of the urban environment and the number of participating users grow. Subsequently, we propose a family of heuristics for efficient viewpoint assignment to reduce the assignment running time while ensuring an almost complete texture collection. We study, profile and verify our proposed solutions comparatively by both rigorous analysis and extensive experiments.

[1]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[2]  James J. Little,et al.  Automatic extraction of Irregular Network digital terrain models , 1979, SIGGRAPH.

[3]  Andreas Krause,et al.  Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.

[4]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[5]  Gaurav S. Sukhatme,et al.  Adaptive Sampling With Multiple Mobile Robots , 2008 .

[6]  Gaurav S. Sukhatme,et al.  Energy based path planning for a novel cabled robotic system , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Ke Chen,et al.  The Euclidean Orienteering Problem Revisited , 2008, SIAM J. Comput..

[8]  Farnoush Banaei Kashani,et al.  Efficient Viewpoint Selection for Urban Texture Documentation , 2009, GSN.

[9]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[10]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[11]  Vipin Kumar,et al.  Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.

[12]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[13]  Vipin Kumar,et al.  Introduction to Data Mining, (First Edition) , 2005 .

[14]  Chandra Chekuri,et al.  A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[15]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..