Abstract
<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>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Indonesian Journal of Electrical Engineering and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
