• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.7
• /
• pp.138-146
• /
• 2003

A critical issue in area-based stereo matching lies in selecting a fixed rectangular window size. Previous stereo methods doesn't deal effectively with occluding boundary due to inevitable window-based problems, and so give inaccurate and noisy matching results in areas with steep disparity variations. In this paper, a variable window approach is presented to estimate accurate, detailed and smooth disparities for three-dimensional structure reconstruction. It makes the smoothing of depth discontinuity reduced by evaluating corresponding correlation values and intensity gradient-based similarity in the three-dimensional disparity space. In addition, it investigates maximum connected match candidate points and then devise the novel arbitrarily shaped variable window representative of a same disparity to treat with disparity variations of various structure shapes. We demonstrate the performance of the proposed variable window method with synthetic images, and show how our results improve on those of closely related techniques for accuracy, robustness, matching density and computing speed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.284-287
• /
• 2003

Previous stereo methods doesn't deal effectively with depth discontinuity due to inevitable window-based problems, and so give inaccurate and noisy matching results in areas with steep disparity variations. In this paper. a variable window approach is presented to estimate accurate, detailed and smooth disparities with three-dimensional disparity space. It makes the smoothing of depth discontinuity reduced by evaluating corresponding correlation values and intensity gradient-based similarity in the space. In addition, it devises the novel arbitrarily-shaped variable window to treat with disparity variations of various structure shapes. We show how our results improve on those of closely related techniques for accuracy, robustness. matching density and computing speed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1437-1446
• /
• 2012

In this paper we propose a new stereo matching algorithm which is suitable for application to obtain depth information with high-speed in stereoscopic camera environment. For satisfying these condition we propose a new adaptive stereo matching technique using frequency information in discrete wavelet (DWT) domain and variable matching window. The size of the matching window is selected by analysis of the local property of the image in spatial domain and the feature and scaling factor of the matching window is selected by the frequency property in the frequency domain. For using frequency information we use local DWT and global DWT. We identified that the proposed technique has better peak noise to signal ratio (PSNR) than the fixed matching techniques with similar complexity.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.461-469
• /
• 2001

Existing area-based stereo algorithms rely heavily on rectangular windows for computing correspondence. While the algorithms with the rectangular windows are efficient, they generate relatively large matching errors due to variations of disparity profiles near depth discontinuities and doesnt take into account local deformations of the windows due to projective distortion. In this paper, in order to deal with these problems, a new correlation function with 4 directional line masks, based on robust estimator, is proposed for the selection of potential matching points. These points is selected to consider depth discontinuities and reduce effects on outliers. The proposed matching method finds an arbitrarily-shaped variable window around a pixel in the 3d array which is constructed with the selected matching points. In addition, the method take into account the local deformation of the variable window with a constant disparity, and perform the estimation of sub-pixel disparities. Experiments with various synthetic images show that the proposed technique significantly reduces matching errors both in the vicinity of depth discontinuities and in continuously smooth areas, and also does not be affected drastically due to outlier and noise.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1667-1679
• /
• 2010

This thesis proposes an adaptive variable-sized matching window method using the characteristic points of the image and a method to increase the reliability of the cross-consistency check to raise the correctness of the final disparity image. The proposed adaptive variable-sized window method segments the image with the color information, finds the characteristic points in each segmented image, and varies the size of the matching window according to the existence of the characteristic points inside the window. Also the proposed cross-consistency check method processes the two cases with the cost values corresponding to the best disparity and the second-best disparity: when the cost values themselves are too large and when the difference between the two cost values are too small. The two proposed methods were experimented with the four test images provided by the Middleburry site. As the results from the experiments, the proposed adaptive variable-sized matching window method decreased up to 18.2% of error ratio and the proposed cross-consistency check method increased up to 7.4% of reliability.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.737-738
• /
• 2008

An implementation of robust stereo matching algorithm under variable illumination conditions is presented in this paper. By applying window-based matchingmethod to global stereo matching algorthm using belief propagation, our implemented system shows low error rate and could efficiently cope with general radiometric disimilarities between images acquired from two different point of views.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.583-588
• /
• 2011

In this paper, we propose an adaptive variable-sized matching window method using the characteristic points of the image and a method to increase the reliability of the cross-consistency check to raise the correctness of the final disparity image. The proposed adaptive variable-sized window method segments the image with the color information, finds the characteristic points inside the window. Also the proposed algorithm implement using a graphic processing unit(GPU). The GPU, we used in this paper is GeForce GTX296 (NVIDIA) and we can use programming based on CUDA. The calculation speed realizes a speed approximately 128 times faster than that of a CPU.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1591-1602
• /
• 1995

A hybrid approach which includes edge- and region-based methods is considered. The modified non-linear Laplacian(MNL) filter is used for feature extraction. The matching algorithm has three steps which are edge, signed region, and residual region matching. At first, the edge points are matched using the sign and direction of edges. Then, the disparity is propagated from edge to inside region. A variable window is used to consider the local method which give accurate matched points and area-based method which can obtain full-resolution disparity map. In addition, a new relaxation algorithm for considering matching possibility derived from normalized error and regional continuity constraint is proposed to reduce the mismatched points. By the result of simulation for various images, this algorithm is insensitive to noise and gives full- resolution disparity map.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.74-86
• /
• 1994

In this paper a hierarchical stereo matching algorithm to obtain the disparity in wavelet transformed domain by using locally adaptive window and weights is proposed. The pyramidal structure obtained by wavelet transform is used to solve the loss of information which the conventional Gaussian or Laplacian pyramid have. The wavelet transformed images are decomposed into the blurred image the horizontal edges the vertical edges and the diagonal edges. The similarity between each wavelet channel of left and right image determines the relative importance of each primitive and make the algorithm perform the area-based and feature-based matching adaptively. The wavelet transform can extract the features that have the dense resolution as well as can avoid the duplication or loss of information. Meanwhile the variable window that needs to obtain precise and stable estimation of correspondense is decided adaptively from the disparities estimated in coarse resolution and LL(low-low) channel of wavelet transformed stereo image. Also a new relaxation algorithm that can reduce the false match without the blurring of the disparity edge is proposed. The experimental results for various images show that the proposed algorithm has good perfpormance even if the images used in experiments have the unfavorable conditions.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2228-2230
• /
• 1998

This paper presents the development of depth extraction algorithm for the stereoscopic endoscope data using a stereo matching method. generally, the purpose of existing stereo algorithms is to reconstruct stereo object surface and depth map. but the main purpose of our processing is to give exact depth feeling to doctor showing depth information in some points. for this purpose, this paper presents two stereo matching algorithms which are to measure exact depth. one is using variable window, and the other is reference points-based algorithm for a fast processing.