ransac experimentation

24
RANSAC experimentation Slides by Marc van Kreveld 1

Upload: perry

Post on 24-Feb-2016

52 views

Category:

Documents


0 download

DESCRIPTION

RANSAC experimentation. Slides by Marc van Kreveld. Experimental research. Research in computer science may result in: definitions of new, useful structures or concepts new algorithms to solve problems Further knowledge on the new structure, concept or algorithm can be obtained by: - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: RANSAC experimentation

RANSAC experimentation

Slides by Marc van Kreveld

1

Page 2: RANSAC experimentation

Experimental research

• Research in computer science may result in:– definitions of new, useful structures or concepts– new algorithms to solve problems

• Further knowledge on the new structure, concept or algorithm can be obtained by:– proofs of properties, complexities, efficiency of structures,

concepts or algorithms– experiments to answer research questions where proofs

cannot be given, e.g. running times on real-World data; user studies to determine aesthetics or perceived difficulty

2

Page 3: RANSAC experimentation

3

Page 4: RANSAC experimentation

Common sense tips in experiments

• Know exactly what you are doing and why• Make sure to fix some specific research questions

at the start• Do not even think about trying to answer more

questions, or hoping to get more information, during the design phase. Concentrate on the chosen questions only

• Design your data and your experiment to answer the questions as well as reasonably possible

• Make sure your experiment can be replicated4

Page 5: RANSAC experimentation

Common sense tips in experiments

• Is your data sufficient in quality and size?• Are there enough experiments?• Are there enough different experiments to establish

relationships?• Should I report all outcomes, a summary (histogram,

mean, standard deviation, …)?• How strong can I / how weak must I phrase my

observations and conclusions?

5

Page 6: RANSAC experimentation

Visualization of results

• Table with numbers• Scatterplot• Graph• Chart• Pie diagram• Bar chart

6

Page 7: RANSAC experimentation

Visualization of results

7

Page 8: RANSAC experimentation

Visualization of results

8

Page 9: RANSAC experimentation

Visualization of results

9

Page 10: RANSAC experimentation

Visualization of results

10

Page 11: RANSAC experimentation

Visualization of results

11

Page 12: RANSAC experimentation

Visualization of results

12

Page 13: RANSAC experimentation

Visualization of results

13

Page 14: RANSAC experimentation

14

Page 15: RANSAC experimentation

RANSAC

1. Choose a threshold distance d2. For #iterations do– Choose 2 points, make line L– For each point q in P, test if q lies within distance d from L

If yes, increase the support of L by 1– If L has higher support than the highest-support line

found so far, remember L and its support

3. Return L as the line with most points near it

15

Goal: Given a set of points P, some of which lie on a line L*. Find line L*

Page 16: RANSAC experimentation

RANSAC

• For testing whether a point q supports a line L, we do not actually compute the distance from q to L

• Instead, we generate two lines at distance d from L• Then we test for each point whether it lies below the

upper and above the lower line

16

Page 17: RANSAC experimentation

RANSAC

• How large should the threshold distance d be?• How many iterations should we do to have a high

probability of finding the line with highest support?

the threshold distance is related to the measurement error (~5 cm) and the flatness of the surface

the number of iterations depends on the inlier-outlier ratio and with how much probability we want to find the best line

17

Page 18: RANSAC experimentation

RANSAC, iterations

• Suppose we want to have 95% probability, p=0.95, of finding the line

• Suppose there are k points on the line (inliers) and n points in total

• Then the probability of choosing 2 points on the line is (k/n)2

• The probability of never selecting 2 points on the line in r iterations is ( 1 – (k/n)2 )r

• The probability of finding the line in r iterations is 1 – ( 1 – (k/n)2 )r

18

Page 19: RANSAC experimentation

RANSAC, iterations

• So we want 1 – ( 1 – (k/n)2 )r > p

( 1 – (k/n)2 )r < 1 – plog ( 1 – (k/n)2 )r < log (1 – p)r log ( 1 – (k/n)2 ) < log (1 – p)

r > log (1 – p) / log ( 1 – (k/n)2 )

19

Page 20: RANSAC experimentation

RANSAC, iterations

• Examples: – if 10% of the points lie on the line and we want to find it

with 95% certainty, we need nearly 300 iterations– If 5% of the points lie on the line and we want to find it

with 95% certainty, we need nearly 1200 iterations– if 10% of the points lie on the line and we want to find it

with 90% certainty, we need nearly 230 iterations

20

Page 21: RANSAC experimentation

Practical 3: RANSAC with Noise

21

Page 22: RANSAC experimentation

Practical 3: RANSAC with Noise

• 1. Does the number of iterations required to find the best plane increase when noise is present, and how does it increase in the amount of noise?

22

Page 23: RANSAC experimentation

Practical 3: RANSAC with Noise

• 1. Does the number of iterations required to find the best plane increase when noise is present, and how does it increase in the amount of noise?

• 2. When noise is present, does the facet shape influence the number of iterations that is needed, and in what way?

23

Page 24: RANSAC experimentation

Experimental research

• http://en.wikipedia.org/wiki/Design_of_experiments• http://en.wikipedia.org/wiki/Charts

24