The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Local stereo matching as a main category of stereo methods has been studied for decades. Recently, there appeared some well-performed local stereo methods and these state-of-the art methods show comparable performance in terms of quality and better performance in terms of speed with global methods on the Middlebury datasets. However, previous surveys of stereo matching do not consider disparity refinement...
This paper implements four interpolation methods to modify the adaptive support weight (ASW) algorithm in multiresolution image representation. The disparity values at lower resolution level are used to determine disparity values of undetermined pixels at higher level during the interpolation procedure. The first interpolation method fills an undetermined pixel (a gap) with the averaged disparities...
In this paper we present a new local and multiscale disparity estimation algorithm. Results show that the proposed method can preserve arbitrarily shaped depth discontinuities. Some results obtained from this method are shown as depth maps and synthetic views produced using the estimated disparity maps.
Illumination and color invariance are important problems in computer vision (CV). The Census transform (CT) can resist change of illumination intensity and is widely used for many applications in CV and consumer electronics. However, only grayscale images can be processed in the CT algorithm. In this paper, a new color Census transform (CCT) based on a color invariance model for stereo matching is...
This paper presents a real-time trinocular disparity processor. The core module performs a pairwise segmented window matching for both the center-right and center-left image pair as their scaled down image pairs. The resulting cost functions are combined which results into nine different curves. A hierarchical classifier is presented which selects the most promising disparity value using information...
This paper proposes a line segment method to estimate the depth information from a pair of rectified images. The proposed method can achieve real-time and high quality stereo-matching. We first use a simple edge detection to find out the line segments in the reference image and then calculate the color difference of each line segment from a pair of rectified images. Finally, the minimum difference...
In this paper, we propose a hybrid approach for accurate depth acquisition by using a structured light-based method with a stereo matching. By projecting additional light patterns onto a scene, a structured light-based method works well on a textureless region where a stereo matching shows poor performance. In contrast, the patterns projected onto a rich textured region obstruct in estimating reliable...
In this paper, we propose a stereo matching algorithm with occlusion handling. In order to detect occlusion, we obtain an initial disparity map via optimization based on modified constant-space belief propagation (CSBP). Such a method is advantageous due to its low complexity. The initial disparity maps provide clue for occlusion detection. From such clue, an energy function for occlusion detection...
In this paper, we present a novel propagation-based stereo matching algorithm. Firstly, we select highly reliable depth points (i.e., support points) from both the high-textured areas and the low-textured ones in the rectified images. Then we propagate these support points along adjacent neighboring structure to produce the depths of other points in the image based on the triangulation derived from...
This paper presents a methodology to construct a binary confidence value for every pixel of a depth map. We start by constructing 72 different confidence metrics, including the traditional ones and new metrics based on neighborhood information. Construction of the binary confidence value from these metrics is hence viewed as a two-class classification problem where we evaluated three different classifiers,...
It attracts many researchers' attention to find a stereo matching algorithm both accurate and fast. Yoon and Kweon's Adaptive Support-Weight(ASW) method is supposed to be a very successful algorithm in both accuracy and speed. However, it is very time consuming for ASW to take a large number of pixels into consideration for computing a disparity. In this paper, we present a stereo matching algorithm...
The phenomenon of color discrepancy between image pairs happens frequently in stereo vision systems. This inconsistence in color domain may cause difficulties when identifying point correspondence to reconstruct the scene depth. In this paper, we propose a robust algorithm to correct the color discrepancy between images. The proposed algorithm neither requires a color calibration chart/object which...
In this paper, a method that performs 3D object reconstruction from multiple views of the same scene is presented. This reconstruction method initially produces a basic model, based on the space carving algorithm, that is further refined in a subsequent step. The algorithm is fast, computationally simple and produces accurate representations of the input scenes. In addition, compared to previously...
This paper presents a compact and robust solution to use stereo vision to detect pedestrians as well as measure their instantaneous distances from the vehicle. This simplifies sensor requirements as the same video information (captured from two cameras) is used for detection of pedestrians as well as measurement of their corresponding distances. To apply stereo vision technique a novel approach has...
We present a new disparity refinement algorithm that utilize color information of the reference image to generate sharp disparity maps. While existing methods use iterative approaches or require multiple disparity maps, the proposed algorithm uses a single pass approach to reduce errors at depth discontinuities. The experimental results are evaluated on the Middlebury benchmark dataset; show the effectiveness...
Rank and census transforms provide high resistance to radiometric distortion, vignette, and noise because they are based on the relative ordering of local pixel intensity values rather than the pixel values themselves. These transforms are widely used in many computer vision applications. An important step of computing these transforms is to compare or rank two grayscale values, which is very much...
This paper presents a local stereo matching algorithm based on the window construction method using local edge detection. In order to improve performance of window-based cost aggregation computation, a new rule called Dissimilar Intensity Support technique is proposed to distinguish support pixels with dissimilar intensities from those with similar intensity for each centered pixel. According to the...
This paper presents a novel binary fully adaptable window for incorporating in a stereo matching System-on-Chip (SoC) architecture. This architecture is fully scalable and parameterizable to allow for custom SoC implementations, as well as rapid prototyping on FPGAs. For each window a binary mask window is generated which selects the supporting pixels in the cost aggregation phase of the SAD algorithm...
To calculate and render the stereo disparity map in real time at a video rate is a challenging problem. In the approach to use the raster scan video system, typically correlations are measured from a point in the left image to a point in the right image along the ID raster, then stereo correspondence for each and every pixel is searched. The time warp algorithm based on the dynamic programming (DP)...
In this paper, we present the fusional feature composed of Affine-SIFT, MSER and color moment invariants. The fusional feature is more robust and distinctive than a single local feature. Instead of adding three local features together simply, an efficient two-level matching strategy is devised with the fusional feature, which speeds up the establishment of the local correspondences. To remove partial...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.