Dualizing Scene Reconstruction Algorithms
It has been known since the work of Carlsson  and Weinshall  that there is a dualization principle that allows one to interchange the role of points being viewed by several cameras and the camera centres themselves. In principle this implies the possibility of dualizing projective reconstruction algorithms to obtain new algorithms. In this paper, this theme is developed at a theoretical and algorithmic level. The nature of the duality mapping is explored and its application to reconstruction ambiguity is discussed. An explicit method for dualizing any projective reconstruction algorithm is given. At the practical implementation level, however, it is shown that there are difficulties which have so far defeated successful application of this dualization method to produce working algorithms.
Unable to display preview. Download preview PDF.
- Stefan Carlsson. Duality of reconstruction and positioning from projective views. In Workshop on Representations of Visual Scenes, 1995.Google Scholar
- Richard I. Hartley. Lines and points in three views and the trifocal tensor. International Journal of Computer Vision, 22(2):125–140, March 1997.Google Scholar
- Anders Heyden. Reconstruction from image sequences by means of relative depth. In Proc. International Conference on Computer Vision, pages 1058–1063, 1995.Google Scholar
- Anders Heyden and Kalle Åström. Euclidean reconstruction from image sequences with varying and unknown focal length and principal point. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, pages 438–443, 1997.Google Scholar
- Marc Pollefeys, Reinhard Koch, and Luc Van Gool. Self-calibration and metric reconstruction in spite of varying and unknown internal camera parameters. In Proc. International Conference on Computer Vision, pages 90–95, 1998.Google Scholar
- S.J. Maybank and A. Shashua. Ambiguity in reconstruction from images of six points. In Proc. International Conference on Computer Vision, pages 703–708, 1998.Google Scholar
- Peter Sturm and Bill Triggs. A factorization based algorithm for multi-image projective structure and motion. In Computer Vision-ECCV’ 96, Volume II, LNCS-Series Vol. 1065, Springer-Verlag, pages 709–720, 1996.Google Scholar
- P.H.S. Torr and D.W. Murray. A review of robust methods to estimate the fundamental matrix. IJCV-to appear.Google Scholar
- B. Triggs. Factorization methods for projective structure and motion. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, pages 845–851, 1996.Google Scholar
- Bill Triggs. Autocalibration and the absolute quadric. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, pages 609–614, 1997.Google Scholar
- D. Weinshall, M. Werman, and A. Shashua. Shape descriptors: Bilinear, trilinear and quadrilinear relations for multi-point geometry and linear projective reconstruction algorithms. In Workshop on Representations of Visual Scenes, 1995.Google Scholar
- Z. Zhang, R. Deriche, O. Faugeras, and Q.-T. Luong. A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry. Artificial Intelligence Journal, 78:87–119, October 1995.Google Scholar