• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.113-122
• /
• 2012

This paper presents a new stereo matching technique which is based on the matching of feature windows and feature links. The proposed method uses the FAST feature detector to find image features in stereo images and determines the correspondences of the detected features in the stereo images. We define a feature window which is an image region containing several image features. The proposed technique consists of two matching steps. First, a feature window is defined in a standard image and its correspondence is found in a reference image. Second, the corresponding features between the matched windows are determined by using the feature link technique. If there is no correspondence for an image feature in the standard image, it's disparity is interpolated by neighboring feature sets. We evaluate the accuracy of the proposed technique by comparing our results with the ground truth of in a stereo image database. We also compare the matching accuracy and computation time with two conventional feature-based stereo matching techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.680-688
• /
• 2010

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.2
• /
• pp.50-59
• /
• 2000

Stereo vision is a technique extracting depth information from stereo images, which are two images that view an object or a scene from different locations. The most important procedure in stereo vision, which is called stereo matching, is to find the same points in stereo images. It is difficult to match stereo images in real time because stereo matching requires heavy calculation. In this Paper we design a digital VLSI to Process stereo matching in real time, which we call stereo image match processor (SIMP). For implementation of real time stereo matching, sliding memory and minimum selection tree are presented. SIMP is designed with pipeline architecture and parallel processing. SIMP takes 64 gray level 64$\times$64 stereo images and yields 8 level 64 $\times$64 disparity map by 3 bit disparity and 12 bit address outputs. SIMP can process stereo images with process speed of 240 frames/sec.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• 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.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3044-3046
• /
• 2000

A Stereo matching has been an important tool for reconstructing three dimensional terrain. In this stereo matching process, DEM(Digitai Elevation Map) can be generated by the disparity from reference image to target image. Generally disparity map in matching process can be implemented by wraping from reference image to target image and if the role of reference and target is interchanged, the different DEM can be obtained. To evaluate the generated DEM from matching process, We adapted the Photorealistic synthetic image generator using ray tracing technique. The generator produce two simulated image from previous DEM and Ortho-image which is regard as Ground-truth. In this paper, we are concern about estimating more accurate DEM from these two DEMs. The several fusion methods of two DEMs are proposed to generate accurate DEM and compared with previous method. one of fusion methods is by using Cross-Correlation match score and the true DEM should have a high matching score.

• ETRI Journal
• /
• v.35 no.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.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.83-88
• /
• 2011

Abstract. Image segmentation is always a challenging task in computer vision as well as in pattern recognition. Nowadays, this method has great importance in the field of stereo vision. The disparity information extracting from the binocular image pairs has essential relevance in the fields like Stereoscopic (3D) Imaging Systems, Virtual Reality and 3D Graphics. The term 'disparity' represents the horizontal shift between left camera image and right camera image. Till now, many methods are proposed to visualize or estimate the disparity. In this paper, we present a new technique to visualize the horizontal disparity between two stereo images based on image segmentation method. The process of comparing left camera image with right camera image is popularly known as 'Stereo-Matching'. This method is used in the field of stereo vision for many years and it has large contribution in generating depth and disparity maps. Correlation based stereo-matching are used most of the times to visualize the disparity. Although, for few stereo image pairs it is easy to estimate the horizontal disparity but in case of some other stereo images it becomes quite difficult to distinguish the disparity. Therefore, in order to visualize the horizontal disparity between any stereo image pairs in more robust way, a novel stereo-matching algorithm is proposed which is named as "Quadtree Segmentation of Pixels Disparity Estimation (QSPDE)".

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.4
• /
• pp.103-106
• /
• 2016

3D technology is main factor in Augmented Reality. Depth map is essential to make cubic effect using 2d image. There are a lot of ways to construct Depth map. Among them, stereo matching is mainly used. This paper presents how to generate depth map using stereo matching. For stereo matching, existing Dynamic programming method is used. To make accurate stereo matching, High-Boost Filter is applied to preprocessing method. As a result, when depth map is generated, accuracy based on Ground Truth soared.

• Korean Journal of Geomatics
• /
• v.1 no.1
• /
• pp.43-49
• /
• 2001

Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.