Regularized Pointwise Map Recovery from Functional Correspondence

Eurographics DL Repository

Show simple item record

dc.contributor.author Rodolà, E. en_US
dc.contributor.author Moeller, M. en_US
dc.contributor.author Cremers, D. en_US
dc.contributor.editor Chen, Min and Zhang, Hao (Richard) en_US
dc.date.accessioned 2018-01-10T07:43:28Z
dc.date.available 2018-01-10T07:43:28Z
dc.date.issued 2017
dc.identifier.issn 1467-8659
dc.identifier.uri http://dx.doi.org/10.1111/cgf.13160
dc.identifier.uri https://diglib.eg.org:443/handle/10.1111/cgf13160
dc.description.abstract The concept of using functional maps for representing dense correspondences between deformable shapes has proven to be extremely effective in many applications. However, despite the impact of this framework, the problem of recovering the point‐to‐point correspondence from a given functional map has received surprisingly little interest. In this paper, we analyse the aforementioned problem and propose a novel method for reconstructing pointwise correspondences from a given functional map. The proposed algorithm phrases the matching problem as a regularized alignment problem of the spectral embeddings of the two shapes. Opposed to established methods, our approach does not require the input shapes to be nearly‐isometric, and easily extends to recovering the point‐to‐point correspondence in part‐to‐whole shape matching problems. Our numerical experiments demonstrate that the proposed approach leads to a significant improvement in accuracy in several challenging cases.The concept of using functional maps for representing dense correspondences between deformable shapes has proven to be extremely effective in many applications. However, despite the impact of this framework, the problem of recovering the point‐to‐point correspondence from a given functional map has received surprisingly little interest. In this paper, we analyse the aforementioned problem and propose a novel method for reconstructing pointwise correspondences from a given functional map. The proposed algorithm phrases the matching problem as a regularized alignment problem of the spectral embeddings of the two shapes. Opposed to established methods, our approach does not require the input shapes to be nearly‐isometric, and easily extends to recovering the point‐to‐point correspondence in part‐to‐whole shape matching problems. en_US
dc.publisher © 2017 The Eurographics Association and John Wiley & Sons Ltd. en_US
dc.subject 3D shape matching
dc.subject I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling—Shape Analysis
dc.title Regularized Pointwise Map Recovery from Functional Correspondence en_US
dc.description.seriesinformation Computer Graphics Forum
dc.description.sectionheaders Articles
dc.description.volume 36
dc.description.number 8
dc.identifier.doi 10.1111/cgf.13160
dc.identifier.pages 700-711


Files in this item

Pay-Per-View via TIB Hannover:

Try if this item/paper is available.

This item appears in the following Collection(s)

Show simple item record

Search Eurographics DL


Browse

My Account