Translation Synchronization via Truncated Least Squares

In this paper, we introduce a robust algorithm, 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.

[1]  I. Daubechies,et al.  Iteratively reweighted least squares minimization for sparse recovery , 2008, 0807.0575.

[2]  Leonidas J. Guibas,et al.  Near-Optimal Joint Object Matching via Convex Relaxation , 2014, ICML.

[3]  Jaime S. Cardoso,et al.  Tackling class imbalance with ranking , 2016, 2016 International Joint Conference on Neural Networks (IJCNN).

[4]  Helmut Pottmann,et al.  Reassembling fractured objects by geometric matching , 2006, ACM Trans. Graph..

[5]  Marc Pollefeys,et al.  Disambiguating visual relations using loop constraints , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Richard Szeliski,et al.  Structure from motion for scenes with large duplicate structures , 2011, CVPR 2011.

[7]  W. Marande,et al.  Mitochondrial DNA as a Genomic Jigsaw Puzzle , 2007, Science.

[8]  R. Heiberger,et al.  Design of an S Function for Robust Regression Using Iteratively Reweighted Least Squares , 1992 .

[9]  M. Hebert,et al.  Automatic three-dimensional modeling from reality , 2002 .

[10]  Leonidas J. Guibas,et al.  An Optimization Approach to Improving Collections of Shape Maps , 2011, Comput. Graph. Forum.

[11]  Leonidas J. Guibas,et al.  Consistent Shape Maps via Semidefinite Programming , 2013, SGP '13.

[12]  Leonidas J. Guibas,et al.  Robust global registration , 2005, SGP '05.

[13]  William T. Freeman,et al.  A probabilistic image jigsaw puzzle solver , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Andrew Owens,et al.  Discrete-continuous optimization for large-scale structure from motion , 2011, CVPR 2011.

[15]  Venu Madhav Govindu,et al.  Efficient and Robust Large-Scale Rotation Averaging , 2013, 2013 IEEE International Conference on Computer Vision.

[16]  Amit Singer,et al.  Exact and Stable Recovery of Rotations for Robust Synchronization , 2012, ArXiv.

[17]  Yuan Yao,et al.  Statistical ranking and combinatorial Hodge theory , 2008, Math. Program..

[18]  Vikas Singh,et al.  Permutation Diffusion Maps (PDM) with Application to the Image Association Problem in Computer Vision , 2014, NIPS.

[19]  Xiaowei Zhou,et al.  Multi-image Matching via Fast Alternating Minimization , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[20]  Stephen DiVerdi,et al.  Exploring collections of 3D models using fuzzy correspondences , 2012, ACM Trans. Graph..

[21]  Vikas Singh,et al.  Solving the multi-way matching problem by permutation synchronization , 2013, NIPS.

[22]  Marshall W. Bern,et al.  A global approach to automatic solution of jigsaw puzzles , 2002, SCG '02.

[23]  Sujay Sanghavi,et al.  Normalized Spectral Map Synchronization , 2016, NIPS.

[24]  Niloy J. Mitra,et al.  Super4PCS: Fast Global Pointcloud Registration via Smart Indexing , 2019 .

[25]  Yuxin Chen,et al.  The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences , 2016, Communications on Pure and Applied Mathematics.

[26]  Fan Chung Graham,et al.  The Spectral Gap of a Random Subgraph of a Graph , 2007, Internet Math..

[27]  Steven M. Seitz,et al.  Photo tourism: exploring photo collections in 3D , 2006, ACM Trans. Graph..