Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering

Author(s):  
Ju Yong Chang ◽  
Kyoung Mu Lee ◽  
Sang Uk Lee
2021 ◽  
Vol 13 (10) ◽  
pp. 1903
Author(s):  
Zhihui Li ◽  
Jiaxin Liu ◽  
Yang Yang ◽  
Jing Zhang

Objects in satellite remote sensing image sequences often have large deformations, and the stereo matching of this kind of image is so difficult that the matching rate generally drops. A disparity refinement method is needed to correct and fill the disparity. A method for disparity refinement based on the results of plane segmentation is proposed in this paper. The plane segmentation algorithm includes two steps: Initial segmentation based on mean-shift and alpha-expansion-based energy minimization. According to the results of plane segmentation and fitting, the disparity is refined by filling missed matching regions and removing outliers. The experimental results showed that the proposed plane segmentation method could not only accurately fit the plane in the presence of noise but also approximate the surface by plane combination. After the proposed plane segmentation method was applied to the disparity refinement of remote sensing images, many missed matches were filled, and the elevation errors were reduced. This proved that the proposed algorithm was effective. For difficult evaluations resulting from significant variations in remote sensing images of different satellites, the edge matching rate and the edge matching map are proposed as new stereo matching evaluation and analysis tools. Experiment results showed that they were easy to use, intuitive, and effective.


2021 ◽  
Vol 297 ◽  
pp. 01055
Author(s):  
Mohamed El Ansari ◽  
Ilyas El Jaafari ◽  
Lahcen Koutti

This paper proposes a new edge based stereo matching approach for road applications. The new approach consists in matching the edge points extracted from the input stereo images using temporal constraints. At the current frame, we propose to estimate a disparity range for each image line based on the disparity map of its preceding one. The stereo images are divided into multiple parts according to the estimated disparity ranges. The optimal solution of each part is independently approximated via the state-of-the-art energy minimization approach Graph cuts. The disparity search space at each image part is very small compared to the global one, which improves the results and reduces the execution time. Furthermore, as a similarity criterion between corresponding edge points, we propose a new cost function based on the intensity, the gradient magnitude and gradient orientation. The proposed method has been tested on virtual stereo images, and it has been compared to a recently proposed method and the results are satisfactory.


2014 ◽  
Vol 4 ◽  
pp. 220-251 ◽  
Author(s):  
Vladimir Kolmogorov ◽  
Pascal Monasse ◽  
Pauline Tan

2013 ◽  
Vol 33 (3) ◽  
pp. 0315004 ◽  
Author(s):  
祝世平 Zhu Shiping ◽  
杨柳 Yang Liu

2020 ◽  
Vol 64 (2) ◽  
pp. 20505-1-20505-12
Author(s):  
Hui-Yu Huang ◽  
Zhe-Hao Liu

Abstract A stereo matching algorithm is used to find the best match between a pair of images. To compute the cost of the matching points from the sequence of images, the disparity maps from video streams are estimated. However, the estimated disparity sequences may cause undesirable flickering errors. These errors result in low visibility of the synthesized video and reduce video coding. In order to solve this problem, in this article, the authors propose a spatiotemporal disparity refinement on local stereo matching based on the segmentation strategy. Based on segmentation information, matching point searching, and color similarity, adaptive disparity values to recover the disparity errors in disparity sequences can be obtained. The flickering errors are also effectively removed, and the boundaries of objects are well preserved. The procedures of the proposed approach consist of a segmentation process, matching point searching, and refinement in the temporal and spatial domains. Experimental results verify that the proposed approach can yield a high quantitative evaluation and a high-quality disparity map compared with other methods.


2013 ◽  
Vol 333-335 ◽  
pp. 948-953
Author(s):  
Yi Zhang ◽  
Cheng Liang Huang ◽  
Lian Fa Bai

Stereo matching of the disparity discontinuous boundaries and weak texture regions is still a problem of computer vision. Local-based stereo matching algorithm with the advantages of fast speed and high accuracy is the most common method. In order to improve the matching accuracy of the mentioned regions,a stereo matching algorithm based on edge feature of segmented image is proposed. Firstly, the reference image was segmented by Mean-Shift algorithm. Then, support window was dynamically allocated based on edge feature of segmented image. Finally, the disparity distribution of support window was adjusted by introducing weighting factor. The experimental results show that this algorithm can reduce noise and effectively improve the matching accuracy.


Sign in / Sign up

Export Citation Format

Share Document