DocumentCode
3205842
Title
Hybrid weak-perspective and full-perspective matching
Author
Beveridge, J. Ross ; Riseman, E.M.
Author_Institution
Dept. of Comput. & Inf. Sci., Massachusetts Univ., Amherst, MA, USA
fYear
1992
fDate
15-18 Jun 1992
Firstpage
432
Lastpage
438
Abstract
Full-perspective mappings between 3-D objects and 2-D images are more complicated than weak-perspective mappings, which consider only rotation, translation, and scaling. Therefore, in 3-D model-based robot navigation, it is important to understand how and when full-perspective must be taken into account. A probabilistic combinatorial optimization algorithm is used to search for an optimal match between 3-D landmarks and 2-D image features. Three variations are considered. A weak-perspective algorithm rotates, translates, and scales an initial 2-D projection of the 3-D landmark. A full perspective selects a most promising alternative, but then updates the pose and reprojects the landmark. Like the full-perspective algorithm, the hybrid algorithm reliably recovers the true pose of the robot, and like the weak-perspective algorithm, it runs 5 to 10 faster than the full-perspective algorithm
Keywords
combinatorial mathematics; computer vision; image processing; robots; 2-D image features; 2-D images; 3-D landmarks; 3-D model-based robot navigation; 3-D objects; full-perspective matching; probabilistic combinatorial optimization algorithm; rotation; scaling; translation; weak perspective matchings; Contracts; Feature extraction; Image segmentation; Information science; Navigation; Optimal matching; Robot vision systems; Testing; Wire;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92., 1992 IEEE Computer Society Conference on
Conference_Location
Champaign, IL
ISSN
1063-6919
Print_ISBN
0-8186-2855-3
Type
conf
DOI
10.1109/CVPR.1992.223154
Filename
223154
Link To Document