Content deleted Content added
→Parameters: Working in clarifying the rationale of estimating k as the number of iterations. |
→Parameters: Clarified terms. |
||
Line 177:
== Parameters ==
The threshold value to determine when a data point fits a model ({{mvar|t}}), and the number of
Let {{mvar|p}} be the desired probability that the RANSAC algorithm provides at least one useful result after running. In extreme, RANSAC returns a successful result if in some iteration it selects only inliers from the input data set when it chooses {{mvar|n}} points from the data set from which the model parameters are estimated (i.e., all the selected {{mvar|n}} data points as inliers of the model estimated by these points). Let <math>w</math> be the probability of choosing an inlier each time a single data point is selected, that is roughly,
|