Tensor-Based Synchronization and the Low-Rankness of the Block Trifocal Tensor
Daniel Miao, Gilad Lerman, Joe Kileel
Abstract
The block tensor of trifocal tensors provides crucial geometric information on the three-view geometry of a scene. The underlying synchronization problem seeks to recover camera poses (locations and orientations up to a global transformation) from the block trifocal tensor. We establish an explicit Tucker factorization of this tensor, revealing a low multilinear rank of $(6,4,4)$ independent of the number of cameras under appropriate scaling conditions. We prove that this rank constraint provides sufficient information for camera recovery in the noiseless case. The constraint motivates a synchronization algorithm based on the higher-order singular value decomposition of the block trifocal tensor. Experimental comparisons with state-of-the-art global synchronization methods on real datasets demonstrate the potential of this algorithm for significantly improving location estimation accuracy. Overall this work suggests that higher-order interactions in synchronization problems can be exploited to improve performance, beyond the usual pairwise-based approaches.
BibTeX
@inproceedings{
miao2024tensorbased,
title={Tensor-Based Synchronization and the Low-Rankness of the Block Trifocal Tensor},
author={Daniel Miao and Gilad Lerman and Joe Kileel},
booktitle={The Thirty-eighth Annual Conference on Neural Information Processing Systems},
year={2024},
url={https://openreview.net/forum?id=DT7n4F2bbP}
}