Subset-based stereo calibration method optimizing triangulation accuracy

Introduction

Vision systems based on stereo imaging setups are widely used in numerous application contexts where contact-less measurement of 3D space is required. To perform 3D reconstruction, the imaging setup has to be calibrated. This includes calibration of each individual camera, combined with calibration of the whole stereo rig. In practice, a very widely used family of methods for camera and stereo calibration are based on a planar object with known pattern (such as a chessboard). The core principle of planar-based calibration is minimization of reprojection error in each image, as described in the original article by Zhang (2000). Widely used implementation of this approach is available as a part of the open source computer vision library OpenCV.

Because stereo vision systems are pervasive in many optical measurement applications, the topics of stereo calibration and improvement of thereof have been widely presented in the research literature. Some approaches use the standard calibration approach directly. For example, the standard routine as implemented with OpenCV is applied by Zhong & Dong (2015) to guide a REINOVO robot using stereo vision. Singh, Kumar & Nongmeikapam (2020) combine the standard calibration approach with the preliminary knowledge on the ranges of dimensions to be measured, namely height of a person. In other cases, some parts of the standard calibration pipeline are used in combination with additional supporting elements of the physical setup. Stereo calibration is tackled in context of a custom 3D scanner that includes a stereo camera rig (Lin, 2020). The solution makes use of extrinsic transformations with respect to the chessboard calibration object. Each camera is calibrated separately, with the relative transformation between the cameras computed from the known extrinsics. Möller et al. (2016) combine a stereo camera system with a laser tracker to increase absolute positional accuracy of a milling robot. The system relies on retroreflective markers on the robot tool to facilitate pose estimation. Finally, there exist approaches that greatly differ from the standard ones due to precise management of a custom geometric setup. An example is a custom calibration method based on the geometric constraints of the imaging setup, such as parallelism of the image planes and the calibration/measurement plane (Ramírez-Hernández et al., 2020).

When using the traditional planar calibration method, given enough images of the calibration target in different orientation, one can obtain sufficient calibration results. However, these results are slightly different depending on the actual input image set. Such property is known to planar-based calibration methods, and can be attributed to degenerate configuration due to many planes with similar orientation (Zhang, 2000). To make the calibration results better, a number of heuristics exist, such as the following: the view of the planar calibration target shall not be parallel in two or more images; for better estimation of the camera distortion, the calibration target shall appear in all four corners of the image and cover as much exterior orientations as possible; the best results would be obtained providing more than 10 calibration object views and orientation angle near 45° (Zhang, 2000; Steger, Ulrich & Wiedemann, 2007).

Since the plane-based calibration is usually performed manually by rotating a calibration target in front of one or more cameras, it may be tricky to precisely account for all the abovementioned heuristics. A sensible alternative can be to gather a relatively large set of images (or image pairs in the case of a stereo system) and evaluate how different subsets of the images work as an input to the standard calibration procedures. This approach has been investigated in a previous work by the author (Semeniuta, 2016), with an observation that the calibration parameters in a general form can be described by Gaussian distributions if numerous calibration runs with different subsets are invoked. However, it is challenging to select an optimal sample from such distribution if only one camera is used. It is worth noting that the original paper describing the plane-based method for calibrating a single camera (Zhang, 2000) also applied a similar approach, namely selecting subsets of four images out of five, when analyzing variability of calibration results.

The general approach in geometric computer vision is to formulate an estimation problem as a linear model, which can be solved in a closed form, and then apply iterative optimization to further refine the sought parameters given a nonlinear cost function that is closer to the reality (Hartley & Zisserman, 2004). Such cost function has to be differentiable to apply gradient-based optimization methods. In the case of camera and stereo calibration, this cost function models the reprojection error: given the known real-world coordinates, how close their transformed values will be to the known coordinates of the corresponding image features? This cost function is well-suited for estimation of camera intrinsic parameters and relative pose of two cameras in a stereo system, however, it operates on a totally different domain than what one is interested during stereo reconstruction (image plane vs metric ${\mathbb{R}}^3$).

This paper proposes a subset-based stereo calibration method that performs a number of calibration runs on randomly selected subsets from the global set of image pairs and evaluates the quality of a calibration run by performing stereo reconstruction given all the image pairs and analyzing a cascade of metrics based on the reconstructed point clouds. The proposed approach does not aim to replace the well-known planar calibration method, but to conduct the latter in an automated manner according to the set of the proposed rules. As such, a more optimal calibration result can be obtained by automatic analysis of the set of individual calibration runs.

This paper applies the proposed method to a set of experimentally collected pairs of images acquired with a stereo rig. The analysis shows that in approximately half of the calibration runs, the performance is unsatisfactory. For the rest of the runs, one can rank them in the order of how well they perform, and hence, select the best-performing one. In addition to the analysis of the raw metric data obtained based on the triangulation results, principal component analysis (PCA) is performed on the vectors of metrics per each calibration run to transform the data into two components. PCA, along with k-means clustering, highlight the clear separation of the satisfactory and unsatisfactory classes and demonstrate the efficacy of the ranking.

The paper is organized as follows. First, a detailed overview of mathematical preliminaries of camera and stereo calibration is presented, followed with the specifics of OpenCV functionality and how it was harnessed in the presented work. Further, the proposed method is formulated, followed with its experimental validation and outlook for further research activities.

Camera and Stereo Calibration

Geometric computer vision deals with estimating geometric properties of the scene being imaged, parameters of camera models, multiple-view geometry, and related aspects of computer vision (Hartley & Zisserman, 2004). Models for these tasks are normally expressed in linear form by operating with homogeneous vectors on the projective space. The latter constitutes an extension of the Euclidean space with points at infinity. Taking an example of Euclidean 2-space ( ${\mathbb{R}}^2$), a point $(x,y{)}^T\in {\mathbb{R}}^2$ is represented in projective 2-space ${\mathbb{P}}^2$ as an equivalence class of coordinate triples (kx, ky, k)^T, where k ≠ 0. Such triple is referred to as a homogeneous vector. A set of homogeneous vectors {(x, y, 0)^T} correspond to points at infinity, each characterized by ratio x : y. A homogeneous vector (0, 0, 0)^T is not an element of ${\mathbb{P}}^2$.

For camera calibration and 3D reconstruction, the pinhole camera model, the distortion model, and the epipolar geometry are used as a basis. The pinhole camera model deals with two coordinate frames (see Fig. 1): camera coordinate frame {C} with axes (x_c, y_c, z_c), located in the optical center, with z_c perpendicular to the image plane, and the image (sensor) coordinate frame {S} with axes (x_s, y_s), located in the top left corner of the image plane with x_s and y_s representing pixel columns and rows respectively.

The process of projection of points in the world coordinate frame {W} to image pixels in {S} using the pinhole model (expressed in the projective spaces ${\mathbb{P}}^3$ and ${\mathbb{P}}^2$ respectively) is referred to as a perspective projection model. The latter is a linear mapping (x_w, y_w, z_w, 1)^T $\mapsto$ (λx_s, λy_s, λ)^T that can be expressed in the matrix form as follows:

(1)

Or, for short:

(2)

where K is a camera matrix, which embodies such intrinsic parameters as the camera center (c_x, x_y) and the focal lengths (f_x, f_y), and ^cT_w ∈ SE(3) corresponds to a homogeneous transformation expressing coordinate frame {W} in terms of coordinate frame {C}.

The distortion model $L:{\mathbb{R}}^2\to {\mathbb{R}}^2$ describes a non-linear mapping from an "as-if perfectly imaged" image coordinate (x, y)^T to the displaced image coordinate (x*, y*)^T distorted by lens. One is normally interested in the inverse function L⁻¹ modeling the undistortion process, which is is characterized by radial distortion coefficients (k₁, k₂, k₃) and tangential distortion coefficients (p₁, p₂):

(3)

where r is the radial distance of point (x*, y*)^T.

Let $Ca{m}_{\mathbf{p},\xi }:{\mathbb{P}}^3\to {\mathbb{R}}^2$ be a full camera model that embodies both perspective projection and non-linear distortion effect. Cam_{p, ξ} is parameterized by intrinsic parameters p = (f_x, f_y, c_x, c_y, k₁, k₂, k₃, p₁, p₂)^T and extrinsic parameters describing the pose ξ of {W} with respect to {C}, typically described with a homogeneous transformation ^cT_w. Cam_p,ξ first performs linear transformation described in Eq. (2), followed by lens-induced distortion of the projected point (x_s, y_s):

(4)

The goal of camera calibration is to estimate camera intrinsic parameters—(f_x, f_y, c_x, c_y) embodied in the camera matrix K (2), as well as parameters (k₁, k₂, k₃, p₁, p₂) of the non-linear distortion model (3).

The general principle of camera calibration lies in finding the correspondence between a sufficiently large number of known 3D points and their projections in the image (Steger, Ulrich & Wiedemann, 2007). The known points are provided by the calibration object containing features that have known coordinates and are easily identifiable by image processing algorithms. As described by Zhang (2004), a calibration object may be different depending on one of the respective calibration techniques: (1) a precisely manufactured 3D object (typically, consisting of three perpendicular planes) (Tsai, 1987; Heikkila, 2000), (2) a planar object (Zhang, 2000; Sturm & Maybank, 1999), or (3) three or more collinear points (string of balls) (Zhang, 2004). Because manufacturing of a custom 3D object is costly, planar objects make calibration process more flexible, and are widely used in practice.

The camera takes k images of the planar calibration object from different views. For each view i, a homography matrix H_i is computed based on two sets of points: (1) real-world coordinates of the target points in the world coordinate frame, and (2) their projected pixel values determined with the appropriate feature detection technique. A system of homogeneous equations Ax = 0 is formed from the homography matrices {H_i} and the constraints imposed by the orthonormality of the rotation vectors, and solved in closed form to determine the initial values for the the parameters embodied in the camera matrix K. The latter is derived from x, the extrinsic parameters for each view ^cT_wi are computed given H_i and K.

Given the initial values of K and the set of poses for each view {^cT_wi}, the values of all intrinsic parameters p = (f_x, f_y, c_x, c_y, k₁, k₂, k₃, p₁, p₂)^T are refined by non-linear estimation minimizing the reprojection error.

The reprojection error is defined as follows. Let m be the number of features used for calibration. Set $W=\{{\mathbf{x}}_{\mathbf{i}}\in {\mathbb{P}}^3,i=1,...m\}$ contains known coordinates of the points in the coordinate frame of the calibration object. Set $S={\{}^S{\mathbf{x}}_{\mathbf{i}}\in {\mathbb{R}}^2,i=1,...m\}$ contains the corresponding coordinates of image features. ^Sx_i, has 2 degrees of freedom, which are the column and the row coordinate of a point in the image: ^Sx_i = (x_i, y_i)^T. A known 3D point x_i is reprojected to the image as follows:

(5)

The misfit function f_rp maps p to ${\mathbb{R}}^{2m}$, as for each feature point, two difference values are obtained:

(6)

Given f_rp, the reprojection error constitutes a root mean square cost function:

(7)

In the OpenCV implementation, distortion coefficients are computed using the method proposed by Brown (1971), and, based on them, K is reestimated (Bradski & Kaehler, 2008).

Calibration of stereo vision system is based on epipolar geometry (see Fig. 2), where a 3D point is imaged in two cameras, with the corresponding projections obeying a set of geometric constraints. The latter can be expressed in term of essential matrix E and fundamental matrix F. The fundamental matrix constrains two corresponding points in the image coordinates x₁ and x₂ by the following relation:

(8)

A similar relation holds for points expressed in normalized coordinates ${\stackrel{\mathbf{~}}{\mathbf{x}}}_1$ and ${\stackrel{\mathbf{~}}{\mathbf{x}}}_2$, i.e. assuming camera matrices K₁ and K₂ are unit matrices:

(9)

The essential matrix encodes the relative rotation Ω and translation t between the cameras:

(10)

Hence, the rotation and translation can be decomposed from E once it is estimated from the point correspondences. In the complete stereo calibration pipeline, the fundamental matrix F is first estimated given the original image points. Further, the essential matrix is obtained given the previously estimated camera matrices:

(11)

The relative rotation Ω and translation t of the second camera expressed in terms of the first one, decomposed from E, are used as a basis, together with the intrinsic parameters of the cameras, to triangulate pairs of corresponding image points.

Implementation Specifics

All the work underlying this paper has been implemented on top of the basic calibration routines in the OpenCV library using the Python API. As such, the implementation specifics presented in this section, refer to specific OpenCV functions as defined in the API. The goal of this section to present the workflow of the chessboard corners preparation, camera and stereo calibration, and stereo triangulation in as transparent way as possible.

In OpenCV, the stereo calibration pipeline starts with the camera calibration process for the two cameras, followed by the stereo calibration process, the results of which are fed to the computation of rectification transform. The latter step is important, since both dense and sparse stereo require that the input image points are undistorted and rectified.

The core parameters estimated during camera and stereo calibration are the following:

1. Camera matrix K₁ and a vector of distortion coefficients d₁ for the first camera.

2. Camera matrix K₂ and a vector of distortion coefficients d₂ for the second camera.

3. Relative rotation Ω and translation t of the second camera expressed in terms of the first camera.

4. Rotation matrices R₁ and R₂ describing the rectification transforms of the two cameras.

5. Projection matrices P₁ and P₂ in the rectified coordinate systems.

All the listed key parameters are used to perform undistortion and rectification of two sets of image points. After this, P₁ and P₂ are used to perform triangulation.

Below, the logic of corners preparation and stereo calibration is modeled in terms of EPypes (Semeniuta & Falkman, 2019) directed acyclic graphs. The image processing logic is arranged as an executable direct acyclic bipartite graph G:

where F is a set of functions, T is a set of data tokens, and E is a set of directed edges between functions and tokens and vice-versa. A function f ∈ F is associated with a Python callable. A token t ∈ T represents a data object of an arbitrary type. The tokens highlighted in gray represent fixed values that parameterize the algorithms. The source tokens that are not fixed represent inputs to the algorithm.

The graph in Fig. 3 models the stereo calibration process. Functions calibrate_camera_1 and calibrate_camera_2 encapsulate the cv2.calibrateCamera function, performing calibration of each individual camera in the stereo rig. Similarly, calibrate_stereo encapsulates cv2.stereoCalibrate, estimating the transformation between the two cameras, and compute_rectification_transforms encapsulates cv2.stereoRectify, computing the transformations that undistorts and align a pair of images so that a feature detected by the first camera appears in the second image in the same row.

The graph in Fig. 4 processes the collected set of image pairs by attempting to find chessboard corners in both images. Here calibration_images_1 and calibration_images_2 represent two identically-sized lists of images from the first and the second camera respectively. If N is the total number of image pairs, the pairs are indexed as integers in the set P = {0, 1, 2,…, N − 1}. Indices of the pairs where the corners were successfully identified in both images ( $P_{both}\subseteq P$) are retained in the indices token.

Triangulation has to be preceded with undistortion of image points. To perform undistortion (using cv2.undistortPoints) of points detected in an image from camera i ∈ {1, 2}, camera matrix K_i, distortion coefficients d_i, and matrices P_i, and R_i are used.

Proposed Method

For the total set of all available image pairs, identify corners in them and store the corners for further processing. Additionally, store indices of the image pairs that resulted in successful corners detection in both images (see Fig. 4).

Given a set of all image pairs, randomly select a series of m integers S = {s₁,…, s_m}, within the predefined range [s_min, s_max]. The value of s_i corresponds to the size of image subset used for calibration. For each i ∈ {1,…, m}, randomly select s_i image pairs and perform stereo calibration (here it is presumed that all image pairs have been validated to retain only those with successfully identified corners in both images, totaling to n pairs). Store the result of each calibration run i.

The general idea of the proposed method is to utilize the set of all image pairs that capture the calibration object in different orientation as a basis for assessment of stereo triangulation quality. Let i ∈ {1,…, m} denote the index of a calibration set, and let j ∈ {1,…, n} denote the index of an image pair. There exists mn such combinations of calibration results and image pairs.

Given calibration run i and image pair j, triangulate the coordinates of the corner points. As a result of triangulation, a point cloud in ${\mathbb{R}}^3$ is obtained. All the point clouds are stored in a tensor of shape (m × n × n_points × 3). The overall workflow of point clouds’ preparation is presented in Fig. 5.

In this work, the point cloud represents the chessboard corners, and hence, the triangulated points have to be as close to the original chessboard geometry as possible. This includes the distances between the neighboring points and how much the triangulated points resemble a plane. Given a point cloud as n_points points in ${\mathbb{R}}^3$, a point cloud metric function maps these point to a single value in $\mathbb{R}$. Given the properties imposed by the chessboard geometry, namely coplanarity and equal distances between the neighboring points, two such metrics are defined:

1. Function J_MDIR measures the mean distances of neighboring points in rows. It should ideally be close to the nominal square size.

2. Function J_PDRMS measures plane difference RMS error: given the points in ${\mathbb{R}}^3$, fit a plane to them, and calculate the RMS error of the points with respect to the plane. In the ideal case, the overall error should be close to zero, showing the evidence of a good plane reconstruction.

A calibration run i ∈ {1,…, m} is associated with n point clouds obtained with triangulation of the respective image pairs. For each of these point clouds, the metric functions J_MDIR and J_PDRMS are computed. Let d_ij denote the value of J_MDIR for image pair j given calibration i and d denote the nominal value of the square size. Given a tolerance value $\delta \in {\mathbb{R}}^{+}$, the following relation indicates an acceptable triangulation result, namely the one that is not an outlier:

(12)

Let p_ij denote the value of J_PDRMS for image pair j given calibration i and p_max denote the maximal value of J_PDRMS that separates inliers and outliers.

For each combination of a set of calibration parameters (i) and image pair (j), an indicator variable g_ij ∈ {0, 1} is defined as follows:

(13)

The number of acceptable triangulation results a_i per calibration run is thus defined as follows:

(14)

Based of the values of g_ij, which serve a role of a mask for the cases with acceptable triangulation, vectors d_i and p_i are defined. They contain the values of the triangulation metrics J_MDIR and J_PDRMS respectively only for those (i, j) that are characterized by g_ij = 1.

To assess the calibration performance based on triangulation, a number of metrics is proposed (for a calibration run i), which are defined below.

1. The number of image pairs that resulted in an acceptable triangulation result, namely a_i.

2. Mean and standard deviation of the J_MDIR scalar triangulation assessment metric for such (i, j) that are masked by the condition of g_ij = 1:

(15)

(16)

3. Number of image pairs $h_0^{(i)}$ that fell into the first histogram bin (the one closest to zero) of the distribution of errors from the nominal scalar triangulation assessment metric. The histogram is constructed as follows. A vector e of absolute errors is computed given the vector d_i:

(17)

A value $\mathrm{\Delta }\in {\mathbb{R}}^{+}$ is defined, and the range [0, Δ] is split into 10 bins, with the first bin corresponding to the range of [0, Δ/10). The values in e_i are distributed across the defined 10 bins, with those ε_ij ≥ δ falling into the eleventh bin. As such, if for example Δ = 1 mm, the number of image pairs that fall into the first bin indicate how many of those resulted in the value of 0 ≤ |d_ij − d| ≤ 0.1 mm. If this number is bigger for a calibration i, it is indicative of a more optimal triangulation.

4. Maximal absolute error from the nominal scalar triangulation assessment metric:

(18)

Furthermore, all calibration runs are ranked from the best-performing to the worst-performing based on the associated values of the metrics defined above. The ranking logic proposed in this paper is as follows: sort the calibration runs first by the values of $h_0^{(i)}$ (in decreasing order) and then by the values of ε_i (in increasing order). Then, pick the calibration results associated with the calibration run of rank 1 as the final results.

The overall workflow of metrics computation is presented in Fig. 6.

The proposed method has been implemented as an open-source Python library, dubbed vcalib, based on OpenCV¹ .

Experimental Validation

Experimental results

Given the collected set of n = 264 image pairs and the method described above, m = 200 calibration runs were invoked with the size of the randomly selected input subset varying between s_min = 15 and s_max = 30 image pairs. The resulting calibration parameters were used for triangulation using all images, and the results were collected in a tensor of dimension 200 × 264 × 63 × 3. The dimension of the latter two components correspond to the number of chessboard points in ${\mathbb{R}}^3$ (n_points = 9 × 7 = 63).

Given the triangulation results, outliers were excluded. An outlier is defined as a calibration run/image pair combination for which either of the two following conditions holds true: |J_MDIR − d| ≥ 5 mm (where d is the nominal square size dimension), J_PDRMS ≥ 10 mm (see the definition in Eq. (13)). The result of marking inliers and outliers is shown as a binary mask in Fig. 7. One may observe that certain calibration runs perform consistently well on the most of the image pairs. Similarly, some image pairs result in better triangulation results than the others.

The distributions of the two metric functions operating on the triangulated point clouds are shown in Fig. 8 (J_MDIR) and Fig. 9 (J_PDRMS). The blue vertical lines visualize the ranges of values that are considered as inliers according to Eq. (13). The green vertical lines denote the nominal values of the two metrics. Particularly for the J_MDIR metric it can be seen that the triangulation in most of the cases is rather good, with most of the values tightly centered around the nominal dimension of d = 20 mm. When it comes to the flatness-related metric of J_PDRMS, most of the values are close to zero, but there is a substantial number of cases with higher values of the plane fit RMS error.

Based on the masked combinations of calibration runs and image pairs (as shown in Fig. 7) and the values ofJ_MDIR and J_PDRMS, a set of metrics is computed for each calibration run: mean and standard deviation of the J_MDIR values, μ_i, σ_i, number of acceptable image pairs per calibration run, a_i, values of the histogram bins based on the absolute differences of J_MDIR with the nominal value, $\{h_0,h_1,...,h_{10}{\}}^{(i)}$, number of image pairs used for stereo calibration, s_i, and the mean value of J_PDMRS, p_i. Further in this section, the index i is omitted when referring about the metrics.

The calibration runs are further ranked first by the values of h₀ (in decreasing order) and then by the values of ε (in increasing order). The values of all metrics for the 10 best calibration runs are shown in Table 2. The first row of the table correspond to the best-performing calibration run (rank 1).

Table 2:

Values of the calibration run metrics for five best calibration runs.

i	μ	σ	a	ε	h0	h1	h2	h3	h4	h5	h6	h7	h8	h9	h10	s	p
195	20.090	0.951	257	4.310	158	25	5	6	4	4	4	3	1	4	43	24	0.495
92	20.074	0.969	257	4.492	142	19	17	13	5	4	6	2	1	5	43	25	0.501
154	20.066	0.948	257	4.206	140	23	22	9	4	6	2	2	1	3	45	16	0.541
193	20.157	0.986	257	4.366	134	22	20	14	9	4	2	6	2	2	42	17	0.578
103	20.162	0.981	257	4.671	133	47	7	7	4	4	4	0	2	4	45	27	0.509
163	20.064	0.962	257	4.335	131	24	20	9	12	4	5	3	1	3	45	27	0.492
159	20.061	0.934	257	4.061	128	36	20	8	8	3	4	2	3	2	43	23	0.501
122	20.075	0.964	257	4.369	124	45	14	8	5	5	6	1	1	5	43	15	0.516
51	20.044	0.926	257	4.143	120	32	25	10	13	2	4	3	3	3	42	17	0.504
33	20.046	0.976	258	4.999	112	34	16	17	13	10	4	2	2	4	44	17	0.540

DOI: 10.7717/peerj.11179/table-2

To better motivate the rankings of the calibration runs as shown in Table 2, it is worth to investigate the values of the histogram bins. The first histogram bin h₀ describes the number of image pairs in which the mean value of e_i is closest to zero. The last histogram bin h₁₀ describes the number of image pairs in which the mean value of e_i is beyond the specified top threshold Δ. In the presented analysis, Δ = 1 mm, which corresponds to the range of [0, 0.1) mm for h₀ and [1 mm, ∞) for h₁₀. Figure 10 shows the histograms for the calibration runs of rank 1 (the best), rank 25, rank 50, rank 75, rank 100, and rank 125. It is clear that the selected ranking clearly sorts the alternative calibration runs from the best performing to the worst performing one.

Given the full dataset of metrics per calibration runs, a scatter plot of h₀ against ε is visualized in Fig. 11. The color of each dot represents the value of a for this calibration run. It can be seen that there are clearly two classes of calibration runs, namely those with acceptable calibration results and those with non-satisfactory results, obtained due to degenerate configuration of the input data sets.

Experiment assessment

To highlight the details of the conducted experiment, two visualizations are provided in this section. First, the coverage of the two image planes by chessboard points are shown in Fig. 12. The points plotted in yellow constitute the total set of all chessboard corners. The points plotted in blue correspond to the subset of those contained in the image pairs forming the highest-ranked calibration run.

It can be seen that, overall, most of the respective image planes are covered with points. Because the images were acquired so that the whole calibration plane is fully visible in both cameras, the left side in the left image and the right side in the right image are not covered with points.

Additionally, Fig. 13 shows the distribution of z-translation fo the pose of the calibration object with respect to the left camera. These measurements were conducted based on performing pose estimation (cv2.solvePnP function) of all chessboard views in the left camera image given the highest-ranked calibration run. It can be seen that the operating range of the studied stereo rig is between 0.5 and 1 m.

Accuracy assessment

To reason about accuracy of the proposed method, the following approach is applied. A single image pair is chosen as the benchmark. A suitable candidate for this is the image pair that results in acceptable triangulation results based on most calibration runs. Further, parameters from a number of first n_first ranked calibration runs are used to triangulate the points from the chosen image pair. Distance between each neighboring points in rows (J_MDIR) are measured and collected in an array. Let this array be denoted as a.

For each calibration run, the deviation of the mean of the array a from the nominal value (d = 20 mm) is computed, along with the standard deviation of the values of a. Both of these metrics are desirable to be close to zero. When they are plotted together (in Fig. 14 for n_first = 100), with the calibration runs of ranks 1–20 and 21–40 marked with distinct colors, it may be observed, that on average, the calibration runs of higher ranks (closer to 1) result in triangulation of higher accuracy.

The overall trend can be further validated by comparing the two deviation metrics against groups of 5 consecutive ranked calibration runs. It can be observed in Figs. 15 and 16 that the deviations on average increase with decreasing the rank of the calibration runs (moving away from rank 1).

Principal component analysis

To take into account all the metrics per calibration run, principal component analysis is performed. It takes the dataset as shown in Table 2 and maps the 17 features to the two dimensional plane that preserves most of the original variability in data. As such, this step integrates all the measurements yet allowing to visualize the dataset in two dimensions. As it can be seen in Fig. 17A, the PCA-transformed data clearly forms two distinct clusters. The green/red labeling in Fig. 17A has been automatically performed using k-means clustering with the PCA-transformed data as an input. The same data colored by the corresponding values of the h₀/h₁₀ ratio is presented in Fig. 17B. One can observe that class 0 (corresponding to the degenerate configurations) is associated with uniformly low values of the h₀/h₁₀ ratio, while class 1 (configurations with acceptable calibration results) vary in the range of the defined ratio, with some of them clearly better than the others.

Conclusion and Further Work

This paper has presented an approach for calibration of stereo vision setup that utilizes the standard technique for plane-based calibration, along with its OpenCV-based implementation, but with a novel technique for systematic selection of the optimal subset of image pairs leading to the best triangulation performance. The proposed approach is based on two computation stages, the first being the triangulation of points in the image pairs, and the second being the evaluation of the point cloud metrics for each calibration run by preparation and analysis of metric vectors.

The merit of the proposed method is that it goes beyond the traditional performance characteristic of reprojection error, and instead evaluates the performance of stereo triangulation given the estimated intrinsic, extrinsic and stereo rig parameters. This allows for devising metrics that directly evaluate the intended application of a stereo vision system. At the same time, the approach is self-contained in a sense that no additional data collection is made, and the existing pool of image pairs is used as a basis of performance evaluation. This aspect also allows for performing the calibration process in a highly automated manner, with preserving a transparency of the underlying processing steps and the associated computation results.

The proposed method is validated on a dataset comprised of image pairs of a chessboard calibration pattern gathered with two identical Prosilica GC1350 cameras. The computed metrics and the associated ranking of calibration runs allowed selection of the best-performing result of stereo calibration. Furthermore, because the latter stage of the analysis pipeline results in a dataset similar to those dealt with in unsupervised machine learning, namely a set of feature vectors per calibration run (see Table 2), principal component analysis with subsequent k-means clustering was performed to further highlight the nature of the distribution of the stereo reconstruction performance.

For the further work, it is beneficial to evaluate the proposed method with a concrete stereo vision application use case. In addition to a broader validation of the method, this will allow for uncovering additional application-specific metrics that may be useful in achieving more optimal system calibration.