next up previous
Next: 5 Solving for the Up: Rectification with unconstrained stereo Previous: 3 The rectification transformation

 

4 Constraining the rectifying projection matrices

To compute the rectifying projection matrices tex2html_wrap_inline997 and tex2html_wrap_inline999 , we set up a linear, homogeneous system of equations formed by the constraints sufficient to guarantee rectification [1], and incorporate explicitly quadratic constraints on the entries of tex2html_wrap_inline997 and tex2html_wrap_inline999 to ensure a nontrivial solution. The constrained system and its equations are detailed in this section. In the following, we shall write tex2html_wrap_inline1005 as follows:

equation238

Scale factor.

Projection matrices are defined up to a scale factor. The common choice to block the latter is tex2html_wrap_inline1007 and tex2html_wrap_inline1009 [1], unfortunately, brings about two problems: first, the intrinsic parameters become dependent on the choice of the world coordinate system [5]; second, the resulting projection matrices do not satisfy the conditions guaranteeing that meaningful calibration parameters can be extracted from their entries of the matrices [4], that is (for example for tex2html_wrap_inline997 ),

  equation276

To obviate the problems mentioned, we enforce

equation284

The second equation in (10) and its equivalent for tex2html_wrap_inline999 are actually implied by the system defining our algorithm (proof omitted for reasons of space).

Position of the optical centers.

The optical centers of the rectified projections, tex2html_wrap_inline1015 and tex2html_wrap_inline1017 , must be the same as those of the original projections:

  equation294

Eq. (12) gives six linear constraints:

equation312

Common focal plane.

The two rectified projections must share the same focal plane, i.e.

  equation342

Alignment of conjugate epipolar lines.

The vertical coordinate of the projection of a 3-D point onto the rectified retinal plane must be the same in both image, i.e:

equation350

Using Eq. (14) we obtain the constraints

  equation369

Notice that the equations written to this point are sufficient to guarantee rectification (indeed some authors stop here, e.g. [1]), but not a unique solution: the orientation of the rectified retinal plane and the intrinsic parameters are still free. Our algorithm constrains these quantities explicitly, as follows.

Orientation of the rectified retinal plane.

We choose the rectified focal planes to be parallel to the intersection of the two original focal planes, i.e.

equation379

where tex2html_wrap_inline1019 and tex2html_wrap_inline1021 are the third rows of tex2html_wrap_inline1023 and tex2html_wrap_inline1025 respectively. Notice that the dual equation tex2html_wrap_inline1027 is redundant thanks to Eq. (14).

Orthogonality of the rectified reference frames.

The intersections of the retinal plane with the planes tex2html_wrap_inline1029 and tex2html_wrap_inline1031 correspond to the v and u axes, respectively, of the retinal reference frame. As this reference frame to be orthogonal, the planes must be perpendicular, hence, using Eq. (16),

  equation406

Principal points.

Given a full-rank tex2html_wrap_inline1037 matrix satisfying constraints (10), the principal point tex2html_wrap_inline1039 is given by [4]:

equation418

We set the two principal points to (0,0) and use Eqs. (14) and (16) to obtain the constraints

  equation428

Focal lengths in pixels.

The horizontal and vertical focal lengths in pixels, respectively, are given by

equation444

By setting the values of tex2html_wrap_inline1043 and tex2html_wrap_inline1045 , for example, to the values extracted from tex2html_wrap_inline1047 , we obtain the constraints

equation452

which, by virtue of the equivalence tex2html_wrap_inline1049 and Eq. (20), can be rewritten as

  equation470


next up previous
Next: 5 Solving for the Up: Rectification with unconstrained stereo Previous: 3 The rectification transformation

Adrian F Clark
Wed Jul 23 16:48:44 BST 1997