Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Deep Fundamental Matrix Estimation without Correspondences (1810.01575v1)

Published 3 Oct 2018 in cs.CV, cs.CG, cs.GR, cs.LG, and stat.ML

Abstract: Estimating fundamental matrices is a classic problem in computer vision. Traditional methods rely heavily on the correctness of estimated key-point correspondences, which can be noisy and unreliable. As a result, it is difficult for these methods to handle image pairs with large occlusion or significantly different camera poses. In this paper, we propose novel neural network architectures to estimate fundamental matrices in an end-to-end manner without relying on point correspondences. New modules and layers are introduced in order to preserve mathematical properties of the fundamental matrix as a homogeneous rank-2 matrix with seven degrees of freedom. We analyze performance of the proposed models using various metrics on the KITTI dataset, and show that they achieve competitive performance with traditional methods without the need for extracting correspondences.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Omid Poursaeed (19 papers)
  2. Guandao Yang (29 papers)
  3. Aditya Prakash (24 papers)
  4. Qiuren Fang (1 paper)
  5. Hanqing Jiang (8 papers)
  6. Bharath Hariharan (82 papers)
  7. Serge Belongie (125 papers)
Citations (37)

Summary

We haven't generated a summary for this paper yet.