[-] Show simple item record

dc.contributor.advisorDeSouza, Guilhermeeng
dc.contributor.authorWang, Youyou, 1983-eng
dc.date.issued2009eng
dc.date.submitted2009 Falleng
dc.descriptionTitle from PDF of title page (University of Missouri--Columbia, viewed on March 10, 2010).eng
dc.descriptionThe entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file.eng
dc.descriptionThesis advisor: Dr. Guilherme DeSouza.eng
dc.descriptionVita.eng
dc.descriptionIncludes bibliographical references.eng
dc.descriptionM.S. University of Missouri--Columbia 2009.eng
dc.descriptionDissertations, Academic -- University of Missouri--Columbia -- Computer science.eng
dc.description.abstract[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] We present a new and compact 3D representation for non-rigid objects using motion vectors between two consecutive frames. Our method relies on an Octree to recursively partition the object into smaller parts. Each part is then assigned a small number of motion parameters that can accurately represent that portion of the object. The partitioning continues as long as the respective motion parameters are insufficiently accurate to describe the object. Our method employs an affine transformation as the motion vectors. A technique using adaptive thresholding, singular value decomposition for dealing with singularities, and a quantization and arithmetic coding further enhance our proposed method by increasing the compression while maintaining very good signal-noise ratio. Besides the work we have done for synthetic data (animation), we also challenge a much more difficult problem - the motion representation for real data (cloud of points), where the correspondence is unknown. We applied Iterative Closest Points (ICP) algorithm for computing a pseudo correspondence, combined with an Octree structure to deal with the non-rigidity that ICP can not capture. About the motion vectors, we still use the affine transformation as we did for animation data. Even though our result for this part is not strong, we give a detailed analysis for the failure and proposed several possible solutions.eng
dc.format.extentvi, 76 pageseng
dc.identifier.oclc560337206eng
dc.identifier.urihttp://hdl.handle.net/10355/6645
dc.languageEnglisheng
dc.publisherUniversity of Missouri--Columbiaeng
dc.relation.ispartof2009 MU restricted theses (MU)eng
dc.relation.ispartofcommunityUniversity of Missouri-Columbia. Graduate School. Theses and Dissertations. Theses. 2009 Theseseng
dc.rightsAccess is limited to the campus of the University of Missouri-Columbia.eng
dc.subjectoctree transformation; closest points algorithmeng
dc.subjectoctree transformation; closest points algorithmeng
dc.subject.lcshComputer animationeng
dc.subject.lcshThree-dimensional imagingeng
dc.subject.lcshImage stabilizationeng
dc.subject.lcshCompact operatorseng
dc.titleA compact representation for 3D animation using octrees and affine transformationeng
dc.typeThesiseng
thesis.degree.disciplineComputer science (MU)eng
thesis.degree.grantorUniversity of Missouri--Columbiaeng
thesis.degree.levelMasterseng
thesis.degree.nameM.S.eng


Files in this item

[PDF]
[PDF]
[PDF]

This item appears in the following Collection(s)

[-] Show simple item record