English

QuadSync: Quadrifocal Tensor Synchronization via Tucker Decomposition

Computer Vision and Pattern Recognition 2026-04-21 v2 Numerical Analysis Numerical Analysis Optimization and Control

Abstract

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover nn cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,~4,~4,~4) independent of nn. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Keywords

Cite

@article{arxiv.2602.22639,
  title  = {QuadSync: Quadrifocal Tensor Synchronization via Tucker Decomposition},
  author = {Daniel Miao and Gilad Lerman and Joe Kileel},
  journal= {arXiv preprint arXiv:2602.22639},
  year   = {2026}
}

Comments

30 pages, accepted to CVPR 2026 as an Oral Presentation. Complementary code can be found at github.com/dmiao153/QuadSync

R2 v1 2026-07-01T10:53:20.970Z