giant.utilities.random_combination¶
Provides an iterator for generating unique random combinations from a population where order doesn’t matter.
This is useful for performing RANSAC (Random Sample Consensus) analysis, a method for robust fitting of models in the presence of outliers. It ensures that the same sample sets are not chosen multiple times, improving the efficiency of the RANSAC algorithm.
Classes
Iterate over number_of_combos random combinations of combo_length from population. |
