For the purpose of reliable stereo image matching, this paper discusses a novel propagation strategy of image matching under the dynamic triangle constraint. Firstly, the construction and the dynamic updating method for the corresponding triangulations on the stereo pairs are introduced, which are used as both constraints and carriers during the matching propagation. Then, three propagation str...

Stereo vision is a challenging problem and it is a wide research topic in computer vision. It has got a lot of attraction because it is a cost efficient way in place of using costly sensors. Stereo vision has found a great importance in many fields and applications in today’s world. Some of the applications include robotics, 3-D scanning, 3-D reconstruction, driver assistance systems, forensics...

This work, conceptually envisaged by Prof. R. B. Fisher, undertook the augmentation of one of the original approaches in the dense stereo eld by Cox et al. [1]. The aim was to introduce explicit vertical constraint into the Cox algorithm and reduce the streaking and speckling noise e ects commonly associated with stereo results from this approach. These e ects are commonly attributed to the lac...

In order to recover 3D-information from stereo image pairs, a number of stereo matching methods are available. These methods mainly differ in various tokens which are applied to solve the correspondence problem between left and right image. In most of the line segment based stereo matching algorithms, geometrical and structural information is used to estimate the correspondence. Unfortunately t...

This study addresses the problem of finding correspondences for wide baseline stereo. Texture has traditionally been utilised as a single-image cue for 3D shape reconstruction (shape-from-texture); at the same time, its role in multiview scene reconstruction has been very limited. In stereo image matching, repetitive patterns are usually considered as disturbing factor since they tend to produc...

We propose a new method to address the problem of stereo matching under varying illumination conditions. First, a spatially varying multiplicative model is developed to account for photometric changes induced between both images in the stereo pair. The stereo matching problem based on this model is then formulated as a constrained optimization problem in which an appropriate convex objective fu...

In this work, we propose a wavelet-based hierarchical approach using mutual information (MI) to solve the correspondence problem in stereo vision. The correspondence problem involves identifying corresponding pixels between images of a given stereo pair. This results in a disparity map which is required to extract depth information of the relevant scene. Until recently, mostly correlation-based...

3D city modelling from airborne imagery includes mainly two parts: (1) image processing procedures and (2) 3D modelling for manmade objects such as buildings, roads and other objects. Line extraction and stereo matching are usually utilized as an image processing procedures. However, there are some issues for automatic man-made object modelling. In particular, spatial data acquisition of buildi...

by far, many stereo-matching techniques have been successfully proposed and applied in digital aerial photogrammetry. however, due to some problems such as large parallaxes, occlusions, geometric deformations, and repetitive patterns in convergent close range images, these methods may not be applicable to the same level of success as that of aerial imagery. in order to overcome these shortcomin...

Stereo matching and visual hull are techniques that are often used in 3D reconstruction. This paper presents and evaluates implementations of these algorithms on the GPU using the CUDA architecture. Experimental results show that both, visual hull and stereo matching, have much to gain in terms of speed from the data parallel execution model.