Finding the location where a picture was taken is an important problem for a variety of applications including surveying, interactive traveling and homeland security among others. The task becomes intractable though when the area under investigation reaches city/town size. The amount of data (pictures/videos) required to visually map a city, comprehensively, can be exhaustive for most search algorithms. In this paper we propose a novel method to effectively tackle this problem. The area is visually mapped as route panoramas that provide a compact yet comprehensive representation of the buildings and landmarks in the area. Given a query image taken at an arbitrary location in the area, we show that we can accurately recover the location of the camera by finding it's epipole in the route panorama of the scene. To this end we show that there exists a fundamental matrix between a route panorama and a perspective image of the same scene. The fundamental matrix is calculated using feature matches as correspondences between the query image and the route panorama
[1]
H. C. Longuet-Higgins,et al.
A computer algorithm for reconstructing a scene from two projections
,
1981,
Nature.
[2]
Toru Ishida,et al.
Digital city Kyoto
,
2002,
CACM.
[3]
Jiang Yu Zheng.
Digital Route Panoramas
,
2003,
IEEE Multim..
[4]
Olivier D. Faugeras,et al.
On the geometry and algebra of the point and line correspondences between N images
,
1995,
Proceedings of IEEE International Conference on Computer Vision.
[5]
Allen R. Hanson,et al.
Parallel-Perspective Stereo Mosaics
,
2001,
ICCV.
[6]
G LoweDavid,et al.
Distinctive Image Features from Scale-Invariant Keypoints
,
2004
.
[7]
Rajiv Gupta,et al.
Linear Pushbroom Cameras
,
1994,
ECCV.
[8]
Toru Ishida.
Digital City Kyoto: Social Information Infrastructure for Everyday Life
,
2000
.