Stereo Matching by Filtering-Based Disparity Propagation
نویسندگان
چکیده
منابع مشابه
Stereo Matching by Filtering-Based Disparity Propagation
Stereo matching is essential and fundamental in computer vision tasks. In this paper, a novel stereo matching algorithm based on disparity propagation using edge-aware filtering is proposed. By extracting disparity subsets for reliable points and customizing the cost volume, the initial disparity map is refined through filtering-based disparity propagation. Then, an edge-aware filter with low c...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملReal-Time Stereo Matching using Adaptive Window based Disparity Refinement
In this paper, we propose a real-time stereo matching method based on adaptive window, aiming at the trade-off between accuracy and efficiency in current local stereo matching, Considering that the Census transform has good adaptability to image amplitude distortion, but may introduce matching ambiguities in regions with noise or similar local structures, we combine the Census transform with AD...
متن کاملFast Stereo Matching using Adaptive Window based Disparity Refinement
Aiming at the trade-off between accuracy and efficiency in current local stereo matching, a fast stereo matching method based on adaptive window is proposed. The census transform combined with absolute differences (AD) is used for matching cost initialization. Then an iterative cost aggregation based on exponential step adaptive weight (ESAW) is adopted to improve the parallelism and execution ...
متن کاملDisparity space image based stereo matching using optimal path searching
The current paper proposes a fast stereo matching algorithm based on a pixel-wise matching strategy that can produce a stable and accurate disparity map. Since the differences between a pair of stereo images are only small and such differences are just caused by horizontal shifts in a certain order, matching using a large window is not required within a given search range. Therefore, the curren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2016
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0162939