Comparison of Stereo Matching Algorithms for the Development of Disparity Map

• URL: http://arxiv.org/abs/2210.15926v1
• Date: Fri, 28 Oct 2022 06:14:14 GMT
• Title: Comparison of Stereo Matching Algorithms for the Development of Disparity Map
• Authors: Hamid Fsian, Vahid Mohammadi, Pierre Gouton, Saeid Minaei
• Abstract summary: This paper presents a comparative study of six different stereo matching algorithms. Three cost functions namely Mean Squared Error (MSE), Sum of Absolute Differences (SAD), Normalized Cross-Correlation (NCC) were used and compared. Results showed that the BP algorithm in most cases provided better results getting accuracies over 95%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Stereo Matching is one of the classical problems in computer vision for the extraction of 3D information but still controversial for accuracy and processing costs. The use of matching techniques and cost functions is crucial in the development of the disparity map. This paper presents a comparative study of six different stereo matching algorithms including Block Matching (BM), Block Matching with Dynamic Programming (BMDP), Belief Propagation (BP), Gradient Feature Matching (GF), Histogram of Oriented Gradient (HOG), and the proposed method. Also three cost functions namely Mean Squared Error (MSE), Sum of Absolute Differences (SAD), Normalized Cross-Correlation (NCC) were used and compared. The stereo images used in this study were from the Middlebury Stereo Datasets provided with perfect and imperfect calibrations. Results show that the selection of matching function is quite important and also depends on the images properties. Results showed that the BP algorithm in most cases provided better results getting accuracies over 95%.

Related papers

• Uncertainty Guided Adaptive Warping for Robust and Efficient Stereo Matching [77.133400999703]
  Correlation based stereo matching has achieved outstanding performance. Current methods with a fixed model do not work uniformly well across various datasets. This paper proposes a new perspective to dynamically calculate correlation for robust stereo matching.
  arXiv  Detail & Related papers  (2023-07-26T09:47:37Z)
• Explicit Correspondence Matching for Generalizable Neural Radiance Fields [49.49773108695526]
  We present a new NeRF method that is able to generalize to new unseen scenarios and perform novel view synthesis with as few as two source views. The explicit correspondence matching is quantified with the cosine similarity between image features sampled at the 2D projections of a 3D point on different views. Our method achieves state-of-the-art results on different evaluation settings, with the experiments showing a strong correlation between our learned cosine feature similarity and volume density.
  arXiv  Detail & Related papers  (2023-04-24T17:46:01Z)
• Robust and accurate depth estimation by fusing LiDAR and Stereo [8.85338187686374]
  We propose a precision and robust method for fusing the LiDAR and stereo cameras. This method fully combines the advantages of the LiDAR and stereo camera. We evaluate the proposed pipeline on the KITTI benchmark.
  arXiv  Detail & Related papers  (2022-07-13T11:55:15Z)
• Sub-Image Histogram Equalization using Coot Optimization Algorithm for Segmentation and Parameter Selection [0.0]
  Mean and variance based sub-image histogram equalization (MVSIHE) algorithm is one of these contrast enhancements methods proposed in the literature. In this study, we employed one of the most recent optimization algorithms, namely, coot optimization algorithm (COA) for selecting appropriate parameters for the MVSIHE algorithm. The results show that the proposed method can be used in the field of biomedical image processing.
  arXiv  Detail & Related papers  (2022-05-31T06:51:45Z)
• Fair Feature Subset Selection using Multiobjective Genetic Algorithm [0.0]
  We present a feature subset selection approach that improves both fairness and accuracy objectives. We use statistical disparity as a fairness metric and F1-Score as a metric for model performance. Our experiments on the most commonly used fairness benchmark datasets show that using the evolutionary algorithm we can effectively explore the trade-off between fairness and accuracy.
  arXiv  Detail & Related papers  (2022-04-30T22:51:19Z)
• Stereo Matching Based on Visual Sensitive Information [0.8602553195689513]
  A stereo matching algorithm based on visual sensitive information is proposed by using standard images from Middlebury dataset. The experimental results show that the proposed algorithm can effectively enhance the stereo matching effect of the image.
  arXiv  Detail & Related papers  (2021-05-23T00:20:32Z)
• SMD-Nets: Stereo Mixture Density Networks [68.56947049719936]
  We propose Stereo Mixture Density Networks (SMD-Nets), a simple yet effective learning framework compatible with a wide class of 2D and 3D architectures. Specifically, we exploit bimodal mixture densities as output representation and show that this allows for sharp and precise disparity estimates near discontinuities. We carry out comprehensive experiments on a new high-resolution and highly realistic synthetic stereo dataset, consisting of stereo pairs at 8Mpx resolution, as well as on real-world stereo datasets.
  arXiv  Detail & Related papers  (2021-04-08T16:15:46Z)
• Fusion of Range and Stereo Data for High-Resolution Scene-Modeling [20.824550995195057]
  This paper addresses the problem of range-stereo fusion, for the construction of high-resolution depth maps. We combine low-resolution depth data with high-resolution stereo data, in a maximum a posteriori (MAP) formulation. The accuracy of the method is not compromised, owing to three properties of the data-term in the energy function.
  arXiv  Detail & Related papers  (2020-12-12T09:37:42Z)
• Displacement-Invariant Cost Computation for Efficient Stereo Matching [122.94051630000934]
  Deep learning methods have dominated stereo matching leaderboards by yielding unprecedented disparity accuracy. But their inference time is typically slow, on the order of seconds for a pair of 540p images. We propose a emphdisplacement-invariant cost module to compute the matching costs without needing a 4D feature volume.
  arXiv  Detail & Related papers  (2020-12-01T23:58:16Z)
• GOCor: Bringing Globally Optimized Correspondence Volumes into Your Neural Network [176.3781969089004]
  Feature correlation layer serves as a key neural network module in computer vision problems that involve dense correspondences between image pairs. We propose GOCor, a fully differentiable dense matching module, acting as a direct replacement to the feature correlation layer. Our approach significantly outperforms the feature correlation layer for the tasks of geometric matching, optical flow, and dense semantic matching.
  arXiv  Detail & Related papers  (2020-09-16T17:33:01Z)
• Data Augmentation for Histopathological Images Based on Gaussian-Laplacian Pyramid Blending [59.91656519028334]
  Data imbalance is a major problem that affects several machine learning (ML) algorithms. In this paper, we propose a novel approach capable of not only augmenting HI dataset but also distributing the inter-patient variability. Experimental results on the BreakHis dataset have shown promising gains vis-a-vis the majority of DA techniques presented in the literature.
  arXiv  Detail & Related papers  (2020-01-31T22:02:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.