This paper proposes a parallel matching algorithm for feature-based stereo vision. Features are zero-crossing (ZC) points detected with various sizes of Laplacian-Gaussian filters. In order to obtain candidate intervals of disparity, the disparity histogram is computed all over the image. The image is, then, divided into small areas and the disparity histogram in each local area is computed wit...

The 3D reconstruction algorithm in a stereo image pair for realizing mutual occlusion and interactions between the real and virtual world in an image synthesis is proposed. A two-stage algorithm, consisting of disparity estimation and regularization is used to locate a smooth and precise disparity vector. The hierarchical disparity estimation technique increases the efficiency and reliability o...

The ability to detect surfaces was studied in a multiple-cue condition in which binocular disparity and motion parallax could specify independent depth configurations. On trials on which binocular disparity and motion parallax were presented together, either binocular disparity or motion parallax could indicate a surface in one of two intervals; in the other interval, both sources indicated a v...

Several studies (Vision Research 15 (1975) 583; Perception 9 (1980) 671) have shown that binocular fusion is limited by the disparity gradient (disparity/distance) separating image points, rather than by their absolute disparity values. Points separated by a gradient >1 appear diplopic. These results are sometimes interpreted as a constraint on human stereo matching, rather than a constraint on...

Orientation disparity, the difference in orientation that results when a texture element on a slanted surface is projected to the two eyes, has been proposed as a binocular cue for 3D orientation. Since orientation disparity is confounded with position disparity, neither behavioral nor neurophysiological experiments have successfully isolated its contribution to slant estimates or established w...

Most models of disparity selectivity consider only the spatial properties of binocular cells. However, the temporal response is an integral component of real neurons' activities, and time-varying stimuli are often used in the experiments of disparity tuning. To understand the temporal dimension of V1 disparity representation, we incorporate a specific temporal response function into the dispari...

Visual overlay masking is typically studied with a mask and target located at the same depth plane. Masking is reduced when binocular disparity separates the target from the mask (G. Moraglia & B. Schneider, 1990). We replicate this finding for a broadband target masked by natural images and find the greatest masking (threshold elevation) when target and mask occupy the same depth plane. Maskin...

We propose a fast depth reconstruction algorithm for stereo sequences using camera geometry and disparity estimation. In disparity estimation process, we calculate dense background disparity fields in an initialization step so that only disparities of moving object regions are updated in the main process using real-time segmentation and hierarchical disparity estimation techniques. The estimate...

The current paper proposes a real-time dense stereo matching algorithm based on a DSI (Disparity Space Image ) data structure that can produce accurate disparity map. Our approach divides the disparity map computing into two main steps. The first step deals with the computing of the initial disparity map using DSI method. The second step presents a simple and a fast method to refine the initial...

A central problem in stereo matching by computing correlation or sum of squared differences (SSD) lies in selecting an appropriate window size. If the window is too small and does not cover enough intensity variation, it gives a poor disparity estimate, because the signal (intensity variation) to noise ratio is low. If, on the other hand, the window is too large and covers a region in which the...