Abstract
The minimum spanning tree stereo matching algorithm only takes one channel of R, G, B channels into account, ignoring the effect of the other two channels on the final edge weight in color image. This paper proposes an improved minimum spanning tree stereo matching algorithm, which calculates the weighted euclidean distance using a three-channel approach, and combines three-channel edge weight. This algorithm has been tested on Tsukuba, Venus, Teddy, Cones image. Simulation results show that the improved algorithm enhances the robustness of edge weight function and the connectivity of minimum spanning tree. It not only improves stereo matching accuracy, but also increases computational speed.
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 callDisclaimer: 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.
