Global optimality for point set registration using semidefinite programming

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

Abstract

In this paper we present a study of global optimality conditions for Point Set Registration (PSR) with missing data. PSR is the problem of aligning multiple point clouds with an unknown target point cloud. Since non-linear rotation constraints are present the problem is inherently non-convex and typically relaxed by computing the Lagrange dual, which is a Semidefinite Program (SDP). In this work we show that given a local minimizer the dual variables of the SDP can be computed in closed form. This opens up the possibility of verifying the optimally, using the SDP formulation without explicitly solving it. In addition it allows us to study under what conditions the relaxation is tight, through spectral analysis. We show that if the errors in the (unknown) optimal solution are bounded the SDP formulation will be able to recover it.

Detaljer

Författare
Enheter & grupper
Externa organisationer
  • Chalmers Tekniska Högskola
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Elektroteknik och elektronik
Originalspråkengelska
Titel på värdpublikationProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Sidor8284-8292
Antal sidor9
StatusPublished - 2020
PublikationskategoriForskning
Peer review utfördJa
Evenemang2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2020 - Virtual, Online, USA
Varaktighet: 2020 jun 142020 jun 19

Konferens

Konferens2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2020
LandUSA
OrtVirtual, Online
Period2020/06/142020/06/19