• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.196-206
• /
• 2004

This paper presents an efficient joint disparity-motion estimation algorithm for stereo sequence CODEC. Disparity vectors are estimated by the left and right motion vectors and previous disparity vectors for every frame. In order to obtain more accurate disparity vectors. we include a spatial prediction Process after the feint estimation. From joint estimation and spatial prediction, we can obtain accurate disparity vectors and then Increase coding efficiency. Finally, we proposed the backward quadtree decomposition. which helps the encoder to have a more detailed disparity vector map without transmitting additional coding bits for quadtree information. We confirmed superior performance of the proposed method through computer simulation.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.9
• /
• pp.32-38
• /
• 2007

In this study, a new algorithm for measuring the velocity and distance from a camera to a moving object by using pseudo-stereo images obtained from a single camera with a stereo adapter is proposed. The proposed system is similar to a parallel visual stereo system using a two-camera system, but because this system can obtain pseudo-stereo images form a single camera, it has advantages not only in the aspect of cost but also in stereo conformity by arrangement and the calibration of the left and right stereo cameras upon image processing.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.56-65
• /
• 2009

Stereoscopic images consist of the left image and the right image. Thus, stereoscopic images have much amounts of data than single image. Then an efficient image compression technique is needed, the DPCM-based predicted coding compression technique is used in most video coding standards. Motion and disparity estimation are needed to realize the predicted coding compression technique. Their performing algorithm is block matching algorithm used in most video coding standards. Full search algorithm is a base algorithm of block matching algorithm which finds an optimal block to compare the base block with every other block in the search area. This algorithm presents the best efficiency for finding optimal blocks, but it has very large computational loads. In this paper, we have proposed fast disparity estimation algorithm using motion and disparity vector information of the prior frame in stereo image coding. We can realize fast disparity vector estimation in order to reduce search area by taking advantage of global disparity vector and to decrease computational loads by limiting search points using motion vectors and disparity vectors of prior frame. Experimental results show that the proposed algorithm has better performance in the simple image sequence than complex image sequence. We conclude that the fast disparity vector estimation is possible in simple image sequences by reducing computational complexities.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.465-472
• /
• 2015

We propose a novel plane detection in disparity space and evaluate its performance. Our method simplifies and makes scenes in disparity space easily dealt with by approximating various surfaces as planes. Moreover, the approximated planes can be represented in the same size as in the real world, and can be employed for obstacle detection and camera pose estimation. Using a stereo matching technique, our method first creates a disparity image which consists of binocular disparity values at xy-coordinates in the image. Slants of disparity values are estimated by exploiting a line simplification algorithm which allows our method to reflect global changes against x or y axis. According to pairs of x and y slants, we label the disparity image. 4-connected disparities with the same label are grouped, on which least squared model estimates plane parameters. N plane models with the largest group of disparity values which satisfy their plane parameters are chosen. We quantitatively and qualitatively evaluate our plane detection. The result shows 97.9%와 86.6% of quality in our experiment respectively on cones and cylinders. Proposed method excellently extracts planes from Middlebury and KITTI dataset which are typically used for evaluation of stereo matching algorithms.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.171-174
• /
• 2003

인간 시각이 감지하는 영상정보는 깊이정보가 있는 3차원형태의 정보이다. 이러한 영상정보를 획득하기 위해 2차원의 스테레오영상으로부터 3차원정보를 추출하는 방법이 연구되어왔다. 본 논문에서는 웨이블릿(wavelet) 영역에서의 영역기반 스테레오 매칭(stereo matching)을 통하여 3차원정보를 추출하고 복원하는 것을 제안한다.

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

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.1-9
• /
• 2007

In this paper, we propose a new 3D modeling and rendering system using multiple stereo cameras. When target objects are captured by cameras, each capturing PC segments the objects and estimates disparity fields, then they transmit the segmented masks, disparity fields, and color textures of objects to a 3D modeling server. The modeling server generates 3D models of the objects from the gathered masks and disparity fields. Finally, the server generates a video at the designated point of view with the 3D model and texture information from cameras.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.57-63
• /
• 2012

In this paper, we propose a real-time view interpolation method using virtual viewpoint disparity estimation and convergence check. For the real-time process, we estimate a disparity map at the virtual viewpoint from stereo images using the belief propagation method. This method needs only one disparity map, compared to the conventional methods that need two disparity maps. In the view synthesis part, we warp pixels from the reference images to the virtual viewpoint image using the disparity map at the virtual viewpoint. For real-time acceleration, we utilize a high speed GPU parallel programming, called CUDA. As a result, we can interpolate virtual viewpoint images in real-time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.13-20
• /
• 2005

In this paper, we propose new smoothing filters, i.e., occluding patterns that can accurately correct disparities of occluded areas in the estimated disparity map. An image is composed of several layers and each layer presents similar disparity. Furthermore, the distribution of the estimated disparities has a specific direction around the boundary of the occlusion, and this distribution presents the different direction with respect to the left- and the right-based disparity map. However, typical smoothing filters, such as mean filter and median filter, did not take into account those characteristic. So, they can decrease some error, but they cannot guarantee the accuracy of the corrected disparity. On the contrary, occluding patterns can accurately correct disparities of occluded areas because they consider both the characteristic that occlusion occurs and the characteristic that disparities of the occlusion are ranged, from estimated disparity maps with respect to the left and the right images. We made experiments on occluding patterns with some real stereo image set, and as a result, we can correct disparities of occluded areas more accurately than typical smoothing filters did.