• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2
• /
• pp.66-76
• /
• 1999

This paper proposes that can take at high speed the information of binocular disparity with moving translational and forward stereo camera to the extent that does not occur the problem of a correspondence point. It shows that in case of stereo vision with translational motion, can take the information of binocular disparity being devoid of error and putting high confidence in, and that in case of stereo vision with forward motion, can take the horizontal component which can not be detected in common stereo vision. Besides, the stereo vision can be done at high speed due to being bright and small a correspondence point comparing not to do, because a correspondence between right and left images is previously limited. But there are problem that a resonable information of binocular disparity can not be taken, if the vicinity of center of image is in accord with the region of occlusion in stereo vision with forward motion.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.8-12
• /
• 2012

Area-based stereo matchng algorithms are widely used for image analysis for stereo vision. SAD (Sum of Absolute Difference) algorithm is one of well known area-based stereo matchng algorithms with the characteristics of data intensive computing application. Therefore, it requires very high computation capabilities and its processing speed becomes very slow with software realization. This paper proposes a fast SAD algorithm utilizing SSE (Streaming SIMD Extensions) instructions based on SIMD (Single Instruction Multiple Data) parallism. CPU supporing SSE instructions has 16 XMM registers with 128 bits. For the performance evaluation of the proposed scheme, we compare the processing speed between SAD with/without SSE instructions. The proposed scheme achieves four times performance improvement over the general SAD, which shows the possibility of the software realization of real time SAD algorithm.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.523-529
• /
• 2016

Stereo matching algorithm is an essential part in computer vision and photography. Accuracy and computational complexity are challenges of stereo matching algorithm. Much research has been devoted to stereo matching based on cost volume filtering of matching costs. Local stereo matching based guided image filtering (GIF) has a computational complexity of O(N), but is still not enough to provide real-time 3-dimensional (3-D) video services. The proposed algorithm concentrates reduction of computational complexity using the concept of fast guided image filter, which increase the speed up to $O(N/\small{s}^2)$ with a sub-sampling ratio $\small{s}$. Experimental results indicated that the proposed algorithm achieves effective local stereo matching as well as a fast execution time for 3-D video service.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.05a
• /
• pp.175-175
• /
• 2004

애니메이션과 컴퓨터 게임 등의 다양한 산업에 이용되고 있는 모션캡쳐 시스템은 현재 카메라를 이용한 고가의 고속 카메라를 사용하여 일반인들이 범용으로 사용하기에는 많은 어려움이 따른다. 이에 본 연구에서는 고가의 고속카메라를 사용하는 대신 저가의 PSD 센서를 사용하여 광학방식의 모션캡쳐 시스템을 구성하였다. 또한 시스템에서 획득한 3 차원 데이터의 정확성을 위해 일반적으로 CCD 카메라에 사용되어지는 카메라 보정 알고리즘을 PSD 모션캡쳐 시스템에 적용하여 손쉽게 보정을 하면서 적은 오차를 가질 수 있는 방법을 제시하였다.(중략)

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.454-457
• /
• 2004

AGV for FMS must be detected an obstacle. Therefore, many studies have been advanced, and recently, the ultra sonic sensor is used for this. However, the new method has to be developed because the ultra-sonic-sensor has many problems as a noise in factory, an directional error and detection of the obstacle size. So, we study the fast stereo vision system that can give more information to obstacles for intelligent AGV system. For this, the simulated AGV system was made with two CCD cameras in front to get the stereo images, and the threshold process by color information (intensity and chromaticity) and structure stereo matching method were constructed.

• 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 the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.31-39
• /
• 2006

This paper presents a novel approach to real-time recognition of 3D environment and objects for various applications such as intelligent robots, intelligent vehicles, intelligent buildings,..etc. First, we establish the three fundamental principles that humans use for recognizing and interacting with the environment. These principles have led to the development of an integrated approach to real-time 3D recognition and modeling, as follows: 1) It starts with a rapid but approximate characterization of the geometric configuration of workspace by identifying global plane features. 2) It quickly recognizes known objects in environment and replaces them by their models in database based on 3D registration. 3) It models the geometric details the geometric details on the fly adaptively to the need of the given task based on a multi-resolution octree representation. SIFT features with their 3D position data, referred to here as stereo-sis SIFT, are used extensively, together with point clouds, for fast extraction of global plane features, for fast recognition of objects, for fast registration of scenes, as well as for overcoming incomplete and noisy nature of point clouds.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.1-8
• /
• 2008

The belief propagation method that has been studied recently yields good performance in disparity extraction. The method in which a target function is modeled as an energy function based on Markov random field(MRF), solves the stereo matching problem by finding the disparity to minimize the energy function. MRF models provide robust and unified framework for vision problem such as stereo and image restoration. the belief propagation method produces quite correct results, but it has difficulty in real time implementation because of higher computational complexity than other stereo methods. To relieve this problem, in this paper, we propose a fast algorithm of the belief propagation method. Energy function consists of a data term and a smoothness tern. The data term usually corresponds to the difference in brightness between correspondences, and smoothness term indicates the continuity of adjacent pixels. Smoothness information is created from messages, which are assigned using four different message arrays for the pixel positions adjacent in four directions. The processing time for four message arrays dominates 80 percent of the whole program execution time. In the proposed method, we propose an algorithm that dramatically reduces the processing time require in message calculation, since the message.; are not produced in four arrays but in a single array. Tn the last step of disparity extraction process, the messages are called in the single integrated array and this algorithm requires 1/4 computational complexity of the conventional method. Our method is evaluated by comparing the disparity error rates of our method and the conventional method. Experimental results show that the proposed method remarkably reduces the execution time while it rarely increases disparity error.