• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.3
• /
• pp.199-205
• /
• 2011

This paper presents an algorithm capable of detecting free space for the autonomous vehicle navigation. The algorithm consists of two main steps: 1) estimation of longitudinal profile of road, 2) detection of free space. The estimation of longitudinal profile of road is detection of v-line in v-disparity image which is corresponded to road slope, using v-disparity image and hough transform, Dijkstra algorithm. To detect free space, we detect u-line in u-disparity image which is a boundary line between free space and obstacle's region, using u-disparity image and dynamic programming. Free space is decided by detected v-line and u-line. The proposed algorithm is proven to be successful through experiments under various traffic scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.530-535
• /
• 2007

Disparity space image (DSI) technique is a method of establishing correspondence between a pair of images. It has a merit of generating a dense disparity map for each pixel. DSI has a cost function to be minimized, and it needs empirical weighting factors for occlusion penalty and match reward. This paper provides theoretical basis for the weighting factors, which depend on image noise and contrast between an object and background.

• Journal of the Korean Home Economics Association
• /
• v.40 no.4
• /
• pp.59-71
• /
• 2002

This study investigated the self wrapping made possible through the anonymity of cuber-space. According to the analysis of the data, which were collected from the online for 2 days, 2,168 respondents were grouped into three types: Those maintaining the strong sense of identity achievement), 53.8%, those experiencing confusion(identity diffusion), 38.3%, and those losing the sense of identity(foreclosure), 7.9%. Among the general respondents, it was reported that the case of sex wrapping was 11.4%, that of occupation, 40.1%, and that of marital status, 60.6%. Specially 11.4% of the sex wrapper took heterogeneous gender identity, while 7% performed dual sex roles. The rate of gender wrapping of female respondents was higher than that of male ones, which reflects female respondents' longing for male sex. Self-disparity between cyber-space and virtual-space was related with the type of self-identity and gender-identity. The rate of self-disparity between cuber-space and virtual-space was 9%. If it occurred continuously, it may cause individual mental division and maladjustment.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.9-16
• /
• 2008

In this paper, we present an algorithm for synthesizing intermediate view image from a stereoscopic pair of images. An image of multiview is need for people in order to easily recognize 3D image. However, if many cameras are use for that, not only does system get more complicated but also transmission rating cause a big trouble. Hence, stereo images are photograph and issue on the sending side and algorithm to generate several intermediate view image is able to be use on the receiving side. The proposed method is based on disparity space image. First of all, disparity space image that is depicted by the gap of pixel followed by disparity of stereo image is generated. Disparity map is made by utilizing disparity space image for searching for optimal disparity path then eventual intermediate view image is generated after occlusion region which does not match is processed. Experimental results illustrate the performance of the proposed technique and we obtained a high quality image of more than 30 dB PSNR.

• 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 Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.9-18
• /
• 2004

This paper proposes a new and simple stereo matching algorithm using the disparity space image (DSI) technique. First of all, we detect some salient feature points on each scan-line of the image pair and set the matching area using those points and define a simple cost matrix. And we take advantage of matching by pixel-by-pixel instead of using the matching window. While the pixel-by-pixel method boost up the speed of matching, because of no using neighbor information, the correctness of the matching may not be better. To cover this point, we expand the matching path using character of disparity-space-image for using neighbor information. In addition, we devise the compensated matching module using the volume of the disparity space image in order to improve the accuracy of the match. Consequently, we can reduce mismatches at the disparity discontinuities and can obtain the more detailed and correct disparity map.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.82-90
• /
• 2010

In this paper, A new stereo matching method based on reliability space is proposed to acquire 3D information from 2D image. In conventional stereo matching methods, speed is sacrificed to achieve high accuracy. To increase the matching speed while maintaining a high accuracy, this paper proposes this stereo matching method. It first makes the disparity space image for comparing all of the pixels on the stereo images. Then it produce reliability space through analyzing this value. and, By comparing the reliability space according to disparity, it makes disparity map. Moreover, the parts that make regional boundary errors are corrected by classifying the boundary of each region with the reference to color edge. The performance of the proposed stereo matching method is verified by various experiments. As a result, calculation cost is reduced by 30.6%, while the image quality of proposed method has similar performance with the existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.848-856
• /
• 2004

In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and set a good quality disparity map in very short time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.132-140
• /
• 2016

In this paper, we propose boundary-preserving stereo matching method based on adaptive disparity adjustment using confidence region detection. To find the initial disparity map, we compute data cost using the color space (CIE Lab) combined with the gradient space and apply double cost aggregation. We perform left/right consistency checking to sort out the mismatched region. This consistency check typically fails for occluded and mismatched pixels. We mark a pixel in the left disparity map as "inconsistent", if the disparity value of its counterpart pixel differs by a value larger than one pixel. In order to distinguish errors caused by the disparity discontinuity, we first detect the confidence map using the Mean-shift segmentation in the initial disparity map. Using this confidence map, we then adjust the disparity map to reduce the errors in initial disparity map. Experimental results demonstrate that the proposed method produces higher quality disparity maps by successfully preserving disparity discontinuities compared to existing methods.