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

Zorah Lahner; Emanuele Rodola; Frank R. Schmidt; Michael M. Bronstein; Daniel Cremers

doi:10.1109/CVPR.2016.240

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

Zorah Lahner, Emanuele Rodola, Frank R. Schmidt, Michael M. Bronstein, Daniel Cremers

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016
Publisher	IEEE Computer Society
Pages	2185-2193
Number of pages	9
ISBN (Electronic)	9781467388504
DOIs	https://doi.org/10.1109/CVPR.2016.240
State	Published - 9 Dec 2016
Externally published	Yes
Event	29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016 - Las Vegas, United States Duration: 26 Jun 2016 → 1 Jul 2016

Publication series

Name	Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Volume	2016-December
ISSN (Print)	1063-6919

Conference

Conference	29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016
Country/Territory	United States
City	Las Vegas
Period	26/06/16 → 1/07/16

Access to Document

10.1109/CVPR.2016.240

Cite this

Lahner, Z., Rodola, E., Schmidt, F. R., Bronstein, M. M., & Cremers, D. (2016). Efficient Globally Optimal 2D-to-3D Deformable Shape Matching. In Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016 (pp. 2185-2193). [7780609] (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition; Vol. 2016-December). IEEE Computer Society. https://doi.org/10.1109/CVPR.2016.240

@inproceedings{beb7786af903457c8d8d7579d8f9aa17,

title = "Efficient Globally Optimal 2D-to-3D Deformable Shape Matching",

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.",

author = "Zorah Lahner and Emanuele Rodola and Schmidt, {Frank R.} and Bronstein, {Michael M.} and Daniel Cremers",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; null ; Conference date: 26-06-2016 Through 01-07-2016",

year = "2016",

month = dec,

day = "9",

doi = "10.1109/CVPR.2016.240",

language = "אנגלית",

series = "Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition",

publisher = "IEEE Computer Society",

pages = "2185--2193",

booktitle = "Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016",

address = "ארצות הברית",

}

Lahner, Z, Rodola, E, Schmidt, FR, Bronstein, MM & Cremers, D 2016, Efficient Globally Optimal 2D-to-3D Deformable Shape Matching. in Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016., 7780609, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2016-December, IEEE Computer Society, pp. 2185-2193, 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, United States, 26/06/16. https://doi.org/10.1109/CVPR.2016.240

Efficient Globally Optimal 2D-to-3D Deformable Shape Matching. / Lahner, Zorah; Rodola, Emanuele; Schmidt, Frank R. et al.

Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016. IEEE Computer Society, 2016. p. 2185-2193 7780609 (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition; Vol. 2016-December).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Lahner, Zorah

AU - Rodola, Emanuele

AU - Schmidt, Frank R.

AU - Bronstein, Michael M.

AU - Cremers, Daniel

PY - 2016/12/9

Y1 - 2016/12/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986268025&partnerID=8YFLogxK

U2 - 10.1109/CVPR.2016.240

DO - 10.1109/CVPR.2016.240

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84986268025

T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

SP - 2185

EP - 2193

BT - Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016

PB - IEEE Computer Society

Y2 - 26 June 2016 through 1 July 2016

ER -

Lahner Z, Rodola E, Schmidt FR, Bronstein MM, Cremers D. Efficient Globally Optimal 2D-to-3D Deformable Shape Matching. In Proceedings - 29th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016. IEEE Computer Society. 2016. p. 2185-2193. 7780609. (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition). doi: 10.1109/CVPR.2016.240

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this