<p>This article studies the performance of the proposed stereo matchingalgorithm on complex regions. These regions are areas with very limitedinformation for the matching process which are low texture, and depthdiscontinuity regions. In this study, each algorithm uses different matchingcost computation (MCC) techniques, but for cost aggregation (CA), disparityoptimization (DO) and disparity refinement (DR), the technique remains thesame. The MCC areabsolute difference(AD), the combination ofabsolutedifference and gradient matching(AD+GM) andcensus transform(CT).Then, for CA, DO and DR, they areminimum spanning tree(MST),winnertake all(WTA) andbilateral filter(BF), respectively. The results are presentedand discussed in this article. Hence, thru this study the robust method can beestimated at the MCC stage.</p>
Read full abstract