Binocular stereoscopic matching method for stereoscopic vision system

The invention discloses a binocular stereoscopic matching method for a stereoscopic vision system. The method comprises the following steps that an initial parallax graph of left and right views is calculated, and a GCP (ground control point) of the graph is obtained; the control region of the GCP of the graph is determined, and in addition, the parallax range of non-shielded points in the control region is estimated; an energy function is constructed for each GCP control region, the minimal value of the energy function is obtained through GC (graph cut), and the credible parallax value of the non-shielded points is obtained; and local information is utilized for the postprocessing of the parallax graph, and the optimized parallax graph is obtained. The GCP of the parallax graph is found, the parallax range of pixel points in the control region is estimated through the GCP, the GC optimization method is utilized for solving the extreme value of the energy function, the reasonable parallax value is distributed for the pixel points of the control region of the GCP, and finally, the local information is utilized for carrying out postprocessing on the parallax graph. The invention provides an algorithm for solving the parallax graph through the GCP via the half-overall optimization, and results with better quality can be obtained.

[1]  Sang Uk Lee,et al.  A dense stereo matching using two-pass dynamic programming with generalized ground control points , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).