TriP: A Triangle Puzzle Approach to Robust Translation Averaging

TL;DR

TriP introduces a triangle-based framework for robust translation averaging in Structure-from-Motion, leveraging higher-order consistency to improve accuracy and robustness against corruptions.

Contribution

The paper presents TriP, a novel triangle-based method that enhances robustness and scalability in translation averaging without collapse issues.

Findings

TriP outperforms previous methods on synthetic datasets.

TriP is scalable to graphs with millions of cameras.

TriP is robust to various structured corruptions.

Abstract

Translation averaging aims to recover camera locations from pairwise relative translation directions and is a fundamental component of global Structure-from-Motion pipelines. The problem is challenging because direction measurements contain no distance information, making the estimation problem highly ill-conditioned and highly sensitive to corrupted observations. In this paper, we propose TriP, a triangle-based framework for robust translation averaging. TriP first infers local relative edge scales from triangle geometry, and then synchronizes the scales of overlapping triangles in the logarithmic domain to recover globally consistent edge lengths and camera locations. By leveraging higher-order consistency across triangles, the proposed method is robust to adversarial, cycle-consistent, and other structured corruptions. In addition, TriP avoids the collapse issue without requiring any extra anti-collapse constraints, since log-scale synchronization excludes the degenerate zero-scale solution by construction. These structural advantages enable a particularly strong theory for exact location recovery. On the practical side, TriP is fully parallelizable, computationally efficient, and naturally scalable to graphs with millions of cameras. Moreover, it outperforms all previous translation averaging methods by a large margin on both synthetic and real datasets.