DocumentCode
2079805
Title
Using global consistency to recognise Euclidean objects with an uncalibrated camera
Author
Forsyth, D.A. ; Mundy, J.L. ; Zisserman, A. ; Rothwell, C.A.
Author_Institution
Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA
fYear
1994
fDate
21-23 Jun 1994
Firstpage
502
Lastpage
507
Abstract
A recognition strategy consisting of a mixture of indexing on invariants and search, allows objects to be recognised up to a Euclidean ambiguity with an uncalibrated camera. The approach works by using projective invariants to determine all the possible projectively equivalent models for a particular imaged object; then a system of global consistency constraints is used to determine which of these projectively equivalent, but Euclidean distinct, models corresponds to the objects viewed. These constraints follow from properties of the imaging geometry. In particular, a recognition hypothesis is equivalent to an assertion about, among other things, viewing conditions and geometric relationships between objects, and these assertions must be consistent for hypotheses to be correct. The approach is demonstrated to work on images of real scenes consisting of polygonal objects and polyhedra
Keywords
computer vision; image recognition; Euclidean objects; computer vision; global consistency; global consistency constraints; imaging geometry; indexing; invariant theory; polygonal objects; polyhedra; projective invariants; real scenes; recognition; uncalibrated camera; Machine vision; Object recognition;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 1994. Proceedings CVPR '94., 1994 IEEE Computer Society Conference on
Conference_Location
Seattle, WA
ISSN
1063-6919
Print_ISBN
0-8186-5825-8
Type
conf
DOI
10.1109/CVPR.1994.323873
Filename
323873
Link To Document