Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Optimal randomized RANSAC.

Ondrej Chum1, Jirí Matas

  • 1Czech Technical University, Faculty of Electrical Engineering, Department of Cybernetics, Karlovo námestí, Prague, Czech Republic. chum@cmp.felk.cvut.cz

IEEE Transactions on Pattern Analysis and Machine Intelligence
|June 21, 2008
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

PixOOD: Pixel-Level Out-of-Distribution Detection.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Cascaded and Generalizable Neural Radiance Fields for Fast View Synthesis.

IEEE transactions on pattern analysis and machine intelligence·2023
Same author

Plant recognition by AI: Deep neural nets, transformers, and kNN in deep embeddings.

Frontiers in plant science·2022
Same author

Visual Object Tracking With Discriminative Filters and Siamese Networks: A Survey and Outlook.

IEEE transactions on pattern analysis and machine intelligence·2022
Same author

Binaural SoundNet: Predicting Semantics, Depth and Motion With Binaural Sounds.

IEEE transactions on pattern analysis and machine intelligence·2022
Same author

Automatic Fungi Recognition: Deep Learning Meets Mycology.

Sensors (Basel, Switzerland)·2022
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This study introduces a faster RANSAC algorithm for model verification. The new method, R-RANSAC with SPRT, significantly speeds up outlier detection and model fitting, outperforming existing techniques.

Area of Science:

  • Computer Vision
  • Machine Learning
  • Statistical Modeling

Background:

  • Robust model fitting methods like RANSAC are crucial for handling noisy data with outliers.
  • Existing RANSAC algorithms can be computationally intensive, especially with high outlier ratios.
  • Deterministic verification strategies may not achieve optimal speed or accuracy.

Purpose of the Study:

  • To develop a randomized model verification strategy for RANSAC that is provably faster and optimal.
  • To design an algorithm that does not require prior knowledge of outlier fraction.
  • To improve the efficiency and performance of RANSAC for robust model estimation.

Main Methods:

  • A randomized model verification strategy based on Wald's sequential probability ratio test (SPRT).

Related Experiment Videos

  • Development of the R-RANSAC with SPRT algorithm for online estimation of outlier fraction.
  • Theoretical derivation of optimality based on sequential decision making theory.

    • Main Results:

    • The proposed R-RANSAC with SPRT achieves near-theoretically optimal performance.
    • Experimental results show it is 2-10 times faster than standard RANSAC.
    • The method is up to 4 times faster than other advanced RANSAC variants.

    Conclusions:

    • R-RANSAC with SPRT offers a provably faster and more efficient approach to robust model fitting.
    • The algorithm's ability to estimate outlier fractions online enhances its practical applicability.
    • This method represents a significant advancement in randomized RANSAC algorithms.