• Korean Journal of Remote Sensing
• /
• v.8 no.1
• /
• pp.15-26
• /
• 1992

This paper describes an implementation of adaptive stereo matching for DBM generation. The matching method of two stereo satellite images to find corresponding points used in this paper is area-based matching, which is usually used in the field of making DBM. Same window size and search area used as in the conventional matching methods and we propose adaptive stereo matching algorithm in this paper. We cluster three areas which are consist of mountainous areas, cultivated areas and cities, and rivers and lakes by using proposed linear feature extracting method. These classified areas are matched by adaptive window size and search area, but rivers and lakes is excluded in this experiment. The matching time is three times faster than conventional methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.75-85
• /
• 2013

To acquire depth information using stereo vision, it is required to find correspondence points between stereo image pair. Conventional stereo vision systems usually use two cameras to get disparity data. Therefore, conventional stereo matching methods cannot resolve the tradeoff problem between accuracy and precision with respect to the length of baseline. Besides, belief propagation method, which is being used recently, has a problem that matching performance is dependent on the fixed weight parameter ${\lambda}$. In this paper, we propose a modified belief propagation stereo matching technique based on multi-baseline stereo vision to solve the tradeoff problem. The proposed method calculates EMAD(extended mean of absolute differences) as local evidence. And proposed method decides weight parameter ${\lambda}$ adaptively to local texture information. The proposed method shows higher initial matching performance than conventional methods and reached optimum solution in less iteration. The matching performance is increased about 4.85 dB in PSNR.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.42-47
• /
• 2005

In this papcr, we address the 3D reconstruction of the indoor circumstance using what the data is extracted by a pall of image from Stereo Camera. Generally sucaking, there arc three methods to extract 3-Dimensional data using IR sensor, Laser sensor and Stereo camera sensor. The best is stereo camera sensor which can show a high performance at a reasonable price. We used 'Window Correlation Matching Method' to extract 3-Dimensional data in stereo image. We proposed new Method to reduce error data, said 'Histogram Weighted Hough Transform'. Owing to this mettled, we reduced error data in each stereo image. So reconstruction is well done. 3-Dimensional Reconstruction is accomplished by using the DirectX that is well known as 3D-Game development tool. We show that the stereo camera can be not only used to extract 3-dimensional data but also applied to reconstruct the 3-Dimensional circumstance. And we try to reduce the error data using various method.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.398-405
• /
• 2017

In this paper, an artificial stereo extension method that creates stereophonic sound from a mono sound source is proposed. The proposed method first trains deep neural networks (DNNs) that model the nonlinear relationship between the dominant and residual signals of the stereo channel. In the training stage, the band-wise log spectral magnitude and unwrapped phase of both the dominant and residual signals are utilized to model the nonlinearities of each sub-band through deep architecture. From that point, stereo extension is conducted by estimating the residual signal that corresponds to the input mono channel signal with the trained DNN model in a sub-band domain. The performance of the proposed method was evaluated using a log spectral distortion (LSD) measure and multiple stimuli with a hidden reference and anchor (MUSHRA) test. The results showed that the proposed method provided a lower LSD and higher MUSHRA score than conventional methods that use hidden Markov models and DNN with full-band processing.

• Journal of information and communication convergence engineering
• /
• v.13 no.4
• /
• pp.275-279
• /
• 2015

There are several methods to record three dimensional (3D) information of objects such as lens array based integral imaging, synthetic aperture integral imaging (SAII), computer synthesized integral imaging (CSII), axially distributed image sensing (ADS), and axially distributed stereo image sensing (ADSS). ADSS method is capable of recording partially occluded 3D objects and reconstructing high-resolution slice plane images. In this paper, we present a computational method for depth extraction of partially occluded 3D objects using ADSS. In the proposed method, the high resolution elemental stereo image pairs are recorded by simply moving the stereo camera along the optical axis and the recorded elemental image pairs are used to reconstruct 3D slice images using the computational reconstruction algorithm. To extract depth information of partially occluded 3D object, we utilize the edge enhancement and simple block matching algorithm between two reconstructed slice image pair. To demonstrate the proposed method, we carry out the preliminary experiments and the results are presented.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.256-267
• /
• 2017

An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2438-2446
• /
• 1999

Most of block based stereo pair compression schemes utilize the constant block size and searching area size for all the stereo pairs to find the best matching block. However, it is not efficient to use the same block size and size of searching area to all the stereo pairs, since each stereo pair has different disparity. In this Paper, we propose a method to calculate the total disparity of stereo pairs, and show how to determine the size of the block and searching area which are applied for the block based compression of the stereo pairs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.411-417
• /
• 2005

In this study, stereo vision system is applied to a mobile manipulator for effective tasks. The robot can recognize a target and compute the potion of the target using a stereo vision system. While a monocular vision system needs properties such as geometric shape of a target, a stereo vision system enables the robot to find the position of a target without additional information. Many algorithms have been studied and developed for an object recognition. However, most of these approaches have a disadvantage of the complexity of computations and they are inadequate for real-time visual servoing. Color information is useful for simple recognition in real-time visual servoing. This paper addresses object recognition using colors, stereo matching method to reduce its calculation time, recovery of 3D space and the visual servoing.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.5
• /
• pp.65-73
• /
• 2017

In this paper, we propose a stereo matching method to improve the image quality at the hole and the disparity discontinuity regions. The stereo matching method extracts disparity map finding corresponding points between stereo image pair. However conventional stereo matching methods have a problem about the tradeoff between accuracy and precision with respect to the length of the baseline of the stereo image pair. In addition, there are hole and disparity discontinuity regions which are caused by textureless regions and occlusion regions of the stereo image pair. The proposed method extracts initial disparity map improved at disparity discontinuity and miss-matched regions using modified AD-Census-Gradient method and adaptive weighted cost aggregation. And then we conduct the disparity map refinement to improve at miss-matched regions, while also improving the accuracy of the image. Experimental results demonstrate that the proposed method produces high-quality disparity maps by successfully improving miss-matching regions and accuracy while maintaining matching performance compared to existing methods which produce disparity maps with high matching performance. And the matching performance is increased about 3.22(%) compared to latest stereo matching methods in case of test images which have high error ratio.

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