Crates.io | arrsac |
lib.rs | arrsac |
version | 0.10.0 |
source | src |
created_at | 2019-11-02 23:58:39.929028 |
updated_at | 2022-01-02 23:57:09.287427 |
description | From the paper "A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus" |
homepage | |
repository | https://github.com/rust-cv/arrsac |
max_upload_size | |
id | 177638 |
size | 30,305 |
Implements the ARRSAC algorithm from the paper "A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus"; the paper "Randomized RANSAC with Sequential Probability Ratio Test" is also used to implement the SPRT for RANSAC.
Some things were modified from the original papers which improve corner cases or convenience in regular usage.
This can be used as a Consensus
algorithm with the sample-consensus
crate.
ARRSAC can replace RANSAC and is almost always a faster solution, given that you are willing to tune the parameters.