• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.1
• /
• pp.77-88
• /
• 1993

In this paper, we propose a stereo vision system to solve correspondence problem with large disparity and sudden change in environment which result from small distance between camera and working objects. First of all, a specific feature is divided by predfined elementary feature. And then these are combined to obtain coded data for solving correspondence problem. We use Neural Network to extract elementary features from specific feature and to have adaptability to noise and some change of the shape. Fourier transformation and Log-polar mapping are used for obtaining appropriate Neural Network input data which has a shift, scale, and rotation invariability. Finally, we use associative memory to obtain coded data of the specific feature from the combination of elementary features. In spite of specific feature with some variation in shapes, we could obtain satisfactory 3-dimensional data from corresponded codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1163-1168
• /
• 2001

The ranging systems measure range data in three-dimensional coordinate from target surface. These non-contact remote ranging systems is widely used in various automation applications, including military equipment, construction field, navigation, inspection, assembly, and robot vision. The active ranging systems using time of flight technique or light pattern illumination technique are complex and expensive, the passive systems based on stereo or focusing principle are time-consuming. The proposed algorithm, that is based on cross correlation of projection profile of vertical edge, provides advantages of fast and simple operation in the range acquisition. The results of experiment show the effectiveness of the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.9
• /
• pp.790-797
• /
• 2001

A simple computer vision technology to measure the middle-ranged depth with a mono camera and a plain mirror is proposed. The proposed system is structured with the rotating mirror in front of the fixed mono camera. In contrast to the previous stereo vision system in which the disparity of the closer object is larger than that of the distant object, the pixel movement caused by the rotating mirror is bigger for the pixels of the distant object in the proposed system. Being inspired by such distinguished feature in the proposed system, the principle of the depth measurement based on the relation of the pixel movement and the distance of object is investigated. Also, the factors to influence the precision of the measurement are analysed. The benefits of the proposed system are low price and less chance of occlusion. The robustness for practical usage is an additional benefit of the proposed vision system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1829-1834
• /
• 2006

In this raper in order to recover sharp object boundaries we propose a new efficient stereo matching algorithm in which window size is varied to the distance from the boundaries of object. To this end, the processing region is divided into small subregions with a same area and the disparities of the center pixels in the subregions are calculated using a area-based algorithm with multiple windows. From the this disparity map we can find the edges of the contracted objects. The disparities of original image are obtained using the gradient constraint that means the disparity of the center pixel is similar to the ones of the remaining pixels in the subregion. from the experimental results it is found that the proposed algorithm is very good for recovering sharp object boundaries compared to the similar different algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.1-6
• /
• 2005

In the Markov network which models disparity map with the Markov Random Fields(MRF), the belief propagation algorithm is operated by message passing between nodes corresponding to each pixel. The initial message value is converged by iterations of the algorithm and the algorithm requires many iterations to get converged messages. In this paper, we simplify the algorithm by regarding the objects in the disparity map as combinations of lines with same message valued nodes to reduce iterations of the algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1320-1327
• /
• 2009

In stereoscopy using stereo camera system, the representative factors inducing stereoscopic depth distortions have been reported such as the inter camera distance, the convergence angle and the depth resolution. The image distance is just known to us as a factor related in optical system. In a point of view of depth distortion, it will be a factor inducing a stereoscopic depth distortion. In this paper, we focused on the proof of our opinion that the image distance is one of the weighted factors inducing depth distortion under orthostereoscopic condition.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.363-373
• /
• 2012

This paper proposes a method to generate a depth image at an arbitrary intermediate view-point, which is targeting a video service for free-view, auto-stereoscopy, holography, etc. It assumes that the leftmost and the rightmost depth images are given and they both have been camera-calibrated and image-rectified. This method calculates and uses a disparity increment per depth value. In this paper, it is obtained by stereo matching for the given two depth image by considering more general cases. The disparity increment is used to find the location in the intermediate view-point depth image (IVPD) for each depth in the given images. Thus, this paper finds two IVPDs, from left image and from right image. Noises are removed and holes are filled in each IVPDs and the two results are combined to get the final IVPD. The proposed method was implemented and applied to several test sequences. The results revealed that the quality of the generated IVPD corresponds to 33.84dB of PSNR in average and it takes about 1 second to generate a HD IVPD. We evaluate that this image quality is quite good by considering the low correspondency among the left images, intermediate images, and the right images in the test sequences. If the execution speed is improved, the proposed method can be a very useful method to generate an IVPD at an arbitrary view-point, we believe.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.3
• /
• pp.51-59
• /
• 2012

This paper suggests an efficient method which tracks articulated human body modeled with markov network using disparity map derived from stereo images. The conventional methods which only use color information to calculate likelihood for energy function tend to fail when background has same colors with objects or appearances of object are changed during the movement. In this paper, we present a method evaluating likelihood with both disparity information and color information to find human body parts. Since the human body part are cylinder projected to rectangles in 2D image plane, we use the properties of distribution of disparity of those rectangles that do not have discontinuous distribution. In addition to that we suggest a conditional-messages-update that is able to reduce unnecessary message update of belief propagation. Since the message update has comprised over 80% of the whole computation in belief propagation, the conditional-message-update yields 9~45% of improvements of computational time. Furthermore, we also propose an another speed up method called three dimensional dynamic models assumed the body motion is continuous. The experiment results show that the proposed method reduces the computational time as well as it increases tracking accuracy.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.59-64
• /
• 2001

In this paper it was proposed method that solve problems of method to segment region of zero disparity and algorithm that extract binocular disparity to estimate position of object by vergence movement of moving stereo cameras experimented to compare those. There was not change of density value almost in region that change of critcal value was not found almost in image, because a high critical value was set so that critical value may be kipt changelessly about all small regions in studied treatise so far. The corresponding points were extracted wrongly by the result. By because the characteristics of small region was evaluated by autocorrelation and the critical value was established that may be proportional to the autocorrelation value, it was confirmed that corresponding points are not extracted almost by mistake and binocular disparity could by extracted with high speed.

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