Abstract
In geometric computer vision the trifocal tensors are 3×3×3 tensors T by whose means three different camera views of the same scene are related to each other. In this paper we find two different sets of constraints, in the entries of T, that must be satisfied by trifocal tensors. The first set gives exactly the (closure of the) trifocal locus, i.e. all trifocal tensors, but it is very big. The second set, although not complete and still very big, has the property that it is possible to extract from it a set of only eight equations that are generically complete, i.e. for a generic choice of T, they suffice to decide whether T is indeed trifocal. Note that 8 is the codimension of the trifocal locus in its ambient space.
Similar content being viewed by others
References
Cox, D., Little, J., O’Shea, D.: Varieties, Ideals and Algorithms. Springer, Berlin (1992)
Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2000)
Heyden, A.: Tensorial properties of multilinear constraints. Math. Methods Appl. Sci. 23, 169–202 (2000)
Papadopoulo, T., Faugeras, O.: A new characterization of the trifocal tensor. In: Computer Vision—ECCV’98. Lecture Notes in Computer Science, vol. 1406, pp. 109–123
Ressl, C.: Geometry, Constraints and computation of the trifocal tensor. Ph.D. Thesis (2003)
Thrall, R.M.: Metabelian grous and trilinear forms. Am. J. Math. 60, 383–415 (1938)
Thrall, R.M., Chanler, J.H.: Ternary trilinear forms in the field of complex numbers. Duke Math. J. 4, 678–690 (1938)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alzati, A., Tortora, A. A Geometric Approach to the Trifocal Tensor. J Math Imaging Vis 38, 159–170 (2010). https://doi.org/10.1007/s10851-010-0216-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10851-010-0216-4