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

Lahner Z, Rodola E, Schmidt FR, Bronstein MM, Cremers D (2016)

Publication Type: Conference contribution

Publication year: 2016

Journal

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition IEEE Computer Society; 1999

Publisher: IEEE Computer Society

Book Volume: 2016-December

Pages Range: 2185-2193

Conference Proceedings Title: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Event location: Las Vegas, NV, USA

ISBN: 9781467388504

DOI: 10.1109/CVPR.2016.240

Abstract

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

Involved external institutions

Technische Universität München (TUM)

Germany (DE) Università della Svizzera italiana (USI)

Switzerland (CH)

How to cite

APA:

Lahner, Z., Rodola, E., Schmidt, F.R., Bronstein, M.M., & Cremers, D. (2016). Efficient Globally Optimal 2D-to-3D Deformable Shape Matching. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 2185-2193). Las Vegas, NV, USA: IEEE Computer Society.

MLA:

Lahner, Zorah, et al. "Efficient Globally Optimal 2D-to-3D Deformable Shape Matching." Proceedings of the 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA IEEE Computer Society, 2016. 2185-2193.

BibTeX: Download