Users plan optimization for participatory 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 quality urban texture documentation. We propose to implement PTD in two steps. At the first step, termed viewpoint selection, a minimum number of viewpoints in the urban environment are selected from which the texture of the entire urban environment (the part visible to cameras) with a desirable quality 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 define each of these steps and prove that both are NP-hard problems. Accordingly, we propose efficient algorithms to implement the viewpoint selection and assignment problems. We study, profile and verify our proposed solutions comparatively by both rigorous analysis and extensive experiments.

[1]  Matthias Trapp,et al.  Interactive Visualization of Generalized Virtual 3D City Models using Level‐of‐Abstraction Transitions , 2012, Comput. Graph. Forum.

[2]  R. Lienhart,et al.  On the optimal placement of multiple visual sensors , 2006, VSSN '06.

[3]  Hiroaki Kitano,et al.  Proceedings of the 21st international jont conference on Artifical intelligence , 2009 .

[4]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[5]  Ronald W. Wolff A Note on PASTA and Anti-PASTA for Continuous-Time Markov Chains , 1990, Oper. Res..

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

[7]  Eric Maisel,et al.  Using vanishing points for camera calibration and coarse 3D reconstruction from a single image , 2000, The Visual Computer.

[8]  Matthias Trapp,et al.  An immersive visualization system for virtual 3D city models , 2012, 2012 20th International Conference on Geoinformatics.

[9]  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..

[10]  Farnoush Banaei Kashani,et al.  GeoSIM: A Geospatial Data Collection System for Participatory Urban Texture Documentation , 2010, IEEE Data Eng. Bull..

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

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

[13]  William Stallings,et al.  Wireless Communications and Networks , 2001, 2020 International Conference on Smart Systems and Technologies (SST).

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

[15]  F. Tsai,et al.  Polygon‐based texture mapping for cyber city 3D building models , 2007, Int. J. Geogr. Inf. Sci..

[16]  Farnoush Banaei Kashani,et al.  Efficient viewpoint assignment for urban texture documentation , 2009, GIS.

[17]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

[18]  David G. Kirkpatrick,et al.  Right-Triangulated Irregular Networks , 2001, Algorithmica.

[19]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[20]  Jean Ponce,et al.  Computer Vision: A Modern Approach , 2002 .

[21]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Andreas Krause,et al.  Simultaneous placement and scheduling of sensors , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[23]  Ronald G. Driggers,et al.  Surveillance and Reconnaissance Imaging Systems: Modeling and Performance Prediction , 2001 .

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

[25]  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.

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

[27]  M. R. Spiegel Mathematical handbook of formulas and tables , 1968 .

[28]  Raghu Machiraju,et al.  Coverage optimization to support security monitoring , 2007, Comput. Environ. Urban Syst..

[29]  Yeh-Ching Chung,et al.  A Delaunay triangulation based method for wireless sensor network deployment , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

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

[31]  Andreas Krause,et al.  Near-optimal sensor placements in Gaussian processes , 2005, ICML.

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

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

[34]  Andreas Krause,et al.  Efficient Informative Sensing using Multiple Robots , 2014, J. Artif. Intell. Res..

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

[36]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[37]  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).

[38]  Baik Hoh,et al.  Dynamic pricing incentive for participatory sensing , 2010, Pervasive Mob. Comput..

[39]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[40]  Sreejit Chakravarty,et al.  Parallel and serial heuristics for the minimum set cover problem , 1992, The Journal of Supercomputing.

[41]  Andreas Krause,et al.  Optimizing Sensing: From Water to the Web , 2009, Computer.

[42]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[43]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[44]  D. Kirkpatrick Right Triangular Irregular Networks , 1997 .

[45]  Andreas Krause,et al.  Nonmyopic Adaptive Informative Path Planning for Multiple Robots , 2009, IJCAI.

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