Improving RANSAC for Fast Landmark Recognition
Abstract
We introduce a procedure for recognizing and locating planar landmarks for mobile robot navigation, based in the detection and recognition of a set of interest points. We use RANSAC for fitting a homography and locating the landmark. Our main contribution is the introduction of a geometrical constraint that reduces the number of RANSAC iterations by discarding minimal subsets. In the experiments conducted we conclude that this constraint increases RANSAC performance by reducing in about 35% and 75% the number of iterations for affine and projective cameras, respectively.
Cite
Text
Márquez-Neila et al. "Improving RANSAC for Fast Landmark Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2008. doi:10.1109/CVPRW.2008.4563138Markdown
[Márquez-Neila et al. "Improving RANSAC for Fast Landmark Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2008.](https://mlanthology.org/cvprw/2008/marquezneila2008cvprw-improving/) doi:10.1109/CVPRW.2008.4563138BibTeX
@inproceedings{marquezneila2008cvprw-improving,
title = {{Improving RANSAC for Fast Landmark Recognition}},
author = {Márquez-Neila, Pablo and Miro, Jacobo Garcia and Buenaposada, José Miguel and Baumela, Luis},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops},
year = {2008},
pages = {1-8},
doi = {10.1109/CVPRW.2008.4563138},
url = {https://mlanthology.org/cvprw/2008/marquezneila2008cvprw-improving/}
}