26 June 2017 Stereo matching using neighboring system constructed with MST
Author Affiliations +
Stereo matching is a hot topic in computer vision, while stereo matching in large textureless regions and slanted planes are still challenging problems. We propose a novel stereo matching algorithm to handle the problems. We novelly utilizes minimum spanning tree (MST) to construct a new superpixel-based neighboring system. The neighboring system is used to improve the matching performance in textureless regions. Then we apply the new neighboring system to the stereo matching problem, which uses the superpixel as the matching primitive. The use of the new neighboring system is efficient and effective. We compare our method with 4 popular methods. Experiments on Middlebury dataset show that our method can achieve good matching results. Especially, our method obtains more accurate disparity in textureless regions while maintaining a comparable performance of matching in slanted planes.
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ran Li, Ran Li, Zhiguo Cao, Zhiguo Cao, Qian Zhang, Qian Zhang, Yang Xiao, Yang Xiao, Ke Xian, Ke Xian, } "Stereo matching using neighboring system constructed with MST", Proc. SPIE 10334, Automated Visual Inspection and Machine Vision II, 103340F (26 June 2017); doi: 10.1117/12.2269385; https://doi.org/10.1117/12.2269385


Adaptive adjacency graphs
Proceedings of SPIE (June 23 1993)
Matching sets of 3D segments
Proceedings of SPIE (September 23 1999)
Occlusion-free next view planning
Proceedings of SPIE (August 06 1993)

Back to Top