RANSAC - PowerPoint PPT Presentation

1 / 37
About This Presentation
Title:

RANSAC

Description:

Minimal or sub-minimal hypothesis generation (both, although sub-minimal for classical Hough) ... hypotheses to hypotheses (Hough), or hypotheses to data ... – PowerPoint PPT presentation

Number of Views:109
Avg rating:3.0/5.0
Slides: 38
Provided by: cmpFel
Category:
Tags: ransac | hough

less

Transcript and Presenter's Notes

Title: RANSAC


1
RANSAC
David Nistér
2
Outline
  • Fruits of RANSAC (camera tracking)
  • Hypothesis Generation (minimal cases)
  • Preemptive RANSAC
  • Millisecond RANSAC
  • Hough vs RANSAC, RUDR
  • RANSAC as an extended search technique

3
Fruits of RANSAC
4
Visual Odometrywork with Oleg Naroditsky and Jim
Bergen
  • 365 m without loss of tracking
  • 350 m ( 3.5 minutes) without GPS
  • Error in distance traveled 1
  • Accumulated error in position 3-5
  • e.g. 10m over 350m

North
East
5
Visual Odometrywork with Oleg Naroditsky and Jim
Bergen
6
Visual Odometrywork with Oleg Naroditsky and Jim
Bergen
7
RANSAC as Object-Oriented Programming
8
Estimate or posterior likelihood output
Hypothesis Generator
Probabilistic Formulation
Precise Formulation
Data Input
9
(No Transcript)
10
Geometry Tools
11
Hypothesis Generation
The 5-Point Relative Pose Problem
Unknown Focal Relative Pose
10
15
2048
The Generalized 3-Point Problem
Microphone-Speaker Relative Orientation
8(4)
The 3 View 4-Point Problem
0 (or thousands)
8-38-150-344-??
12
Relative Orientation
13
2 Views
3 Views
6p Quan, 1994
8p von Sanden, 1908 Longuet-Higgins, 1981
4p Nister, Schaffalitzky, 2004
7p R. Sturm, 1869
5p Nister, 2003
6p Philip, 1996
5p Kruppa 1913 Nister 2003
14
The Five Point Problem
Given five point correspondences,
What is R,t ?
E. Kruppa, Zur Ermittlung eines Objektes aus zwei
Perspektiven mit Innerer Orientierung, 1913.
15
The 5-point algorithm (Nistér CVPR 03)
E
R,t
16
The 5-point algorithm (Nistér PAMI 04)
R,t
E
17
The 5-point algorithm (Stewénius et al)
10 x 10 Action Matrix
Eigen-Decomposition
R,t
E
18
The Generalized 3-Point Problem
19
The Generalized 3-Point Problem
20
The 3-View 4-Point Problem, Nister,
Schaffalitzky, 2004
21
The 3-View 4-Point Problem, Nister,
Schaffalitzky, 2004
22
Line Hypotheses
Points
23
RANSAC
?
Hypotheses
500
Observations
1000
500 x 1000 500.000
24
Preemptive RANSAC
Depth-first Preemption
Hypotheses
500
Observations
1000
500 x ???? ???????
25
Preemptive RANSAC
Breadth-first Preemption
Hypotheses
500
Chunksize
100
Observations
1000
500 x 200 100.000
Overhead 100 microseconds
26
Preemptive RANSAC
Observed Tracks
27
Preemptive RANSAC
28
Preemptive RANSAC
29
ms RANSAC (for Recognition)
  • Rotation
  • Viewpoint Change
  • Lighting Variation
  • Scale Change

30
(No Transcript)
31
(Generalized) Hough vs RANSAC
  • Minimal or sub-minimal hypothesis generation
    (both, although sub-minimal for classical Hough)

Sub-Minimal
Minimal
32
(Generalized) Hough vs RANSAC
  • Comparing hypotheses to hypotheses (Hough), or
    hypotheses to data (RANSAC)

Hypotheses to Hypotheses
Hypotheses to Data
Fit?
?
33
RUDR (Olson, 1998)
  • Hypothesis generation is sub-minimal by one,
    followed by all possible final points
  • Scoring is hypothesis-hypothesis

34
Comment on the Standard Stopping Criterion
Remember that it works only with
  • Strong geometry and
  • No degeneracies

35
Uncertainty in Epipolar Geometry work with Chris
Engels
Single Estimate often ill posed
Representation of posterior likelihood well
posed, but computationally challenging
36
Uncertainty in Epipolar Geometry work with Chris
Engels
Single Estimate often ill posed
Representation of posterior likelihood well
posed, but computationally challenging
37
Epipoloscope
Calibrated
Uncalibrated
Write a Comment
User Comments (0)
About PowerShow.com