Approximate Models for Fast and Accurate Epipolar Geometry Estimation

Slides:



Advertisements
Similar presentations
The fundamental matrix F
Advertisements

Lecture 11: Two-view geometry
1. 2 An extreme occurrence of the missing data W I D E B A S E L I N E – no point in more than 2 images!
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Computer vision: models, learning and inference
Low Complexity Keypoint Recognition and Pose Estimation Vincent Lepetit.
Chapter 6 Feature-based alignment Advanced Computer Vision.
Lecture 8: Stereo.
Image alignment Image from
Multiple View Geometry
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
MSU CSE 240 Fall 2003 Stockman CV: 3D to 2D mathematics Perspective transformation; camera calibration; stereo computation; and more.
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Srikumar Ramalingam Department of Computer Science University of California, Santa Cruz 3D Reconstruction from a Pair of Images.
Lecture 21: Multiple-view geometry and structure from motion
Automatic Panoramic Image Stitching using Local Features Matthew Brown and David Lowe, University of British Columbia.
Lecture 11: Structure from motion CS6670: Computer Vision Noah Snavely.
Triangulation and Multi-View Geometry Class 9 Read notes Section 3.3, , 5.1 (if interested, read Triggs’s paper on MVG using tensor notation, see.
CS664 Lecture #19: Layers, RANSAC, panoramas, epipolar geometry Some material taken from:  David Lowe, UBC  Jiri Matas, CMP Prague
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Multiple View Reconstruction Class 23 Multiple View Geometry Comp Marc Pollefeys.
CSCE 641 Computer Graphics: Image-based Modeling (Cont.) Jinxiang Chai.
Camera Calibration CS485/685 Computer Vision Prof. Bebis.
Global Alignment and Structure from Motion Computer Vision CSE455, Winter 2008 Noah Snavely.
CSCE 641 Computer Graphics: Image-based Modeling (Cont.) Jinxiang Chai.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Robust fitting Prof. Noah Snavely CS1114
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Automatic Camera Calibration
CSE 185 Introduction to Computer Vision
Final Exam Review CS485/685 Computer Vision Prof. Bebis.
Multi-view geometry.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
CS654: Digital Image Analysis Lecture 8: Stereo Imaging.
CSCE 643 Computer Vision: Structure from Motion
Visibility map (high low) Surveillance with Visual Tagging and Camera Placement J. Zhao and S.-C. Cheung — Center for Visualization and Virtual Environment,
Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University in Prague A Minimal Solution for.
Ray Divergence-Based Bundle Adjustment Conditioning for Multi-View Stereo Mauricio Hess-Flores 1, Daniel Knoblauch 2, Mark A. Duchaineau 3, Kenneth I.
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
18 th August 2006 International Conference on Pattern Recognition 2006 Epipolar Geometry from Two Correspondences Michal Perďoch, Jiří Matas, Ondřej Chum.
Ch. 3: Geometric Camera Calibration
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Geometric Transformations
Feature Matching. Feature Space Outlier Rejection.
Computer Vision - Fitting and Alignment (Slides borrowed from various presentations)
Calibration.
3D reconstruction from uncalibrated images
3D Reconstruction Using Image Sequence
776 Computer Vision Jan-Michael Frahm Spring 2012.
Center for Machine Perception Department of Cybernetics Faculty of Electrical Engineering Czech Technical University in Prague Segmentation Based Multi-View.
776 Computer Vision Jan-Michael Frahm Spring 2012.
25 Years of RANSAC 25 Years of RANSAC Ondřej Chum
SIFT Scale-Invariant Feature Transform David Lowe
René Vidal and Xiaodong Fan Center for Imaging Science
Epipolar geometry.
Jiří Matas and Onřej Chum Centre for Machine Perception
3D Photography: Epipolar geometry
Structure from motion Input: Output: (Tomasi and Kanade)
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
Uncalibrated Geometry & Stratification
Reconstruction.
Noah Snavely.
SIFT.
Computational Photography
Presented by Xu Miao April 20, 2005
Calibration and homographies
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

Approximate Models for Fast and Accurate Epipolar Geometry Estimation James Pritts Ondrej Chum and Jiri Matas Center for Machine Perception (CMP) Czech Technical University in Prague Faculty of Electrical Engineering Department of Cybernetics

Introduction RANSAC commonly used for robust epipolar geometry estimation very effective Runtime is given by proportion of measurements that are good in the data The sample size needed to hypothesize a model Approximate models requires smaller sample size But give worse estimates of epipolar geometry Epipolar geometry estimation by hypothesizing approximate models fit from 2 region-to-region correspondences Contributions We propose 2 new 2 region-to-region methods for estimating epipolar geometry Experimentally compare to previous approaches

Fitting a Line Least squares fit

RANSAC Sample s points

RANSAC Sample s points Fit model to sample

RANSAC Select sample of m points at random Fit model to sample Calculate error for each measurement

RANSAC Select sample of m points at random Fit model to sample Calculate error for each measurement Find consensus set

RANSAC Select sample of m points at random Fit model to sample Calculate error for each measurement Find consensus set Repeat sampling Hypothesize Verify

RANSAC Select sample of m points at random Fit model to sample Calculate error for each measurement Find consensus set Repeat sampling

RANSAC Select sample of m points at random Fit model to sample Calculate error for each measurement Find consensus set Repeat sampling

RANSAC Large sample size means more samples required! Terminates when finding a better solution is improbable. Large sample size means more samples required!

How bad is it? I / N [%] Size of the sample m Reduce sample size for fundamental matrix estimation by hypothesizing approximate models I / N [%] Size of the sample m Difficult wide baseline stereo matching problems at 95% confidence

Classic RANSAC for F estimation PROBLEM Measurements are noisy Hypotheses from small samples are only approximate Classic RANSAC does not really work for complex models Low accuracy, low precision Need Locally Optimized RANSAC

Generalized Model Optimization Approximate hypothesis: We propose 2 reduced parameter models to estimate the Fundamental Matrix from 2 regions Model Optimization: Local optimization step estimates the Fundamental Matrix from the consensus set of the approximate hypothesis O. Chum, J. Matas, and J. Kittler. Locally optimized RANSAC. In DAGM Symposium, 2003.

Feature-to-feature correspondences Affine covariant features detected in images independently Correspondences established based on SIFT descriptors x’3 x3 DG x2 DG x1 x’1 x’2 image 1 image 2 Centers of the region regions provide point-to-point correspondences (x1, x’1) (7 correspondences needed to estimate F) Dominant orientation (gradient) provides additional point-to-point correspondence (x2, x’2) Full affine coordinate frame is given by an ellipse and dominant orientation (x3, x’3) Region-to-region correspondence of affine covariant features provides three point-to-point correspondences: independent but ill-conditioned

Prior methods I: BEEM Constructs artificial points by locally approximating the image-to-image mapping to generate 8 linear constraints to estimate epipolar geometry 2 oriented ellipses, e.g. gotten by SIFT dominant gradient (DG) DG Artificial point L. Goshen and I. Shimshoni. Balanced exploration and exploitation model search for efficient epipolar geometry estimation. Pattern Analysis and Machine Intelligence, 30(7):1230–1242, 2008.

Prior Methods II: Perdoch et al. RANSAC hypothesis is Essential matrix and focal length by 6-point algorithm Estimation requires solving a system of polynomial equations 6 points gotten from oriented ellipse Introduce constraints on intrinsic camera parameters: fixed focal length, square pixels and centered principal point DG Local Affine Frame (LAF) M. Perdoch, J. Matas, and O. Chum. Epipolar geometry from two correspondences. In Proc. of ICPR, pages 215–220, 2006.

Affine epipolar constraint Measured points are used to estimate an approximation of the global model The first order approximation of can be written , where Geometric meaning: affine cameras Weak perspective geometry

MLE RANSAC hypothesis is the affine fundamental matrix Point-point constraints used for estimation Use extents and origin of 2 Local Affine Frames (LAFs) to get 4-6 points Optional point DG DG DG Local Affine Frame (LAF)

Arendelovic RANSAC hypothesis is the affine fundamental matrix Ellipses directly used for estimation Introduces polynomial constraints on , results in quartic (0-4) solutions Arbitrary unknown rotation Arandjelovic, Zisserman: Efficient Image Retrieval for 3D Structures , BMVC 2010 Affine epipolar geometry estimated from two elliptical correspondences 0-4 hypotheses

Summary of Hypothesis Generators Proposed approximate models Prior approximate models

KUSVOD2 dataset 16 challenging wide-baseline stereo pairs with varied geometry Hand annotated ground truth point correspondences Reprojection error is used to evaluate accuracy of Fundamental matrix Epipolar geometry estimated 500x for each pair K. Lebeda, J. Matas, and O. Chum. Fixing the locally optimized RANSAC. In Proc. of BMVC .

CDF reprojection error Empirical CDF of the RMS Sampson error for 8000 F estimations. Error calculated on hand-annotated point correspondences for each stereo pair in the test set.

Speedup 20% more than 25x speed up 50% more than 10x speed up Empirical CDF of the sample ratio, calculated as the ratio of the number of RANSAC samples required by the 7-point method to the denoted approximate model. Again for 8000 F estimations

Conclusions Two two-region methods are proposed that reliably estimate F on a large class of stereo pairs Most significant reduction in samples drawn and models evaluated can be achieved with the use of MLE. Using the first order approximation to the global model improves accuracy and precision of epipolar geometry estimation compared to using local image approximations or constraining intrinsic camera calibration Hypothesizing the affine fundamental matrix from 2 Local Affine Frames (LAFs) should be preferred to the previously proposed methods BEEM and Perdoch et al..

Additional material Comes after this slide…

Affine epipolar constraint Seek an approximation to the global model that uses only reliable constraints from local measurements. First order approximation of about : Where is the 1x4 Jacobian of The approximation can be written , where Weak perspective geometry