RANSAC algorithm parameter setting
RANSAC algorithm has been widely used in the engineering field such as computer vision. However, if I understand well, there are two parameters to set when using this algorithm: one is related to the number of iteration and the other is connected with the threshold for the estimation model. Take the linear line estimation problem as an example:
The blue points in the picture represent inliers while the red points stand for outliers.
The number of iteration shows how many times we should try before we can find the right line model. The more we try the more possible we can obtain the right model. However, the consumption time will increase as well. Moreover, the number of iteration is also related the percentage of outliers in the data set. The less outliers exist the less iteration we can expect.
The threshold for the model depends on the problem at hand. If it is set too strict the data that could fit the model will become useless, hence leading to an inaccurate estimation. Moreover, strict model threshold can also lead to wrong model. If it is set too loose, outliers can come and play a role.
For the time being, my solution to the setting of these two parameters is as follows: 1) Number of iteration: at the beginning the percentage of outliers are roughly estimated, and if the percentage is high, more iterations are needed; otherwise, the number of iteration is set relatively low. 2) Model threshold: a relatively large threshold hold is set at the beginning, and after that the inliers are given a weighting based on their proximity to the model. If outliers happen to become inliers, they will not affect the model estimation dramatically. I was wondering whether other solutions exist for RANSAC parameter setting. Thanks!
- How to name algorithm in c++ for process items in collection which can add or remove items?
- Add or Sum of hours like 13:30+00:00:20=13:30:20 but how?
- Generate words that fit in Guids (just for fun)
- Efficient calculation of Fibonacci series
- What is the best algorithm for overriding GetHashCode?
- Picking a random element from a set
- How to generate combinations in chunks
- How do I check if an array includes a value in JavaScript?
- Why is O(n) better than O( nlog(n) )?
- Geometric series: calculate quotient and number of elements from sum and first & last element
- Algorithm to find all the exact divisors of a given integer
- Fastest way to generate binomial coefficients
- Enumerate all full (labeled) binary tree
- What's the best way to write `indexBy` in Scala?
- In Dijkstra's algorithm why must it first expand nodes with the current least cost?
- Distance between every Vertices in Graph
- Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
- Is there any easy way to do modulus of 2³² - 1 operation?
- Difference between Big-O and Little-O Notation
- Solving a simultaneous equation through code
- Number of paths using k coins
- Infix to postfix algorithm that takes care of unary operators
- What would cause an algorithm to have O(log log n) complexity?
- Algorithm to create a singly linked list
- Why does cache use Most Recently Used (MRU) algorithm as evict policy?
- How to check if a number is a power of 2
- How to define a normal Markov algorithm (NMA) to swap two ternary numbers separated by the symbol "^"?
- Enumerating all paths in a directed acyclic graph
- Segmented Sieve of Eratosthenes?
- what is the output of this simple recursive function? can you explain in detail?