• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.12-18
• /
• 2012

Stereo correspondence is the central problem of stereo vision. In this paper, we propose a stereo matching scheme based on a genetic algorithm using a multi-resolution method and AD-Census. The proposed approach considers the matching environment as an optimization problem and finds the disparity by using a genetic algorithm And adaptive chronosome structure using edge pixels and crossover mechanism are employed in this technique. A cost function is composes of certain constraints whice are commonly used in stereo matching. AD-Census measure is applied to reduce disparity error. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement using local feature vector. We valid our method not only reduces the search time for correspondence compared with conventional GA-based method but also ensures the validity of matching.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.6
• /
• pp.1431-1438
• /
• 1995

In this paper, we present a multiple-view stereo matching method in case of moving in the direction of optical axis with stereo camera. Also we analyze the obtainable depth precision to show that multiple-view stereo increases the virtual baseline with single-view stereo. This method decides candidate points for correspondence in each image pair and then search for the correct combinations of correspondences among them using the geometrical consistency they must satisfy. Adantages of this method are capability in increasing the accuracy in matching by using the multiple stereo images and less computation due to local processing. This method computes 3-D depth by averaging the depth obtained in each multiple-view stereo. We show that the resulting depth has more precision than depth obtainable by each independent stereo when the position of image feature is uncertain due to image noise. This paper first defines a multipleview stereo agorithm in case of moving in the direction of optical axis with stereo camera and analyze the obtainable precision of computed depth. Then we represent the effect of removing the incorrect matching candidate and precision enhancement with experimental result.

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

• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.9-17
• /
• 2007

Feature based stereo matching is an effective way to perform 3D building reconstruction. However, in urban scene, the cluttered background and various building structures may interfere with the performance of building reconstruction. In this paper, we propose a novel method to robustly reconstruct buildings on the basis of rectangle regions. Firstly, we propose a multi-scale linear feature detector to obtain the salient line segments on the object contours. Secondly, candidate rectangle regions are extracted from the salient line segments based on their local information. Thirdly, stereo matching is performed with the list of matching line segments, which are boundary edges of the corresponding rectangles from the left and right image. Experimental results demonstrate that the proposed method can achieve better accuracy on the reconstructed result than pixel-level stereo matching.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.12
• /
• pp.659-666
• /
• 2000

A stereo matching has been an important tool for reconstructing three dimensional terrain. By using stereo matching technique, DEM(Digital Elevaton Map) can be generated by the disparity from a reference image to a target image. Generally disparity map can be evaluated by matching the reference image to the target image and if the role of the reference and the target are interchanged, a different DEM can be obtained. In this paper, we propose a new fusion technique to estimate the optimal DEM by eliminating the false DEM due to occlusion. To detect the false DEM, we utilize two measure of accuracy: self-consistency and cross-correlation score. We test the effectiveness of the proposed methods with a quantitative analysis using simulated images. Experimental result indicate that the proposed methods show 24.4% and 33.1% improvement over either DEM.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.11
• /
• pp.925-933
• /
• 1991

Conventional stereo matching techniques are based on the assumption that the features representing an object in left and right images have fixed attribute values. But, in fact, such features may take different values due to the practical stereo image formation and the image acquisition error, and thus the conventional techniques tend to result in the in the incorrect matching of features. In this paper, we propose a stereo matching mathod with a possibilistic view which copes with the possible variability of feature values. As a result, this method decreases the number of incorrect matching features when the values of corresponding features are somewhat large. The effectiveness of the proposed method is shown via computer simulation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.44-53
• /
• 1992

In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.115-124
• /
• 2010

Stereo matching techniques are categorized in two major schemes, local and global matching techniques. In global matching schemes, several investigations are introduced, where cost accumulation is performed in multiple matching lines. In this paper, we introduce a new multi-line stereo matching techniques which expands a conventional single-line matching scheme to multiple one. Matching cost is based on simple normalized cross correlation. We expand the scan-line optimization technique to a multi-line scan-line optimization technique. The proposed technique first generates a reliability image, which is iteratively updated based on the previous reliability measure. After some number of iterations, the reliability image is completed by a hole-filling algorithm. The hole-filling algorithm introduces a disparity score table which records the disparity score of the current pixel. The disparity of an empty pixel is determined by comparing the scores of the neighboring pixels. The proposed technique is tested using the Middlebury and CMU stereo images. The error analysis shows that the proposed matching technique yields better performance than using conventional global matching algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1194-1199
• /
• 2009

Stereo vision system is useful method for inferring 3D depth information from two or more images. So it has been the focus of attention in this field for a long time. Stereo matching is the process of finding correspondence points in two or more images. A central problem in a stereo matching is that it is difficult to satisfy both the computation time problem and accuracy at the same time. To resolve this problem, we proposed a new stereo matching technique using weighted cost aggregation. To begin with, we extract the weight in given stereo images based on features. We compute the costs of the pixels in a given window using correlation of weighted color and brightness information. Then, we match pixels in a given window between the reference and target images of a stereo pair. To demonstrate the effectiveness of the algorithm, we provide experimental data from several synthetic and real scenes. The experimental results show the improved accuracy of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.396-399
• /
• 2009

Stereo vision system is useful method for inferring 3D depth information from two or more images. So it has been the focus of attention in this field for a long time. Stereo matching is the process of finding correspondence points in two or more images. A central problem in a stereo matching is that it is difficult to satisfy both the computation time problem and accuracy at the same time. To resolve this problem, we proposed a new stereo matching technique using weighted cost aggregation. To begin with, we extract the weight in given stereo images based on features. We compute the costs of the pixels in a given window using correlation of weighted color, brightness and distance information. Then, we match pixels in a given window between the reference and target images of a stereo pair. To demonstrate the effectiveness of the algorithm, we provide experimental data from several synthetic and real scenes. The experimental results show the improved accuracy of the proposed method.