A new robust operator for computer vision: theoretical analysis
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
MINPRAN, a new robust operator, finds good fits in data sets where more than 50% of the points are outliers. Unlike other techniques that handle large outlier percentages, MINPRAN does not rely on a known error bound for the good data. Instead it assumes that the bad data are randomly (uniformly) distributed within the dynamic range of the sensor. Based on this, MINPRAN uses random sampling to search for the fit and the number of inliers to the fit that are least likely to have occurred randomly. It runs in time O(N/sup 2/+SNlogN), where S is the number of random samples and N is the number of data points. We demonstrate analytically and experimentally that MINPRAN distinguishes good fits from fits to random data, and that MINPRAN finds accurate fits and nearly the correct number of inliers, regardless of the percentage of true inliers.Keywords
This publication has 11 references indexed in Scilit:
- Robust Window OperatorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A survey of the hough transformPublished by Elsevier ,2005
- Robust statistics in shape fittingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A new robust operator for computer vision: application to range dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Extracting Geometric PrimitivesCVGIP: Image Understanding, 1993
- Robust regression methods for computer vision: A reviewInternational Journal of Computer Vision, 1991
- On the sensitivity of the Hough transform for object recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Robust Regression and Outlier DetectionPublished by Wiley ,1987
- Time- and Space-Efficient Algorithms for Least Median of Squares RegressionJournal of the American Statistical Association, 1987
- Random sample consensusCommunications of the ACM, 1981