• Title/Summary/Keyword: Disparity Space Image

Search Result 44, Processing Time 0.029 seconds

Stereo-Vision Based Road Slope Estimation and Free Space Detection on Road (스테레오비전 기반의 도로의 기울기 추정과 자유주행공간 검출)

  • Lee, Ki-Yong;Lee, Joon-Woong
    • 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.

Intermediate Image Generation based on Disparity Path Search in Block of Disparity Space Image (시차공간영상에서의 구간별 시차 경로 탐색을 이용한 중간 영상 생성)

  • Kwak, Ji-Hyun;Kim, Kyung-Tae
    • 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.

Determination of Cost Function in Disparity Space Image (변이공간영상에서의 비용 함수의 결정)

  • Park, Jun-Hee;Lee, Byung-Uk
    • 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.

A Study on Stereo Matching Algorithm using Disparity Space Image (시차공간영상을 이용한 스테레오 영상 정합에 관한 연구)

  • Lee, Jong-Min;Kim, Dae-Hyun;Choi, Jong-Soo
    • 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.

A New Stereo Matching Method based on Reliability Space (신뢰도 공간에 기반한 스테레오 정합 기법)

  • Lee, Seung-Tae;Han, Young-Joon;Hahn, Hern-Soo
    • 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.

A stereo matching algorithm in pixel-based disparity space image (화소기반 변이공간영상에서의 스테레오 정합)

  • 김철환;이호근;하영호
    • 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.

Stereo matching using the divide-and-conquer method in the disparity space image (시차 공간에서 divide-and-conquer 방법을 이용한 스테레오 정합)

  • 이종민;김대현;윤용인;최종수
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.179-182
    • /
    • 2003
  • This paper proposes a new stereo matching algorithm using both the divide-and-conquer method and the DSI(Disparity Space Image) technique. Firstly, we find salient feature points on the each scanline of the left image and find the corresponding feature point at the right image. Then the problem of a scanline is divided into several subproblems. By this way, matching of the subintervals is implemented by using the DSI technique. The DSI technique for stereo matching process is a very efficient solution to find matches and occlusions simultaneously and it is very speedy. In addition, we apply three occluding patterns to process occluded regions, as a result, we reduce mismatches at the disparity discontinuity.

  • PDF

A Study on Object Segmentation Using Snake Algorithm in Disparity Space (변이공간에서 스네이크 알고리즘을 이용한 객체분할에 관한 연구)

  • Yu Myeong-Jun;Kim Shin-Hyoung;Jang Jong Whan
    • The KIPS Transactions:PartB
    • /
    • v.11B no.7 s.96
    • /
    • pp.769-778
    • /
    • 2004
  • Object segmentation is a challenging Problem when the background is cluttered and the objects are overlapped one another. Recent develop-ment using snake algorithms proposed to segment objects from a 2-D Image presents a higher possibilityfor getting better contours. However, the performance of those snake algorithms degrades rapidly when the background is cluttered and objects are overlapped one another, Moreover, the initial snake point placement is another difficulty to be resolved. Here, we propose a novel snake algorithm for object segmentation using disparity information taken from a set of stereo images. By applying our newly designed snake energy function defined in the disparity space, our algorithmeffectively circumvents the limitations found in the previous methods. The performance of the proposed algorithm has been verified by computer simulation using various stereo image sets. The experiment results have exhibited a better performance over the well-known snake algorithm in terms of segmentation accuracy.

Object Contour Tracking using Snake in Stereo Image Sequences (스테레오 영상 시퀀스에서 스네이크를 이용한 객체 윤곽 추적 알고리즘)

  • Shin-Hyoung Kim;Jong-Whan Jang
    • The Journal of Engineering Research
    • /
    • v.6 no.2
    • /
    • pp.109-117
    • /
    • 2004
  • In this paper, we propose an object contour tracking algorithm using snakes in stereo image sequences. The proposed technique is composed of two steps. In the first step, the candidate Snake points are determined from the motion information in 3-D disparity space. In the second step, the energy of Snake function is calculated to check whether the candidate Snake points converge to the edges of the interested objects. The energy of Snake function is calculated from the candidate Snake points using the disparity information obtained by patch matching. The performance of the proposed technique is evaluated by applying it to various sample images. Results prove that the proposed technique can track the edges of objects of interest in the stereo image sequences even in the cases of complicated background images or additive components.

  • PDF

Model-Based Plane Detection in Disparity Space Using Surface Partitioning (표면분할을 이용한 시차공간상에서의 모델 기반 평면검출)

  • Ha, Hong-joon;Lee, Chang-hun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.10
    • /
    • pp.465-472
    • /
    • 2015
  • We propose a novel plane detection in disparity space and evaluate its performance. Our method simplifies and makes scenes in disparity space easily dealt with by approximating various surfaces as planes. Moreover, the approximated planes can be represented in the same size as in the real world, and can be employed for obstacle detection and camera pose estimation. Using a stereo matching technique, our method first creates a disparity image which consists of binocular disparity values at xy-coordinates in the image. Slants of disparity values are estimated by exploiting a line simplification algorithm which allows our method to reflect global changes against x or y axis. According to pairs of x and y slants, we label the disparity image. 4-connected disparities with the same label are grouped, on which least squared model estimates plane parameters. N plane models with the largest group of disparity values which satisfy their plane parameters are chosen. We quantitatively and qualitatively evaluate our plane detection. The result shows 97.9%와 86.6% of quality in our experiment respectively on cones and cylinders. Proposed method excellently extracts planes from Middlebury and KITTI dataset which are typically used for evaluation of stereo matching algorithms.