EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1288

Full metadata record

DC FieldValueLanguage
dc.contributor.authorBanerjee, Subhashis-
dc.contributor.authorSudhir, G-
dc.contributor.authorZisserman, Andrew-
dc.identifier.citationComputer Vision and Image Understanding, 68(2), 237-246en
dc.description.abstractIn this paper the problem of computing the point correspondences in a sequence of time-varying images of a 3D object undergoing nonrigid (affine) motion is addressed. It is assumed that the images are obtained through affine projections. The correspondences are established only from the analysis of the unknown 3D affine structure of the object, without making use of any attributes of the feature points. It is shown that it is possible to establish the point correspondences uniquely (up to symmetry) in the sense that they yield a unique affine structure of the object and that the computation is possible in polynomial time. Two different algorithms for computing the point correspondences are presented. Results on various real image sequences, including a sequence containing independently moving objects, demonstrate the applicability of the structure based approach to motion correspondence.en
dc.format.extent703681 bytes-
dc.subjectnonrigid (affine) motionen
dc.subjectaffine projectionsen
dc.subjectpolynomial timeen
dc.titleFinding point correspondences in motion sequences preserving affine structureen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
sudhirfin1997.pdf687.19 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback