• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.7
• /
• pp.37-42
• /
• 2008

In this paper, a real-time multiview video coding system using fast disparity estimation is proposed. In the multiview encoder, adaptive disparity-motion estimation (DME) for an effective 3-dimensional (3D) processing are proposed. That is, by adaptively predicting the mutual correlation between stereo images in the key-frame using the proposed algorithm, the bandwidth of stereo input images can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and adaptive disparity vectors. Also, in multiview decoder, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (DSA) for real-time multiview video processing is proposed. The proposed IVR can reduce a processing time of disparity estimation by selecting adaptively disparity search range. Accordingly, the proposed multiview video coding system is able to increase the efficiency of the coding rate and improve the resolution.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.205-206
• /
• 2007

In stereo vision applications, disparity estimation is often performed to corresponding pixels. Using window-based correlations is a fast and standard approach to the disparity estimation. In this paper, we analyse the behaviour of the correlation-based disparity estimation and improve its performance by combining it with a segmentation scheme. Simulation results demonstrate that the proposed algorithm provides faithful disparity maps.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.83-92
• /
• 2006

This paper describes an image disparity estimation method using region-based stereo matching. Region-based disparity estimation yields a disparity map as the unit of segmented region. However it estimates disparity imprecisely because it not only has matching errors but also applies an identical way to disparity estimation, which does not consider each type of matched regions. To solve this problem, we proposes a disparity estimation method which considers the type of matched regions. That is, the proposed method classifies whole matched regions into a similar-matched region, a dissimilar-matched region, a false-matched region and a miss-matched region. 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. The experimental results show the improved accuracy of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.25-32
• /
• 2004

We propose a hierarchical disparity estimation algorithm with edge-preserving energy-based regularization. Initial disparity vectors are obtained from downsampled stereo images using a feature-based region-dividing disparity estimation technique. Dense disparities are estimated from these initial vectors with shape-adaptive windows in full resolution images. Finally, the vector fields are regularized with the minimization of the energy functional which considers both fidelity and smoothness of the fields. The first two steps provide highly reliable disparity vectors, so that local minimum problem can be avoided in regularization step. The proposed algorithm generates accurate disparity map which is smooth inside objects while preserving its discontinuities in boundaries. Experimental results are presented to illustrate the capabilities of the proposed disparity estimation technique.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.121-124
• /
• 2001

For efficient transmission of 3DTV video signals, it is necessary to eliminate the inherent redundancy between the stereo image pairs. Though disparity estimation provides a powerful tool for eliminating the redundancy, it is very time consuming. This paper presents a novel disparity estimation scheme based on the human visual property. The disparity vectors of image blocks spatially adjacent to the current block are used as initial guesses fur the disparity vector of the current block. In addition, mixed-resolution coding is applied to reduce the computational complexity of disparity estimation. Through computer simulations on a stereoscopic sequence we show that the proposed method gives rise .to visually pleasing results with much reduced computational complexity.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.171-174
• /
• 2003

In this paper, we propose the method of stereo images composition using adaptive dense disparity estimation. For the correct composition of stereo image and 3D virtual object, we need correct marker position and depth information. The existing algorithms use position information of markers in stereo images for calculating depth of calibration object. But this depth information may be wrong in case of inaccurate marker tracking. Moreover in occlusion region, we can't know depth of 3D object, so we can't composite stereo images and 3D virtual object. In these reasons, the proposed algorithm uses adaptive dense disparity estimation for calculation of depth. The adaptive dense disparity estimation is the algorithm that use pixel-based disparity estimation and the search range is limited around calibration object.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.11
• /
• pp.899-905
• /
• 2003

An intermediate images generation method using multi-resolution based hierarchical block matching disparity map is proposed. This method is composed of a disparity estimation, an occlusion detection and intermediate image synthesis. For the disparity estimation, which is one of the important processes in intermediate image synthesis, we use the multi-resolution based hierarchical block matching algorithm to overcome the imperfect ness of block matching algorithm. The proposed method makes disparity maps more accurate and dense by multi-resolution based hierarchical block matching, and the estimated disparity maps are used to generate intermediate images of stereo images. Generated intermediate images show 0.1∼1.4 ㏈ higher PSNR than the images obtained by block matching algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.424-432
• /
• 2003

In this paper, an effective method of stereo image reconstruction through the regularized adaptive disparity estimation is proposed. Althougth the conventional adaptive disparity estimation method can sharply improve the PSNR of a reconstructed stereo image, but some problems of overlapping between the matching windows and disallocation of the matching windows can be occurred, because the matching window size changes adaptively in accordance with the magnitude of feature values. Accordingly, in thia paper, a new regularized adaptive disparity estimation technique is proposed. That is, by regularizing the estimated disparity vector with the neughboring disparity vectors, problems of the conventional adaptive disparity estimated scheme might be solved, and also the predicted stereo image can be more effectively reconstructed. From some experiments using the CCETT'S stereo image pairs of 'Man' and 'Claude', it is analyzed that the proposed disparity estimation scheme can improve PSNRs of the reconstructed images to 10.89dB, 6.13dB for 'Man' and 1.41dB, 0.81dB for 'Claude' by comparing with those of the conventional pixel-based and adaptive estimation method, respectively.

• Journal of Information Display
• /
• v.5 no.4
• /
• pp.31-37
• /
• 2004

In this paper, an effective method for reconstruction of stereoscopic image pair through the regularized adaptive disparity estimation is proposed. Although the conventional adaptive disparity window matching can sharply improve the PSNR of a reconstructed stereo image, but there still exist some problems of overlapping between the matching windows and disallocation of the matching windows, because the size of the matching window tend to changes adaptively in accordance with the magnitude of the feature values. In the proposed method, the problems relating to the conventional adaptive disparity estimation scheme can be solved and the predicted stereo image can be more effectively reconstructed by regularizing the extimated disparity vector with the neighboring disparity vectors. From the experimental results, it is found that the proposed algorithm show improvements the PSNR of the reconstructed right image by about 2.36${\sim}$2.76 dB, on average, compared with that of conventional algorithms.