The minimum spanning tree in stereo vision

2nd Nommensen International Conference on Technology and Engineering

Manik, Efron^1

Department of Mathematics Education, University of HKBP Nommensen, Medan, Indonesia^1

关键词: Belief propagation;    Dissimilarity measures;    Grid graphs;    Image pairs;    Minimum spanning trees;    Segment-based stereo matching;    Self adapting;    Window-based;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/420/1/012115/pdf
DOI  :  10.1088/1757-899X/420/1/012115

来源: IOP

【 摘 要 】

Image can be presented in graph or grid graph. Segmentation is widely used in computer vision. Image segmentation is done in various approaches. One approach to image segmentation is the use of a minimum spanning tree. Almost every method of determining disparity in stereo vision uses image segmentation. The method in this paper is in accordance with the method of Segment-Based Stereo Matching using belief propagation and self-adapting dissimilarity measure with improvements for segmentation, and apply local window-based matching steps. The disparity calculation method built with minimum spanning tree approach is one alternative that can be used to calculate disparity for image pair with simple stereo configuration.