Trifocal Tensor

In computer vision, the trifocal tensor (also tritensor) is a 3×3×3 array of numbers (i.e., a tensor) that incorporates all projective geometric relationships among three views. It relates the coordinates of corresponding points or lines in three views, being independent of the scene structure and depending only on the relative motion (i.e., pose) among the three views and their intrinsic calibration parameters. Hence, the trifocal tensor can be considered as the generalization of the fundamental matrix in three views. It is noted that despite the tensor being made up of 27 elements, only 18 of them are actually independent.

There is also a so-called calibrated trifocal tensor, which relates the coordinates of points and lines in three views given their intrinsic parameters and encodes the relative pose of the cameras up to global scale, totalling 11 independent elements or degrees of freedom. The reduced degrees of freedom allow for fewer correspondences to fit the model, at the cost of increased nonlinearity.

Correlation slices

The tensor can also be seen as a collection of three rank-two 3 x 3 matrices $_1, \; _2, \; _3$ known as its ''correlation slices''. Assuming that the projection matrices of three views are = \; /math>, '= \; _4 /math> and = \; _4 /math>, the correlation slices of the corresponding tensor can be expressed in closed form as $_i=_i _4^t - _4 _i^t, \; i=1 \ldots 3$, where $_i, \; _i$ are respectively the ''i''^th columns of the camera matrices. In practice, however, the tensor is estimated from point and line matches across the three views.

Trilinear constraints

One of the most important properties of the trifocal tensor is that it gives rise to linear relationships between lines and points in three images. More specifically, for triplets of corresponding points $\; \leftrightarrow \; ' \; \leftrightarrow \;''$ and any corresponding lines $\; \leftrightarrow \; ' \; \leftrightarrow \;''$ through them, the following ''trilinear constraints'' hold:
:
(^ \left 1, \; _2, \; _3 \right'') []_ = ^t

:$^ \left( \sum_i x_i _i \right) '' = 0$
:
^ \left( \sum_i x_i _i \right) ' = ^t

:
\left( \sum_i x_i _i \right) '' =

:
\left( \sum_i x_i _i \right) ' = _

where cdot denotes the skew-symmetric cross product matrix.

Transfer

Given the trifocal tensor of three views and a pair of matched points in two views, it is possible to determine the location of the point in the third view without any further information. This is known as ''point transfer'' and a similar result holds for lines and conics. For general curves, the transfer can be realized through a local differential curve model of osculating circles (i.e., curvature), which can then be transferred as conics. The transfer of third-order models reflecting space torsion using calibrated trifocal tensors have been studied, but remains an open problem for uncalibrated trifocal tensors.

Estimation

Uncalibrated

The classical case is 6 point correspondences
giving 3 solutions.

The case estimating the trifocal tensor from 9 line correspondences has only recently been solved.

Calibrated

Estimating the calibrated trifocal tensor has been cited as notoriously difficult, and requires 4 point correspondences.

The case of using only three point correspondences has recently been solved, where the points are attributed with tangent directions or incident lines; with only two of the points having incident lines, this is a minimal problem of degree 312 (so there can be at most 312 solutions) and is relevant for the case of general curves (whose points have tangents), or feature points with attributed directions (such as SIFT directions).
The same technique solved the mixed case of three point correspondences and one line correspondence, which has also been shown to be minimal with degree 216.

References

Further reading

*
*{{cite journal
, last1=Torr , first1=P. H. S.
, last2=Zisserman , first2=A.
, year=1997
, title=Robust Parameterization and Computation of the Trifocal Tensor
, journal=Image and Vision Computing
, volume=15 , issue=8 , pages=591–607
, citeseerx=10.1.1.41.3172
, doi=10.1016/S0262-8856(97)00010-3

External links

Visualization of trifocal geometry
(originally by Sylvain Bougnoux of INRIA Robotvis, requires Java)

Algorithms

Matlab implementation of the uncalibrated trifocal tensor
estimation and comparison to pairwise fundamental matrices

C++ implementation of the calibrated trifocal tensor
estimation using optimized Homotopy Continuation code. Presently includes cases of three corresponding points with lines at these points (as in feature positions and orientations, or curve points with tangents), and also for three corresponding points and one line correspondence.

Geometry in computer vision
Matrices