Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences

From MaRDI portal
Publication:1704899



Abstract: Let t1,ldots,tnlinmathbbRd and p1,ldots,pnsinmathbbRd and consider the bipartite location recovery problem: given a subset of pairwise direction observations (ti−pj)/|ti−pj|2i,jin[nl]imes[ns], where a constant fraction of these observations are arbitrarily corrupted, find tiiin[nll] and pjjin[ns] up to a global translation and scale. We study the recently introduced ShapeFit algorithm as a method for solving this bipartite location recovery problem. In this case, ShapeFit consists of a simple convex program over d(nl+ns) real variables. We prove that this program recovers a set of nl+ns i.i.d. Gaussian locations exactly and with high probability if the observations are given by a bipartite ErdH{o}s-R'{e}nyi graph, d is large enough, and provided that at most a constant fraction of observations involving any particular location are adversarially corrupted. This recovery theorem is based on a set of deterministic conditions that we prove are sufficient for exact recovery. Finally, we propose a modified pipeline for the Structure for Motion problem, based on this bipartite location recovery problem.






Describes a project that uses

Uses Software






This page was built for publication: Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704899)