Exact Recovery with Symmetries for Procrustes Matching

DOI10.1137/16M1078628zbMath1376.90042arXiv1606.01548OpenAlexW2962954307MaRDI QIDQ5348459

Nadav Dym, Yaron Lipman

Publication date: 16 August 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01548

zbMATH Keywords

exact recoveryshape matchingsemidefinite program (SDP)global registration

Mathematics Subject Classification ID

Semidefinite programming (90C22) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Exact Recovery with Symmetries for the Doubly Stochastic Relaxation

Uses Software

• YALMIP
• Mosek
• SCAPE
• PhaseLift

Cites Work

• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Theory of semidefinite programming for sensor network localization
• Problems of distance geometry and convex properties of quadratic maps
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• On convex relaxation of graph isomorphism
• On spectral properties for graph matching and graph isomorphism problems
• Graph isomorphism in quasipolynomial time [extended abstract]
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Phase Retrieval via Matrix Completion

This page was built for publication: Exact Recovery with Symmetries for Procrustes Matching