资源分类
》 资源 》论文》Efficient Globally Optimal 2D-to-3D Deformable Shape Matching

Efficient Globally Optimal 2D-to-3D Deformable Shape Matching

2019-12-23 | |  37 |   35 |   0

Abstract

We propose the first algorithm for non-rigid 2D-to-3Dshape matching, where the input is a 2D query shape as wellas a 3D target shape and the output is a continuous match-ing curve represented as a closed contour on the 3D shape.We cast the problem as finding the shortest circular path onthe product 3-manifold of the two shapes. We prove thatthe optimal matching can be computed in polynomial timewith a (worst-case) complexity of O(mn2 log(n)), where mand n denote the number of vertices on the 2D and the 3Dshape respectively. Quantitative evaluation confirms thatthe method provides excellent results for sketch-based de-formable 3D shape retrieval.

上一篇：Robust Light Field Depth Estimation for Noisy Scene with Occlusion

下一篇：3D Reconstruction of Transparent Objects with Position-Normal Consistency

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...