Abstract
We envision participatory texture documentation (PTD) as a process in which a group of participants (dedicated individuals and/or general public) with camera-equipped mobile phones participate in collaborative/social collection of the urban texture information. PTD enables inexpensive, scalable and high resolution urban texture documentation. PTD is implemented in two steps. In the first step, minimum number of points in the urban environment are selected from which collection of maximum urban texture is possible. This step is called viewpoint selection. In the next step, the selected viewpoints are assigned to users (based on their preferences and constraints) for texture collection. This step is termed viewpoint assignment. In this paper, we focus on the viewpoint selection problem. We prove that this problem is NP-hard, and accordingly, propose a scalable (and efficient) heuristic with approximation guarantee for viewpoint selection. We study, profile and verify our proposed solution by extensive experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chakravarty, S., Shekhawat, A.: Parallel and serial heuristics for the minimum set cover problem. J. Supercomput. 5(4), 331–345 (1992)
Fowler, R.J., Little, J.J.: Automatic extraction of irregular network digital terrain models. In: SIGGRAPH 1979, pp. 199–207. ACM, New York (1979)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill Science/Engineering/Math (2001)
Chen, G.H., Yu, M.S., Liu, L.T.: Two algorithms for constructing a binary tree from its traversals. Inf. Process. Lett. 28(6), 297–299 (1988)
Tsai, F., Lin, H.C.: Polygon-based texture mapping for cyber city 3D building models. Int. J. Geogr. Inf. Sci. 21(9), 965–981 (2007)
Guillou, E., Meneveaux, D., Maisel, E., Bouatouch, K.: Using vanishing points for camera calibration and coarse 3D reconstruction from a single image. The Visual Computer 16(7), 396–410 (2000)
Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: WSNA 2003 (2003)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM, pp. 1380–1387 (2001)
Wu, C.H., Lee, K.C., Chung, Y.C.: A delaunay triangulation based method for wireless sensor network deployment. Comput. Commun. 30(14-15), 2744–2752 (2007)
Dhillon, S.S., Chakrabarty, K.: Sensor placement for effective coverage and surveillance in distributed sensor networks 3, 1609–1614 (2003)
Guestrin, C., Krause, A., Singh, A.P.: Near-optimal sensor placements in gaussian processes. In: ICML 2005 (2005)
Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theor. 32(2), 276–282 (1986)
Hörster, E., Lienhart, R.: On the optimal placement of multiple visual sensors. In: VSSN 2006 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shirani-Mehr, H., Banaei-Kashani, F., Shahabi, C. (2009). Efficient Viewpoint Selection for Urban Texture Documentation. In: Trigoni, N., Markham, A., Nawaz, S. (eds) GeoSensor Networks. GSN 2009. Lecture Notes in Computer Science, vol 5659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02903-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-02903-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02902-8
Online ISBN: 978-3-642-02903-5
eBook Packages: Computer ScienceComputer Science (R0)