• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
• /
• pp.59-62
• /
• 2011

A new method is proposed for stereo vision where solution to disparity map is presented in terms of Line constraint and Reliability space -- the first constraint proposes a progressive framework for stereo matching which applies local area pixel-values from corresponding lines in the left and right image pairs. The second states that reliability space based on corresponding points records the disparity and then we are able to apply the median filter in order to reduce the noises which occur in the process. A coarse to fine result is presented after the median filtering, which improves the final result qualitatively. Experiment is evaluated by rectified stereo matching images pairs from Middlebury datasets and has proved that those two adopted strategies yield good matching quantitative results in terms of fast running speed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1175-1180
• /
• 1991

The purpose of this paper is to improve the matching accuracy in identifying corresponding points in the area-based matching for the processing of stereo vision. For the selection of window size, a new method is proposed based on frequency domain analysis. The effectiveness of the proposed method is confirmed through a series of experiments. To overcome disproportionate distortion in stereo image pair, a new matching method using the warped window is also proposed. In the algorithm, the window is warped according to imaging geometry. Experiments on a synthetic image show that the matching accuracy is improved by 14.1% and 4.2% over the rectangular window method and image warping method each.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1996-1999
• /
• 2003

Stereo matching is an important technique in the are of computer vision. There are already many theorems to find disparity map using stereo images. Usually, disparity is searched by using block matching. However block matching result in blocking effects caused by using fixed size window for computing pixel correlations. This paper suggests an efficient method to remove the blocking effect in stereo matching procedures.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1999년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.182-187
• /
• 1999

Stereo matching is one of the most crucial parts in DEM generation. Naive stereo matching algorithms often create many holes and blunders in a DEM and therefore a carefully designed strategy must be employed to guide stereo matching algorithms to produce “good” 3D information. In this paper, we describe one such a strategy designed by the use of scene geometry, in particular, the epipolarity for generation of a DEM from linear pushbroom images. The epipolarity for perspective images is a well-known property, i.e., in a stereo image pair, a point in the reference image will map to a line in the search image uniquely defined by sensor models of the image pair. This concept has been utilized in stereo matching by applying epipolar resampling prior to matching. However, the epipolar matching for linear pushbroom images is rather complicated. It was found that the epipolarity can only be described by a Hyperbola- shaped curve and that epipolar resampling cannot be applied to linear pushbroom images. Instead, we have developed an algorithm of incorporating such epipolarity directly in least squares correlation matching. Experiments showed that this approach could improve the quality of a DEM.

• ETRI Journal
• /
• 제35권6호
• /
• pp.1011-1020
• /
• 2013

In this paper, we present a method for obtaining a high-quality 3D depth. The advantages of active pattern projection and passive stereo matching are combined and a system is established. A diffractive optical element (DOE) is developed to project the active pattern. Cross guidance (CG) and auto guidance (AG) are proposed to perform the passive stereo matching in a stereo image in which a DOE pattern is projected. When obtaining the image, the CG emits a DOE pattern periodically and consecutively receives the original and pattern images. In addition, stereo matching is performed using these images. The AG projects the DOE pattern continuously. It conducts cost aggregation, and the image is restored through the process of removing the pattern from the pattern image. The ground truth is generated to estimate the optimal parameter among various stereo matching algorithms. Using the ground truth, the optimal parameter is estimated and the cost computation and aggregation algorithm are selected. The depth is calculated and bad-pixel errors make up 4.45% of the non-occlusion area.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• pp.170-173
• /
• 2001

To apply stereo vision system to obstacle recognition system of AGV, we constructed algorithm of stereo matching and distance measuring with stereo image for positioning of object in area. And using this system, we look into the error between real position and measured position, and studied relationship of compensation.

• 대한임베디드공학회논문지
• /
• 제3권3호
• /
• pp.143-150
• /
• 2008

In this paper, we investigate a real-time environment recognition system based on stereo vision for moving object. This system consists of stereo matching, obstacle detection and distance estimation. In stereo matching part, depth maps can be obtained real road images captured adjustable baseline stereo vision system using belief propagation(BP) algorithm. In detection part, various obstacles are detected using only depth map in case of both v-disparity and column detection method under the real road environment. Finally in estimation part, asymmetric parabola fitting with NCC method improves estimation of obstacle detection. This stereo vision system can be applied to many applications such as unmanned vehicle and robot.

• 한국통신학회논문지
• /
• 제41권4호
• /
• pp.387-394
• /
• 2016

스테레오 정합 방법은 2차원 영상으로부터 깊이정보를 얻는 여러 가지 방법들 중 하나다. 이 방법은 서로 다른 두 시점을 갖는 스테레오 영상을 이용해 영상 속 객체 및 배경의 깊이를 예측한다. 이때 물체의 깊이 값은 한 시점의 영상 속 화소들과 다른 시점 영상에 있는 대응점들 사이의 거리 차이인 변위값에 의해 결정된다. 본 논문은 평탄한 영역 속 각 화소의 대응점을 잘 찾기 위해 거리변환을 이용한 새로운 정합비용 함수를 제안한다. 거리변환은 영상 속 각 화소가 경계 영역으로부터 얼만큼 떨어져있는지 계산해준다. 따라서 평탄한 영역에 있는 화소에 거리변환을 적용하면 특정값을 갖는 화소로 변환할 수 있기 때문에 이 영역에서의 대응점 탐색 정확도를 높일 수 있다. 또한, 정합비용을 계산하는 과정에서 1차원 배열을 이용해 영상의 영역별 특성에 따라 정합 방법이 적응적으로 적용되도록 한다. 최적의 대응점을 찾기 위한 정합비용들의 종합 과정에는 교차 계층 구조를 이용한 종합 방법이 사용된다. 그 결과, 평탄한 영역을 포함한 모든 영역에서 기존의 방법보다 더 정확한 변위값을 얻었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 추계학술대회 논문집 학회본부
• /
• pp.484-487
• /
• 1989

A fast stereo algorithm for 3D depth estimation is presented. We propose an on-line stereo matching technique, by which the flows of stereo image signals are dynamically controlled to satisfy the matching condition of intensity functionals. The disparity is rapidly estimated from the control of. the signal flows and 3D depth is determined from the disparity.

• 디지털콘텐츠학회 논문지
• /
• 제17권6호
• /
• pp.523-529
• /
• 2016

스테레오 매칭 알고리즘은 컴퓨터 비전과 사진촬영에 필수적인 알고리즘으로 정확도와 복잡도는 스테레오 매칭 알고리즘의 주요 문제점이었다. 그 중에서도 복잡도가 높은 문제점을 극복하기 위해 비용 볼륨 필터링을 기반한 스테레오 매칭 알고리즘에 대한 많은 연구가 이루어졌다. 지역 스테레오 매칭 기술인 유도 영상 필터링 기술은 O(N)의 복잡도를 가지고 있지만, 여전히 실시간 3D 비디오 서비스를 제공하기에는 계산량이 많은 편이다. 따라서 본 논문에서 고속 유도 영상 필터링에 기반한 스테레오 매칭 알고리즘을 제안한다. 고속 유도 필터링은 서브샘플 비율 $\small{s}$에 따라 복잡도 $O(N/\small{s}^2)$을 가지는 알고리즘이다. 제안하는 알고리즘은 효과적인 스테레오 알고리즘을 성능을 보여줌과 동시에 3D 서비스를 위한 빠른 실행 시간을 보여준다.