Abstract
In this chapter we give an account of two different methods to find constraints for the trifocal tensor Т, used in geometric computer vision. We also show how to single out a set of only eight equations that are generically complete, i.e. for a generic choice of Т, they suffice to decide whether Т is indeed trifocal. Note that eight is minimum possible number of constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alzati, A., Tortora, A.: A geometric approach to the trifocal tensor. To appear
Hartley, R., Zisserman, A.: Multiple view geometry in computer vision. Cambridge University Press, Cambribge (2000)
Thrall, R. M., Chandler, 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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this chapter
Cite this chapter
Alzati, A., Tortora, A. (2009). Constraints for the Trifocal Tensor. In: Aja-Fernández, S., de Luis García, R., Tao, D., Li, X. (eds) Tensors in Image Processing and Computer Vision. Advances in Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-84882-299-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-84882-299-3_12
Publisher Name: Springer, London
Print ISBN: 978-1-84882-298-6
Online ISBN: 978-1-84882-299-3
eBook Packages: Computer ScienceComputer Science (R0)