Journal Article10.1109/TCSVT.2012.2223633
Efficient Disparity Estimation Using Hierarchical Bilateral Disparity Structure Based Graph Cut Algorithm With a Foreground Boundary Refinement Mechanism
42
TL;DR: A hierarchical bilateral disparity structure (HBDS) algorithm in which the efficiency of the GC method is improved without any loss in the disparity estimation performance by dividing all the disparity levels within the stereo image hierarchically into a series of bilateral disparity structures of increasing fineness is proposed.
read more
Abstract: The disparity estimation problem is commonly solved using graph cut (GC) methods, in which the disparity assignment problem is transformed to one of minimizing global energy function. Although such an approach yields an accurate disparity map, the computational cost is relatively high. Accordingly, this paper proposes a hierarchical bilateral disparity structure (HBDS) algorithm in which the efficiency of the GC method is improved without any loss in the disparity estimation performance by dividing all the disparity levels within the stereo image hierarchically into a series of bilateral disparity structures of increasing fineness. To address the well-known foreground fattening effect, a disparity refinement process is proposed comprising a fattening foreground region detection procedure followed by a disparity recovery process. The efficiency and accuracy of the HBDS-based GC algorithm are compared with those of the conventional GC method using benchmark stereo images selected from the Middlebury dataset. In addition, the general applicability of the proposed approach is demonstrated using several real-world stereo images.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Literature Survey on Stereo Vision Disparity Map Algorithms
TL;DR: This literature survey presents a method of qualitative measurement that is widely used by researchers in the area of stereo vision disparity mappings and notes the implementation of previous software-based and hardware-based algorithms.
Local Stereo Matching with Improved Matching Cost and Disparity Refinement
TL;DR: A local stereo matching method that employs a new combined cost approach and a secondary disparity refinement mechanism that is the best cost-volume filtering-based local method and validate the proposed method's effectiveness.
72
Depth Map Reconstruction for Underwater Kinect Camera Using Inpainting and Local Image Mode Filtering
Huimin Lu,Yin Zhang,Yujie Li,Quan Zhou,Ryunosuke Tadoh,Tomoki Uemura,Hyoungseop Kim,Seiichi Serikawa +7 more
TL;DR: A Kinect-based underwater depth map estimation method that uses a captured coarse depth map by Kinect with the loss of depth information and a corresponding reconstruction architecture that uses the underwater dual channels prior dehazing model, weighted enhanced image mode filtering, and inpainting to create high-accuracy depth maps.
46
Content-Based Guided Image Filtering, Weighted Semi-Global Optimization, and Efficient Disparity Refinement for Fast and Accurate Disparity Estimation
TL;DR: This paper presents a novel approach, which relies on content-based guided image filtering and weighted semi-global optimization for fast and accurate disparity estimation, that uses a pixel-based cost term that combines gradient, Gabor-Feature, and color information.
Stereo matching algorithm for 3D surface reconstruction based on triangulation principle
Rostam Affendi Hamzah,Haidi Ibrahim,Anwar Hasni Abu Hassan +2 more
- 01 Aug 2016
TL;DR: A new stereo matching algorithm based on local method that utilizes a combination of AD, gradient difference (GM) and census transform (CT) and is robust against the radiometric errors and works well on the low texture regions.
30
References
A threshold selection method from gray level histograms
TL;DR: A nonparametric and unsupervised method ofautomatic threshold selection for picture segmentation is presented, whereby an optimal threshold is selected by the discriminant criterion so as to maximize the separability of the resultant classes in gray levels.
44K
A Computational Approach to Edge Detection
TL;DR: There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale.
29.9K
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
TL;DR: This paper has designed a stand-alone, flexible C++ implementation that enables the evaluation of individual components and that can easily be extended to include new algorithms.
Fast approximate energy minimization via graph cuts
TL;DR: This work presents two algorithms based on graph cuts that efficiently find a local minimum with respect to two types of large moves, namely expansion moves and swap moves that allow important cases of discontinuity preserving energies.
Efficient Graph-Based Image Segmentation
TL;DR: An efficient segmentation algorithm is developed based on a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image and it is shown that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties.