Computational complexity of art gallery problems
IEEE Transactions on Information Theory
A note on PASTA and anti-PASTA for continuous-time Markov chains
Operations Research
Parallel and serial heuristics for the minimum set cover problem
The Journal of Supercomputing
Computer Vision: A Modern Approach
Computer Vision: A Modern Approach
Introduction to Algorithms
Solving the Orienteering Problem Through Branch-And-Cut
INFORMS Journal on Computing
Automatic extraction of Irregular Network digital terrain models
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Right Triangular Irregular Networks
Right Triangular Irregular Networks
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Approximation Algorithms for Orienteering and Discounted-Reward TSP
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Near-optimal sensor placements in Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
On the optimal placement of multiple visual sensors
Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks
A Delaunay Triangulation based method for wireless sensor network deployment
Computer Communications
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Polygon-based texture mapping for cyber city 3D building models
International Journal of Geographical Information Science
The Euclidean Orienteering Problem Revisited
SIAM Journal on Computing
Efficient Viewpoint Selection for Urban Texture Documentation
GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks
Simultaneous placement and scheduling of sensors
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Efficient viewpoint assignment for urban texture documentation
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Nonmyopic adaptive informative path planning for multiple robots
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Dynamic pricing incentive for participatory sensing
Pervasive and Mobile Computing
Hi-index | 0.00 |
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.