Version 2.4
In this release:
Improved RANSAC algorithm
- The new
ransac
will exhaust all possibilities in a pseudo-random way. The exploration is done on a single (fixed) realization of all possible matches and it will exhaust the list of candidate matches before failing. ransac
now iterates 3 times searching for the maximum number of matches before returning. This ensures (almost certainly in a statistical sense) that the results will be the same between calls.- The new
ransac
is virtually deterministic, despite its stochastic search nature.