Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/19679
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, Yanhuaen
dc.date.issued2000en
dc.identifier.urihttp://hdl.handle.net/2440/19679-
dc.descriptionBibliography: leaves 100-110.en
dc.descriptionxiv, 110 leaves : ill. ; 30 cm.en
dc.description.abstractThis thesis addresses the structure from motion problem in computer vision.en
dc.format.extent47586 bytesen
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.subject.lcshComputer vision.en
dc.subject.lcshImage processing.en
dc.titleEfficient recursive factorization methods for determining structure from motion / Yanhau Li.en
dc.typeThesisen
dc.contributor.schoolDept. of Computer Scienceen
dc.provenanceThis electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exception. If you are the author of this thesis and do not wish it to be made publicly available or If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legals.en
dc.description.dissertationThesis (Ph.D.)--University of Adelaide, Dept. of Computer Science, 2000en
Appears in Collections:Research Theses

Files in This Item:
File Description SizeFormat 
01front.pdf 46.47 kBAdobe PDFView/Open
02whole.pdf4.56 MBAdobe PDFView/Open


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