Shared more. Cited more. Safe forever.
    • advanced search
    • submit works
    • about
    • help
    • contact us
    • login
    View Item 
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Theses (MU)
    • 2009 Theses (MU)
    • 2009 MU theses - Access restricted to MU
    • View Item
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Theses (MU)
    • 2009 Theses (MU)
    • 2009 MU theses - Access restricted to MU
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    advanced searchsubmit worksabouthelpcontact us

    Browse

    All of MOspaceCommunities & CollectionsDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis SemesterThis CollectionDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis Semester

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular AuthorsStatistics by Referrer

    A compact representation for 3D animation using octrees and affine transformation

    Wang, Youyou, 1983-
    View/Open
    [PDF] public.pdf (2.325Kb)
    [PDF] short.pdf (7.498Kb)
    [PDF] research.pdf (1.196Mb)
    Date
    2009
    Format
    Thesis
    Metadata
    [+] Show full item record
    Abstract
    [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] 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.
    URI
    https://doi.org/10.32469/10355/6645
    https://hdl.handle.net/10355/6645
    Degree
    M.S.
    Thesis Department
    Computer science (MU)
    Rights
    Access is limited to the campus of the University of Missouri--Columbia.
    Collections
    • Computer Science electronic theses and dissertations (MU)
    • 2009 MU theses - Access restricted to MU

    Send Feedback
    hosted by University of Missouri Library Systems
     

     


    Send Feedback
    hosted by University of Missouri Library Systems