Efficient Viewpoint Selection for Urban Texture Documentation

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.

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

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

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

[4]  Gen-Huey Chen,et al.  Two Algorithms for Constructing a Binary Tree from its Traversals , 1988, Inf. Process. Lett..

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

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

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

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

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

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

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

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

[13]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

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

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