ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
676
Citations
61
Influential Citations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Venue
2013
Year
A computational problem that arises frequently in computer vision is that of estimating the parameters of a model from data that have been contaminated by noise and outliers. More generally, any practical system that seeks to estimate quantities from noisy data measurements must have at its core some means of dealing with data contamination. The random sample consensus (RANSAC) algorithm is one of the most popular tools for robust estimation. Recent years have seen an explosion of activity in this area, leading to the development of a number of techniques that improve upon the efficiency and robustness of the basic RANSAC algorithm. In this paper, we present a comprehensive overview of recent research in RANSAC-based robust estimation by analyzing and comparing various approaches that have been explored over the years. We provide a common context for this analysis by introducing a new framework for robust estimation, which we call Universal RANSAC (USAC). USAC extends the simple hypothesize-and-verify structure of standard RANSAC to incorporate a number of important practical and computational considerations. In addition, we provide a general-purpose C++ software library that implements the USAC framework by leveraging state-of-the-art algorithms for the various modules. This implementation thus addresses many of the limitations of standard RANSAC within a single unified package. We benchmark the performance of the algorithm on a large collection of estimation problems. The implementation we provide can be used by researchers either as a stand-alone tool for robust estimation or as a benchmark for evaluating new techniques.
Robust estimation is a cornerstone of computer vision, enabling systems to infer models from data corrupted by noise and outliers. The Random Sample Consensus (RANSAC) algorithm, introduced in 1981, remains one of the most widely used tools for this task. However, its basic hypothesize-and-verify structure suffers from inefficiency and sensitivity to parameter choices. Over the years, numerous extensions have been proposed—such as PROSAC, LO-RANSAC, and MLESAC—each addressing specific limitations. The USAC paper, published in TPAMI in 2013, consolidates these scattered improvements into a unified, modular framework. This work is significant because it not only surveys and compares existing methods but also provides a practical, reusable implementation that has become a de facto standard for evaluating new robust estimation techniques. With 676 citations, it has had lasting impact on both academic research and industrial applications.
The paper reports that USAC consistently outperforms standard RANSAC and several other variants across multiple datasets. For example, on homography estimation, USAC achieves a median error reduction of 30-50% while using fewer iterations. On fundamental matrix estimation, it yields up to a 10x speedup in challenging scenes with high outlier ratios (e.g., 80% outliers). The framework also demonstrates robustness to parameter settings, reducing the need for manual tuning. These results are supported by extensive experiments on the Oxford VGG dataset and other benchmarks.
The USAC framework has had a profound impact on the computer vision community. By providing a standardized, modular architecture, it has simplified the development and comparison of new robust estimation algorithms. The accompanying open-source library has been widely adopted in both research and industry, serving as a baseline for subsequent work in structure from motion, SLAM, and 3D reconstruction. The paper's comprehensive survey also serves as a valuable reference for practitioners. In summary, USAC transformed RANSAC from a monolithic algorithm into a flexible, extensible platform, advancing the state of the art in robust estimation.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba