Dense versus Sparse Approaches for Estimating the Fundamental Matrix

被引:41
作者
Valgaerts, Levi [1 ]
Bruhn, Andres [1 ]
Mainberger, Markus [2 ]
Weickert, Joachim [2 ]
机构
[1] Univ Saarland, MMCI Cluster Excellence, Vis & Image Proc Grp, D-66041 Saarbrucken, Germany
[2] Univ Saarland, Fac Math & Comp Sci, Math Image Anal Grp, D-66041 Saarbrucken, Germany
关键词
Optical flow; Fundamental matrix; Performance evaluation; 3D reconstruction; OPTICAL-FLOW; MOTION; COMPUTATION; ALGORITHM; GEOMETRY; SEGMENTATION; PERFORMANCE; STEREO; CAMERA; MODEL;
D O I
10.1007/s11263-011-0466-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
There are two main strategies for solving correspondence problems in computer vision: sparse local feature based approaches and dense global energy based methods. While sparse feature based methods are often used for estimating the fundamental matrix by matching a small set of sophistically optimised interest points, dense energy based methods mark the state of the art in optical flow computation. The goal of our paper is to show that this separation into different application domains is unnecessary and can be bridged in a natural way. As a first contribution we present a new application of dense optical flow for estimating the fundamental matrix. Comparing our results with those obtained by feature based techniques we identify cases in which dense methods have advantages over sparse approaches. Motivated by these promising results we propose, as a second contribution, a new variational model that recovers the fundamental matrix and the optical flow simultaneously as the minimisers of a single energy functional. In experiments we show that our coupled approach is able to further improve the estimates of both the fundamental matrix and the optical flow. Our results prove that dense variational methods can be a serious alternative even in classical application domains of sparse feature based approaches.
引用
收藏
页码:212 / 234
页数:23
相关论文
共 93 条
[61]   A taxonomy and evaluation of dense two-frame stereo correspondence algorithms [J].
Scharstein, D ;
Szeliski, R .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2002, 47 (1-3) :7-42
[62]  
Schlesinger D, 2004, LECT NOTES COMPUT SC, V3175, P440
[63]  
Schnorr C., 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition (Cat. No.94CH3440-5), P661, DOI 10.1109/ICPR.1994.576391
[64]  
Seitz SM, 2006, 2006 IEEE COMPUTER S, P519, DOI 10.1109/CVPR.2006.19
[65]  
Sheikh Y., 2007, P 2007 IEEE COMP SOC
[66]  
SHI JB, 1994, 1994 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, P593, DOI 10.1109/CVPR.1994.323794
[67]  
Slesareva N, 2005, LECT NOTES COMPUT SC, V3663, P33
[68]  
Steinbrucker F., 2009, P 12 INT C COMP VIS
[69]  
Steinbrucker F., 2009, VMV, P155
[70]   Robust parameter estimation in computer vision [J].
Stewart, CV .
SIAM REVIEW, 1999, 41 (03) :513-537