COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Applied and Computational Analysis > Compression for Smooth Shape Analysis
Compression for Smooth Shape AnalysisAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Carola-Bibiane Schoenlieb. Most 3D shape analysis methods use triangular meshes to discretize both the shape and functions on it as piecewise linear functions. With this representation, shape analy- sis requires fine meshes to represent smooth shapes and geometric operators like normals, curvatures, or Laplace- Beltrami eigenfunctions at large computational and mem- ory costs. We avoid this bottleneck with a compression technique that represents a smooth shape as subdivision surfaces and exploits the subdivision scheme to parametrize smooth functions on that shape with a few control parameters. This compression does not affect the accuracy of the Laplace- Beltrami operator and its eigenfunctions and allow us to compute shape descriptors and shape matchings at an ac- curacy comparable to triangular meshes but a fraction of the computational cost. Our framework can also compress surfaces represented by point clouds to do shape analysis of 3D scanning data. This is joint work with Frank Schmidt and Daniel Cremers. This talk is part of the Applied and Computational Analysis series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsBioenergy Initiative Guy Emerson's list Arrol Adam Lecture SeriesOther talksSaving the People of the Forest: one chocolate bar and one nebulizer treatment at a time Simulating Electricity Prices: negative prices and auto-correlation Treatment Centre Simulation Grammar Variational Autoencoder Nuclear fuel manufacture at Westinghouse Springfields past, present and future Circular Economy in Practice – Challenges and Opportunities |