TriP: A Triangle Puzzle Approach to Robust Translation Averaging

• URL: http://arxiv.org/abs/2605.07143v1
• Date: Fri, 08 May 2026 02:21:51 GMT
• Title: TriP: A Triangle Puzzle Approach to Robust Translation Averaging
• Abstract summary: We propose TriP, a triangle-based framework for robust translation averaging.<n>By leveraging higher-order consistency across triangles, the proposed method is robust to adversarial, cycle-consistent, and other structured corruptions.<n>On the practical side, TriP is fully parallelizable, computationally efficient, and naturally scalable to graphs with millions of cameras.
• Score: 5.918492948669744
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• 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.

Related papers

• VGGT-Align: Bridging Local Reconstruction and Global Consistency for Long-Sequence 3D Reconstruction [8.983872448985627]
  We present a scale-consistency enhancement framework built on a key insight: in structured environments such as driving scenes, geometric quantities remain inherently invariant across temporal segments.<n>We propose Scene Geometric Invariant Anchoring (SGIA), which extracts dominant geometric invariants from each chunk's predicted point cloud via coarse-to-fine robust estimation.<n> Experiments on multiple long-sequence benchmarks demonstrate state-of-the-art performance, reducing absolute trajectory error by up to 32% with significant gains in trajectory stability and reconstruction quality.
  arXiv  Detail & Related papers  (2026-08-15T14:32:55Z)
• FDR-Occ: Factorized Dense Routing for Full-Spectrum 3D Occupancy Prediction [63.738631229597274]
  Vision-based 3D occupancy prediction fundamentally relies on the 2D-to-3D view transformation.<n>Current paradigms predominantly utilize explicit physical projection, which artificially restricts the routing matrix to strict, sparse camera rays.<n>We propose Factorized Dense Routing (FDR) to break this bottleneck.<n>Our framework achieves state-the-art performance on the Occ3D-nuScenes and Occ3D-Waymo benchmarks.
  arXiv  Detail & Related papers  (2026-07-04T11:12:42Z)
• NoPA: Non-Parametric Online 3D Scene Graph Generation [57.15076373014265]
  NoPA represents each object as a separate non-parametric distribution.<n>We leverage maximum mean discrepancy on kernel density estimates to enable robust merging of object candidates.<n>NoPA substantially outperforms current methods without sacrificing real-time inference speed.
  arXiv  Detail & Related papers  (2026-07-01T07:18:07Z)
• Surflo: Consistent 3D Surface Flow Model with Global State [57.57234680235885]
  Surflo decodes oriented 3D surface points by independently transporting them from noise onto the surface via flow matching.<n>To suppress the local inconsistencies inherent to independent per-point decoding, an inference-time guidance term correlates nearby points by injecting a photometric gradient.<n>Surflo matches or surpasses feed-forward baselines on surface metrics, runs an order of magnitude faster than optimization-based methods that require hundreds of views, and is the only feed-forward approach to combine a global latent with arbitrary-resolution decoding.
  arXiv  Detail & Related papers  (2026-06-11T17:48:38Z)
• TriDE: Triangle-Consistent Translation Directions for Global Camera Pose Estimation [6.2145524307257665]
  We propose TriDE, which exploits camera-triangle consistency as an efficient higher-order verification signal.<n>Experiments on real image graphs show that TriDE improves direction accuracy by a large margin and yields better downstream camera locations.
  arXiv  Detail & Related papers  (2026-05-07T19:43:15Z)
• LG-HCC: Local Geometry-Aware Hierarchical Context Compression for 3D Gaussian Splatting [77.81227097905865]
  Anchor-based 3DGS compression schemes reduce gaussian redundancy through some advanced context models.<n>We propose a Local Geometry-aware Hierarchical Context Compression framework for 3DGS that incorporates inter-anchor geometric correlations into anchor pruning and entropy coding for compact representation.<n>Experiments show that LG-HCC effectively alleviates structural preservation issues,achieving superior geometric integrity and rendering fidelity while reducing storage by up to 30.85x compared to the Scaffold-GS baseline on the Mip-NeRF360 dataset.
  arXiv  Detail & Related papers  (2026-03-30T13:39:35Z)
• DC-Reg: Globally Optimal Point Cloud Registration via Tight Bounding with Difference of Convex Programming [43.06401929828342]
  We develop a new framework to achieve globally optimal point registration interplay.<n>We show that it achieves significantly faster convergence to extreme noise and the outlier-of-the-art global to extreme noise.
  arXiv  Detail & Related papers  (2026-03-26T13:38:45Z)
• Neural Triangular Transport Maps: A New Approach Towards Sampling in Lattice QCD [0.7161783472741748]
  We introduce a comprehensive framework for triangular transport maps that navigates the fundamental trade-off between emphexact sparsity and emphapproximate sparsity<n>Using $phi4$ in two dimensions as a controlled setting, we analyze how node labelings (orderings) affect the sparsity and performance of triangular maps.
  arXiv  Detail & Related papers  (2025-10-15T03:15:10Z)
• Robust Point Cloud Registration via Geometric Overlapping Guided Rotation Search [23.51667667895256]
  Point cloud registration based on correspondences computes the rigid transformation that maximizes the number of inliers constrained within the noise threshold.<n>This paper proposes a maximum overlapping registration framework via rotation-only BnB search.
  arXiv  Detail & Related papers  (2025-08-24T16:01:31Z)
• 3-Dimensional CryoEM Pose Estimation and Shift Correction Pipeline [2.009945677846956]
  Accurate pose estimation and shift correction are key challenges in cryo-EM due to the very low SNR, which directly impacts the fidelity of 3D reconstructions.<n>We present an approach for pose estimation in cryo-EM that leverages multi-dimensional scaling (MDS) techniques in a robust manner to estimate the 3D rotation matrix of each particle from pairs of dihedral angles.
  arXiv  Detail & Related papers  (2025-07-20T11:46:17Z)
• SGFormer: Spherical Geometry Transformer for 360 Depth Estimation [52.23806040289676]
  Panoramic distortion poses a significant challenge in 360 depth estimation.<n>We propose a spherical geometry transformer, named SGFormer, to address the above issues.<n>We also present a query-based global conditional position embedding to compensate for spatial structure at varying resolutions.
  arXiv  Detail & Related papers  (2024-04-23T12:36:24Z)
• Relative Pose from SIFT Features [50.81749304115036]
  We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale. The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
  arXiv  Detail & Related papers  (2022-03-15T14:16:39Z)
• Robust Training in High Dimensions via Block Coordinate Geometric Median Descent [69.47594803719333]
  Geometric median (textGm) is a classical method in statistics for achieving a robust estimation of the uncorrupted data. In this paper, we show that by that by applying textscGm to only a chosen block of coordinates at a time, one can retain a breakdown point of 0.5 judiciously for smooth nontext problems.
  arXiv  Detail & Related papers  (2021-06-16T15:55:50Z)
• Dense Non-Rigid Structure from Motion: A Manifold Viewpoint [162.88686222340962]
  Non-Rigid Structure-from-Motion (NRSfM) problem aims to recover 3D geometry of a deforming object from its 2D feature correspondences across multiple frames. We show that our approach significantly improves accuracy, scalability, and robustness against noise.
  arXiv  Detail & Related papers  (2020-06-15T09:15:54Z)
• Quaternion Equivariant Capsule Networks for 3D Point Clouds [58.566467950463306]
  We present a 3D capsule module for processing point clouds that is equivariant to 3D rotations and translations. We connect dynamic routing between capsules to the well-known Weiszfeld algorithm. Based on our operator, we build a capsule network that disentangles geometry from pose.
  arXiv  Detail & Related papers  (2019-12-27T13:51:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.