Poster
Translation Synchronization via Truncated Least Squares
Xiangru Huang · Zhenxiao Liang · Chandrajit Bajaj · Qixing Huang
Pacific Ballroom #47
Keywords: [ Convex Optimization ] [ Computer Vision ] [ Sparsity and Compressed Sensing ] [ Non-Convex Optimization ]
In this paper, we introduce a robust algorithm, \textsl{TranSync}, for the 1D translation synchronization problem, in which the aim is to recover the global coordinates of a set of nodes from noisy measurements of relative coordinates along an observation graph. The basic idea of TranSync is to apply truncated least squares, where the solution at each step is used to gradually prune out noisy measurements. We analyze TranSync under both deterministic and randomized noisy models, demonstrating its robustness and stability. Experimental results on synthetic and real datasets show that TranSync is superior to state-of-the-art convex formulations in terms of both efficiency and accuracy.
Live content is unavailable. Log in and register to view live content