Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A new robust operator for computer vision: application to range data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Stewart, C.V. ; Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA

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

Published in:

Computer Vision and Pattern Recognition, 1994. Proceedings CVPR '94., 1994 IEEE Computer Society Conference on

Date of Conference:

21-23 Jun 1994