A hybrid algorithm for disparity calculation from sparse disparity estimates based on stereo vision

• URL: http://arxiv.org/abs/2001.06967v1
• Date: Mon, 20 Jan 2020 04:33:28 GMT
• Title: A hybrid algorithm for disparity calculation from sparse disparity estimates based on stereo vision
• Authors: Subhayan Mukherjee and Ram Mohana Reddy Guddeti
• Abstract summary: We have proposed a novel method for stereo disparity estimation by combining the existing methods of block based and region based stereo matching. Our method can generate dense disparity maps from disparity measurements of only 18% pixels of either the left or the right image of a stereo image pair.
• Score: 5.647516208808729
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we have proposed a novel method for stereo disparity estimation by combining the existing methods of block based and region based stereo matching. Our method can generate dense disparity maps from disparity measurements of only 18% pixels of either the left or the right image of a stereo image pair. It works by segmenting the lightness values of image pixels using a fast implementation of K-Means clustering. It then refines those segment boundaries by morphological filtering and connected components analysis, thus removing a lot of redundant boundary pixels. This is followed by determining the boundaries' disparities by the SAD cost function. Lastly, we reconstruct the entire disparity map of the scene from the boundaries' disparities through disparity propagation along the scan lines and disparity prediction of regions of uncertainty by considering disparities of the neighboring regions. Experimental results on the Middlebury stereo vision dataset demonstrate that the proposed method outperforms traditional disparity determination methods like SAD and NCC by up to 30% and achieves an improvement of 2.6% when compared to a recent approach based on absolute difference (AD) cost function for disparity calculations [1].

Related papers

• Integrating Disparity Confidence Estimation into Relative Depth Prior-Guided Unsupervised Stereo Matching [55.784713740698365]
  Unsupervised stereo matching has garnered significant attention for its independence from costly disparity annotations.<n>A feasible solution lies in transferring 3D geometric knowledge from a relative depth map to the stereo matching networks.<n>This work proposes a novel unsupervised learning framework to address these challenges.
  arXiv  Detail & Related papers  (2025-08-02T09:11:05Z)
• Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation [57.10353686244835]
  We address the problem of verifying neural networks against geometric transformations of the input image, including rotation, scaling, shearing, and translation. The proposed method computes provably sound piecewise linear constraints for the pixel values by using sampling and linear approximations in combination with branch-and-bound Lipschitz. We show that our proposed implementation resolves up to 32% more verification cases than present approaches.
  arXiv  Detail & Related papers  (2024-08-23T15:02:09Z)
• Stereo Risk: A Continuous Modeling Approach to Stereo Matching [110.22344879336043]
  We introduce Stereo Risk, a new deep-learning approach to solve the classical stereo-matching problem in computer vision. We demonstrate that Stereo Risk enhances stereo-matching performance for deep networks, particularly for disparities with multi-modal probability distributions. A comprehensive analysis demonstrates our method's theoretical soundness and superior performance over the state-of-the-art methods across various benchmark datasets.
  arXiv  Detail & Related papers  (2024-07-03T14:30:47Z)
• Boosting Few-shot Fine-grained Recognition with Background Suppression and Foreground Alignment [53.401889855278704]
  Few-shot fine-grained recognition (FS-FGR) aims to recognize novel fine-grained categories with the help of limited available samples. We propose a two-stage background suppression and foreground alignment framework, which is composed of a background activation suppression (BAS) module, a foreground object alignment (FOA) module, and a local to local (L2L) similarity metric. Experiments conducted on multiple popular fine-grained benchmarks demonstrate that our method outperforms the existing state-of-the-art by a large margin.
  arXiv  Detail & Related papers  (2022-10-04T07:54:40Z)
• Stereo Matching with Cost Volume based Sparse Disparity Propagation [27.74131924190943]
  We propose a simple yet novel scheme to improve general stereo matching based on matching cost volume and sparse matching feature points. Our scheme achieves promising performance comparable to state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-28T05:20:41Z)
• A Novel Factor Graph-Based Optimization Technique for Stereo Correspondence Estimation [0.0]
  We present a new factor graph-based probabilistic graphical model for disparity estimation. The new factor graph-based method provided disparity estimates with higher accuracy when compared to the recent non-learning- and learning-based disparity estimation algorithms.
  arXiv  Detail & Related papers  (2021-09-22T23:30:33Z)
• Object Disparity [0.0]
  This paper proposes a different approach for solving a 3D object distance detection by detecting object disparity directly without going through a dense pixel disparity. An example squeezenet Object Disparity-SSD was constructed to demonstrate an efficient object disparity detection with comparable accuracy compared with Kitti dataset pixel disparity ground truth.
  arXiv  Detail & Related papers  (2021-08-18T02:11:28Z)
• Bayesian dense inverse searching algorithm for real-time stereo matching in minimally invasive surgery [1.2074552857379273]
  This paper reports a CPU-level real-time stereo matching method for surgical images (10 Hz on 640 * 480 image with a single core of i5-9400) The proposed method is built on the fast ''dense inverse searching'' algorithm, which estimates the disparity of the stereo images. Experiments indicate that the estimated depth has higher accuracy and fewer outliers than the baseline methods in the surgical scenario.
  arXiv  Detail & Related papers  (2021-06-14T02:26:27Z)
• Image Splicing Detection, Localization and Attribution via JPEG Primary Quantization Matrix Estimation and Clustering [49.75353434786065]
  Detection of inconsistencies of double JPEG artefacts across different image regions is often used to detect local image manipulations. We propose an end-to-end system that can also distinguish regions coming from different donor images.
  arXiv  Detail & Related papers  (2021-02-02T11:21:49Z)
• Contrastive Rendering for Ultrasound Image Segmentation [59.23915581079123]
  The lack of sharp boundaries in US images remains an inherent challenge for segmentation. We propose a novel and effective framework to improve boundary estimation in US images. Our proposed method outperforms state-of-the-art methods and has the potential to be used in clinical practice.
  arXiv  Detail & Related papers  (2020-10-10T07:14:03Z)
• Multi-Margin based Decorrelation Learning for Heterogeneous Face Recognition [90.26023388850771]
  This paper presents a deep neural network approach to extract decorrelation representations in a hyperspherical space for cross-domain face images. The proposed framework can be divided into two components: heterogeneous representation network and decorrelation representation learning. Experimental results on two challenging heterogeneous face databases show that our approach achieves superior performance on both verification and recognition tasks.
  arXiv  Detail & Related papers  (2020-05-25T07:01:12Z)
• Depth-Based Selective Blurring in Stereo Images Using Accelerated Framework [5.647516208808729]
  We propose a hybrid method for stereo disparity estimation by combining block and region-based stereo matching approaches. It generates dense depth maps from disparity measurements of only 18 % image pixels. Our method is highly parallelizable using CPU and GPU framework based on Java Thread Pool and APARAPI with speed-up of 5.8 for 250 stereo video frames.
  arXiv  Detail & Related papers  (2020-01-21T23:26:39Z)

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.