Dualizing Scene Reconstruction Algorithms

It has been known since the work of Carlsson [2] and Weinshall [17] 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.

[1]  Roberto Cipolla,et al.  Computer Vision — ECCV '96 , 1996, Lecture Notes in Computer Science.

[2]  Stefan Carlsson,et al.  Duality of reconstruction and positioning from projective views , 1995, Proceedings IEEE Workshop on Representation of Visual Scenes (In Conjunction with ICCV'95).

[3]  Bill Triggs,et al.  Factorization methods for projective structure and motion , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  Anders Heyden,et al.  Reconstruction from image sequences by means of relative depths , 1995, Proceedings of IEEE International Conference on Computer Vision.

[5]  Long Quan,et al.  Invariants of 6 Points from 3 Uncalibrated Images , 1994, ECCV.

[6]  Bernd Neumann,et al.  Computer Vision — ECCV’98 , 1998, Lecture Notes in Computer Science.

[7]  Jan-Olof Eklundh,et al.  Computer Vision — ECCV '94 , 1994, Lecture Notes in Computer Science.

[8]  S. Maybank The projective geometry of ambiguous surfaces , 1990, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

[9]  Thomas Buchanan The twisted cubic and camera calibration , 1988, Comput. Vis. Graph. Image Process..

[10]  Richard I. Hartley,et al.  In Defense of the Eight-Point Algorithm , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Peter F. Sturm,et al.  A Factorization Based Algorithm for Multi-Image Projective Structure and Motion , 1996, ECCV.

[12]  Bill Triggs,et al.  Autocalibration and the absolute quadric , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  Richard I. Hartley,et al.  Computation of the Quadrifocal Tensor , 1998, ECCV.

[14]  Rachid Deriche,et al.  A Robust Technique for Matching two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry , 1995, Artif. Intell..

[15]  Anders Heyden,et al.  Euclidean reconstruction from image sequences with varying and unknown focal length and principal point , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[16]  J. G. Semple,et al.  Algebraic Projective Geometry , 1953 .

[17]  Reinhard Koch,et al.  Self-calibration and metric reconstruction in spite of varying and unknown internal camera parameters , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[18]  Amnon Shashua,et al.  Ambiguity in reconstruction from images of six points , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).