• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.769-778
• /
• 2004

Object segmentation is a challenging Problem when the background is cluttered and the objects are overlapped one another. Recent develop-ment using snake algorithms proposed to segment objects from a 2-D Image presents a higher possibilityfor getting better contours. However, the performance of those snake algorithms degrades rapidly when the background is cluttered and objects are overlapped one another, Moreover, the initial snake point placement is another difficulty to be resolved. Here, we propose a novel snake algorithm for object segmentation using disparity information taken from a set of stereo images. By applying our newly designed snake energy function defined in the disparity space, our algorithmeffectively circumvents the limitations found in the previous methods. The performance of the proposed algorithm has been verified by computer simulation using various stereo image sets. The experiment results have exhibited a better performance over the well-known snake algorithm in terms of segmentation accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.137-145
• /
• 2002

In the method of 3D modeling, stereo matching method which obtains three dimensional depth information from the two images is taken from the different view points. In general, it is very essential work for the 3D modeling from 2D stereo images to estimate the exact disparity through fading the conjugate pair of pixel from the left and right image. In this paper to solve the problems of the stereo image disparity estimation, we introduce a novel approach method to improve the exactness and efficiency of the disparity. In the first place, we perform a wavelet transformation of the stereo images and set the reference points in the image by the feature-based matching method. This reference points have very high probability over 95 %. In the base of these reference points we can decide the size of the variable block searching windows for estimating dense disparity of area based method and perform the ordering constraint to prevent mismatching. By doing this, we could estimate the disparity in a short time and solve the occlusion caused by applying the fried-sized windows and probable error caused by repeating patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1088-1097
• /
• 2003

In this paper, we propose a method that improves the snakes algorithm well known as previously active contour model. Generally, the previous snakes algorithm applied to the 2-D images doesn't get the good results due to the influences about other objects adjacent to contour of object to be extracted. Users directly set the initial snakes points near to the contour of the object to get better results. In this paper, using the disparity information of the stereo images, a new algorithm of the object segmentation is proposed to reduce the influences adjacent to the contour of object. Users can establish initial snakes points automatically from the setting of the interested regions.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.767-774
• /
• 2005

In this paper, we present a snake-based scheme for tracking object contour using disparity information taken from a stereo image sequence with cluttered background. The proposed method is composed of two steps. First, 3-D motion of object is estimated and candidate snake points are selected in disparity space. Second, object contour is extracted by using a modified snake algorithm with disparity information. The proposed algorithm can successfully extract the concave contour of objects and track the object contour in complex image. Performance of the proposed algorithm has been verified by simulation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.77-87
• /
• 2011

In this paper, we propose a disparity correction technique to reduce the inherent visual discomfort while watching stereoscopic videos. The visual discomfort must be solved for commercial 3D display systems to provide natural stereoscopic videos to human eyes. The proposed disparity correction technique consists of horizontal and vertical disparity corrections. The horizontal disparity correction is implemented by controlling the depth budget of stereoscopic video using the geometric relations of a stereoscopic camera system. In addition, the vertical disparity correction is implemented by using a feature-based stereo matching algorithm. Conventional vertical disparity corrections have been done by only using camera calibration parameters, which still cause systematic errors in vertical disparities. In this paper, we minimize the vertical disparity as small as possible by using a feature-based correction algorithm. Through the comparisons of conventional feature-based correction algorithms, we analyze the performance of the proposed technique.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.107-115
• /
• 2002

In this paper, we describe a novel method to generate an intermediate scene using BDM (Bidirectional Disparity Morphing) from the parallel stereopair. Because an image is composed of several layers and each layer has a similar disparity, it is available to use the block based disparity estimation. In order to prevent the false correspondence, however, we closely investigate the corresponding block as we adaptively vary the block size according to the estimation error. Therefore, we can detect the occlusion because of larger estimation error of the occluded region. We define three occluding patterns, which ate derived from the peculiar property of the disparity map, in order to smooth the computed disparity map. The filtered disparity map using these patterns presents that the false disparities ate well corrected and the boundary between foreground and background becomes sharper. As a result, we can improve the quality of the intermediate scenes.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.9-16
• /
• 2008

In this paper, we present an algorithm for synthesizing intermediate view image from a stereoscopic pair of images. An image of multiview is need for people in order to easily recognize 3D image. However, if many cameras are use for that, not only does system get more complicated but also transmission rating cause a big trouble. Hence, stereo images are photograph and issue on the sending side and algorithm to generate several intermediate view image is able to be use on the receiving side. The proposed method is based on disparity space image. First of all, disparity space image that is depicted by the gap of pixel followed by disparity of stereo image is generated. Disparity map is made by utilizing disparity space image for searching for optimal disparity path then eventual intermediate view image is generated after occlusion region which does not match is processed. Experimental results illustrate the performance of the proposed technique and we obtained a high quality image of more than 30 dB PSNR.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.69-83
• /
• 2006

This paper describes an image disparity estimation method using a segmented-region based stereo matching. Segmented-region based disparity estimation yields a disparity map as the unit of segmented region. However, there is a problem that it estimates disparity imprecisely. The reason is that because it not only have matching errors but also apply an identical way to disparity estimation, which is not considered each type of matched regions. To solve this problem, we proposes a disparity estimation method which is considered the type of matched regions. That is, the proposed method classifies whole matched regions into similar-matched region, dissimilar-matched region, false-matched region and miss-matched region by analyzing the type of matched regions. We then performs proper disparity estimation for each type of matched regions. This method minimizes the error in estimating disparity which is caused by inaccurate matching and also improves the accuracy of disparity of the well-matched regions. For the purpose of performance evaluations, we perform tests on a variety of scenes for synthetic, indoor and outdoor images. As a result of tests, we can obtain a dense disparity map which has the improved accuracy. The remarkable result is that the accuracy of disparity is also improved considerably for complex outdoor images which are barely treatable in the previous methods.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.175-182
• /
• 2017

In this paper, we present a multi-depth generation method using a time-of-flight (ToF) fusion camera system. Multi-view color cameras in the parallel type and ToF depth sensors are used for 3D scene capturing. Although each ToF depth sensor can measure the depth information of the scene in real-time, it has several problems to overcome. Therefore, after we capture low-resolution depth images by ToF depth sensors, we perform a post-processing to solve the problems. Then, the depth information of the depth sensor is warped to color image positions and used as initial disparity values. In addition, the warped depth data is used to generate a depth-discontinuity map for efficient stereo matching. By applying the stereo matching using belief propagation with the depth-discontinuity map and the initial disparity information, we have obtained more accurate and stable multi-view disparity maps in reduced time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.121-128
• /
• 2003

In this paper, we propose a new disparity estimation method called object based block matching algorithm(OBMA) for stereoscopic images which is able to reduce the blocking artifact. In the proposed algorithm, edge information of the given image is first extracted and then we estimate the disparity of each segmented object to remove the blocking artifact. In the experimental results, it is proven that the proposed algorithm has about the same performance as the old BMA algorithm while it achieves much better subjective quality.