Hybrid-based Dense Stereo Matching
نویسندگان
چکیده
Stereo matching generating accurate and dense disparity maps is an indispensable technique for 3D exploitation of imagery in the fields of Computer vision and Photogrammetry. Although numerous solutions and advances have been proposed in the literature, occlusions, disparity discontinuities, sparse texture, image distortion, and illumination changes still lead to problematic issues and await better treatment. In this paper, a hybrid-based method based on semi-global matching is presented to tackle the challenges on dense stereo matching. To ease the sensitiveness of SGM cost aggregation towards penalty parameters, a formal way to provide proper penalty estimates is proposed. To this end, the study manipulates a shape-adaptive cross-based matching with an edge constraint to generate an initial disparity map for penalty estimation. Image edges, indicating the potential locations of occlusions as well as disparity discontinuities, are approved by the edge drawing algorithm to ensure the local support regions not to cover significant disparity changes. Besides, an additional penalty parameter Pe is imposed onto the energy function of SGM cost aggregation to specifically handle edge pixels. Furthermore, the final disparities of edge pixels are found by weighting both values derived from the SGM cost aggregation and the U-SURF matching, providing more reliable estimates at disparity discontinuity areas. Evaluations on Middlebury stereo benchmarks demonstrate satisfactory performance and reveal the potency of the hybrid-based dense stereo matching method.
منابع مشابه
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...
متن کاملNew Pseudo-CT Generation Approach from Magnetic Resonance Imaging using a Local Texture Descriptor
Background: One of the challenges of PET/MRI combined systems is to derive an attenuation map to correct the PET image. For that, the pseudo-CT image could be used to correct the attenuation. Until now, most existing scientific researches construct this pseudo-CT image using the registration techniques. However, these techniques suffer from the local minima of the non-rigid deformation energy f...
متن کاملTowards a fast and reliable dense matching algorithm
In this paper, we present a dense matching algorithm which utilizes the corner and edge features of images to increase the reliability and to speed up the process of dense matching of two uncalibrated images. The major problem of classical area-based dense matching algorithms is the high computational time resulting from intensive correlation calculations for match candidates. Although some met...
متن کاملEnhanced Stereo Matching Technique using Image Gradient for Improved Search Time
Stereo matching algorithms developed from local area based correspondence matching involve extensive search. This paper presents a stereo matching technique for computation of a dense disparity map by trimming down the search time for the local area based correspondence matching. We use constraints such as epipolar line, limiting the disparity, uniqueness and continuity to obtain an initial den...
متن کاملEvaluation of Stereo Matching Costs on Close Range, Aerial and Satellite Images
In the last years, most dense stereo matching methods use evaluation on the Middlebury stereo vision benchmark datasets. Most recent stereo algorithms were designed to perform well on these close range stereo datasets with relatively small baselines and good radiometric behaviour. In this paper, different matching costs on the Semi-Global Matching algorithm are evaluated and compared using the ...
متن کامل