18 th August 2006 International Conference on Pattern Recognition 2006 Epipolar Geometry from Two Correspondences Michal Perďoch, Jiří Matas, Ondřej Chum.

Slides:



Advertisements
Similar presentations
A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
Advertisements

The fundamental matrix F
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.
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.
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
Scale Invariant Feature Transform
Geometric Optimization Problems in Computer Vision.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Stepan Obdrzalek Jirı Matas
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
Independent Motion Estimation Luv Kohli COMP Multiple View Geometry May 7, 2003.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Lecture 10: Robust fitting CS4670: Computer Vision Noah Snavely.
Scene planes and homographies. Homographies given the plane and vice versa.
1Jana Kosecka, CS 223b EM and RANSAC EM and RANSAC.
Computing transformations Prof. Noah Snavely CS1114
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
Structure Computation. How to compute the position of a point in 3- space given its image in two views and the camera matrices of those two views Use.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
Automatic Camera Calibration
Image Stitching Ali Farhadi CSE 455
CSE 185 Introduction to Computer Vision
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
Final Exam Review CS485/685 Computer Vision Prof. Bebis.
Multi-view geometry.
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Epipolar geometry The fundamental matrix and the tensor
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
The Correspondence Problem and “Interest Point” Detection Václav Hlaváč Center for Machine Perception Czech Technical University Prague
IMAGE MOSAICING Summer School on Document Image Processing
CS654: Digital Image Analysis Lecture 8: Stereo Imaging.
Example: line fitting. n=2 Model fitting Measure distances.
CSCE 643 Computer Vision: Structure from Motion
Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Computer Vision : CISC 4/689 Going Back a little Cameras.ppt.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
RANSAC Robust model estimation from data contaminated by outliers Ondřej Chum.
Geometric Transformations
Feature Matching. Feature Space Outlier Rejection.
COS429 Computer Vision =++ Assignment 4 Cloning Yourself.
Computer vision: models, learning and inference M Ahad Multiple Cameras
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
3D Reconstruction Using Image Sequence
776 Computer Vision Jan-Michael Frahm Spring 2012.
Robust Estimation Course web page: vision.cis.udel.edu/~cv April 23, 2003  Lecture 25.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
SIFT.
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
Approximate Models for Fast and Accurate Epipolar Geometry Estimation
Homography From Wikipedia In the field of computer vision, any
Jiří Matas and Onřej Chum Centre for Machine Perception
A special case of calibration
Object recognition Prof. Graeme Bailey
More on single-view geometry class 10
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
SIFT.
Computational Photography
Recognition and Matching based on local invariant features
Calibration and homographies
Back to equations of geometric transformations
Presentation transcript:

18 th August 2006 International Conference on Pattern Recognition 2006 Epipolar Geometry from Two Correspondences Michal Perďoch, Jiří Matas, Ondřej Chum Center for Machine Perception Czech Technical University, Prague

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague2/16 Problem formulation Problem: Wide-baseline stereo with severe viewpoint and scale change. Message of this paper: Two correspondences of Local Affine Frames suffice to estimate epipolar geometry.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague3/16 Local Affine Frame correspondences Local Affine Frames (LAFs), Matas ICPR2002: Affine-covariantly detected local coordinate systems. One matching LAF pair provides three point-to-point correspondences.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague4/16 The correspondence problem Wide-baseline stereo framework (Matas ICPR2002): 1.Detect regions. MSERs are used here. 2.Build Local Affine Frames, define Measurement Region. 3.Geometric and photometric normalisation of MRs. 4.Establish correspondences by nearest neighbour search. 5.Verify correspondences, estimate model using RANSAC.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague5/16 How to find correct model of EG in presence of outliers? RANSAC - widely used robust estimator proposed by Fishler and Bolles Hypothesise & verify search: RANSAC Algorithm

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague6/16 Average number of RANSAC samples k : Example (   = 0.01): Chum DAGM2003, has shown that the theoretical number of samples can be achieved by introducing Local Optimisation step. RANSAC Algorithm – probability of finding a better model – proportion of inliers – size of the sample Proportion of inliers m50%45%40%35%30%25%20%15% … LAFs 3 LAFs 7 points

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague7/16 LO-RANSAC Algorithm Proposed by Chum DAGM2003, used with 3LAFs and seven point-to-point correspondences. Input: set of data points T, confidence  . Output: model M * of EG with the largest support S *. Repeat Draw a random sample of minimal size m from data points. Compute model parameters M i and its support S i. If new maximum was detected (i.e., |S i | > |S j | for (j < i): Apply local optimisation. Store the best model with support S *. Until the probability of finding model better than S * falls under  0.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague8/16 Six Point EG estimator Stewénius CVPR2005 has shown that EG can be estimated from six points under following assumptions on the cameras: Unit aspect ratio, zero skew, principal point in the middle of the image. Unknown but the same focal length. We take Stewénius’ assumptions. Is it possible to estimate EG from two Local Affine Frame correspondences?

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague9/16 Planar Degeneracy Chum CVPR2005 has that planar degeneracy causes suboptimal EG estimates. Six points on a plane do not provide enough constraints for estimation of the fundamental matrix. Planar degeneracy test - take sample points and check if they lie on a plane. When a plane is detected do plane and parallax search: Local optimisation that takes into account plane found. Sample another pair not consistent with the plane and compute fundamental matrix

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague10/16 2LAF-LO-RANSAC Algorithm Input: set of data points T, confidence  , sample size m = 2. Output: model M * of EG with largest support S *. Repeat Draw a random sample of minimal size m from data points. Compute model parameters M i and its support S i. If new maximum has occurred (i.e. |S i | > |S j | for (j < i): If a degenerated sample configuration is detected: Perform plane-and-parallax search for EG, otherwise Apply local optimisation. Store the best model with support S *. Until the probability of finding model better than S * falls under  . Performed at most log(k) times.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague11/16 Experiments: Scenes Corner  = 0.26 The China Wall  = 0.28 Wash  = 0.23

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague12/16 Experiment 1: Efficiency What is the “efficiency” of six point estimator? Is the planar degeneracy test necessary? Comparison of 2LAF, 3LAF with and without planar degeneracy test and PTS7 algorithm against reference EG. Number of good EG models generated from 1000 all-inlier samples (quality is measured by number of inliers, good – at least 90%). MethodCornerChina WallWash 7PTS LAF LAF ND LAF LAF ND ND - without degeneracy test

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague13/16 Experiment 2: Performance Average number of inliers and samples measured in hundred runs of 7PTS, 3LAF, 2LAF-LO-RANSAC algorithms. Small drop (two to four percent) in average number of inliers on difficult and noisy scenes for both 3LAF and 2LAF algorithm. Note the significant speedup (measured by number of samples) of 2LAF algorithm. Method CornerChina WallWash #inl#sam#inl#sam#inl#sam 2LAF LAF PTS

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague14/16 Experiment 3: Assumptions violation The six point solver assumes equal focal length in both images. The focal length ratio on the scene Corner is 1:3 and off-plane rotation about 30 degrees. No performance drop was observed.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague15/16 Experiment 3: Assumptions violation Robustness to change of pixel aspect ratio was measured on scene China Wall (#inliers in 100 runs). Width of pixel scaled: 0.5, 1.0, 2.0 times from top to bottom.

Perďoch M., Matas J., Chum O.: Epipolar Geometry from Two Correspondences, CTU Prague16/16Conclusions Contribution Novel wide-baseline stereo algorithm using two LAF correspondences was proposed. 6 point (= 2 LAFs) EG estimator can be used in LO-RANSAC framework with the planar degeneracy test. Performance was experimentally tested and compared to 7PTS and 3LAF algorithms in wide-baseline stereo setup. Future work Detect other degenerated configurations. Compare the number of verifications instead of the number of samples. Thank you for your attention.