On the Solvability of Viewing Graphs-Reference-Cited by-同舟云学术

On the Solvability of Viewing Graphs

Published:2018 Issue: Volume: Page:335-350
ISSN:0302-9743
Container-title:Computer Vision – ECCV 2018
language:
Short-container-title:

Author:

Trager Matthew,Osserman Brian,Ponce Jean

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-01270-0_20

Reference21 articles.

1. Thompson, M., Eller, R., Radlinski, W., Speert, J. (eds.): Manual of Photogrammetry, 3rd edn. American Society of Photogrammetry, California (1966)

2. Longuet-Higgins, H.C.: A computer algorithm for reconstructing a scene from two projections. Nature 293(5828), 133 (1981)

3. Luong, Q.T., Faugeras, O.: The fundamental matrix: theory, algorithms, and stability analysis 17(1), 43–76 (1996)

4. Shashua, A.: Algebraic functions for recognition 17(8), 779–789 (1995)

5. Hartley, R.I.: Lines and points in three views and the trifocal tensor. Int. J. Comput. Vis. 22(2), 125–140 (1997)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Viewing Graph Solvability in Practice;2023 IEEE/CVF International Conference on Computer Vision (ICCV);2023-10-01

2. Compatibility of Fundamental Matrices for Complete Viewing Graphs;2023 IEEE/CVF International Conference on Computer Vision (ICCV);2023-10-01

3. A closed form solution for viewing graph construction in uncalibrated vision;2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW);2021-10

4. Viewing Graph Solvability via Cycle Consistency;2021 IEEE/CVF International Conference on Computer Vision (ICCV);2021-10