DocumentCode :
2604696
Title :
Optimal matching of planar models in 3D scenes
Author :
Jacobs, David W.
Author_Institution :
Artificial Intelligence Lab., MIT, Cambridge, MA, USA
fYear :
1991
fDate :
3-6 Jun 1991
Firstpage :
269
Lastpage :
274
Abstract :
The problem of matching a model consisting of the point features of a flat object to point features found in an image that contains the object in an arbitrary three-dimensional pose is addressed. Once three points are matched, it is possible to determine the pose of the object. Assuming bounded sensing error, the author presents a solution to the problem of determining the range of possible locations in the image at which any additional model points may appear. This solution leads to an algorithm for determining the largest possible matching between image and model features that includes this initial hypothesis. The author implements a close approximation to this algorithm, which is O( nm6), where n is the number of image points, m is the number of model points, and ∈ is the maximum sensing error. This algorithm is compared to existing methods, and it is shown that it produces more accurate results
Keywords :
computerised pattern recognition; computerised picture processing; 3D scenes; bounded sensing error; close approximation; flat object; image; maximum sensing error; model features; optimal matching; planar models; point features; Artificial intelligence; Cost function; Indexing; Jacobian matrices; Laboratories; Layout; Object recognition; Optimal matching;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on
Conference_Location :
Maui, HI
ISSN :
1063-6919
Print_ISBN :
0-8186-2148-6
Type :
conf
DOI :
10.1109/CVPR.1991.139700
Filename :
139700
Link To Document :
بازگشت