A new robust operator for computer vision: application to range data
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 167-173
- https://doi.org/10.1109/cvpr.1994.323825
Abstract
The basic MINPRAN (MINimize the Probability of RANdomness) technique, introduced by C.V. Stewart (1994), is extended to handle range data taken from complex scenes. Such data often includes: (1) a large numbers of outliers, (2) points from multiple surfaces interspersed over large image regions, and (3) extended regions containing only bad data. The initial version of MINPRAN handles cases (1) and (3). For (2), given an image region containing data from more than one surface, the basic technique tends to favor a single fit that "bridges" two surfaces. We analyze the extent of this problem and introduce two modifications to solve it. The new version of the algorithm, called MINPRAN2, produces extremely good results on difficult range data.Keywords
This publication has 6 references indexed in Scilit:
- Multi-layer surface segmentation using energy minimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Energy-based segmentation of very sparse range surfacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new robust operator for computer vision: theoretical analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Three-dimensional vision structure for robot applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Segmentation through variable-order surface fittingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Least Median of Squares RegressionJournal of the American Statistical Association, 1984