Abstract

This paper presents a segmentation-based stereo matching algorithm using an adaptive multi-cost approach, which is exploited for obtaining accuracy disparity maps. The main contribution is to integrate the appealing properties of multi-cost approach into the segmentation-based framework. Firstly, the reference image is segmented by using the mean-shift algorithm. Secondly, the initial disparity of each segment is estimated by an adaptive multi-cost method, which consists of a novel multi-cost function and an adaptive support window cost aggregation strategy. The multi-cost function increases the robustness of the initial raw matching costs calculation and the adaptive window reduces the matching ambiguity effectively. Thirdly, an iterative outlier suppression and disparity plane parameters fitting algorithm is designed to estimate the disparity plane parameters. Lastly, an energy function is formulated in segment domain, and the optimal plane label is approximated by belief propagation. The experimental results with the Middlebury stereo datasets, along with synthesized and real-world stereo images, demonstrate the effectiveness of the proposed approach.

Highlights

  • Stereo matching is one of the most widely studied topics in computer vision

  • The entire algorithm is shown in the block diagram representation in Figure 1, which involves four steps: image segmentation, initial disparity estimation, disparity plane fitting, and disparity plane optimization

  • Step (4): The initial disparity plane parameters of each reliable segment region are estimated through the reliable pixels, and the disparity distance filter described in Equation (21) is utilized to update the reliable pixels

Read more

Summary

Introduction

Stereo matching is one of the most widely studied topics in computer vision. The aim of stereo matching is to estimate the disparity map between two or more images taken from different views for the same scene, and extract the 3D information from the estimated disparity [1]. Most dense stereo algorithms perform the following four steps: (1) initial raw matching cost calculation;. Stentoumis et al proposed a multi-cost approach and obtained excellent results for disparity estimation [7]. The initial disparity is estimated using an adaptive multi-cost approach, which consists of a multi-cost function and an adaptive support window cost aggregation strategy. The adaptive multi-cost approach, which consists of a multi-cost function and an adaptive support window, improves the accuracy of the disparity map. This ensures our algorithm works well with the Middlebury stereo datasets, as well as synthesized and real-world stereo image pairs.

Related Works
Stereo Matching
Image Segmentation
Initial
The Multi-Cost Function
Cost Aggregation
Disparity
Disparity Plane Optimization by Belief Propagation
Experimental Results
Evaluation
12. Performance
13. Results
14. Results
15. Results
Discussion and Conclusions
Full Text
Paper version not known

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 call

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.