• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.484-487
• /
• 1989

A fast stereo algorithm for 3D depth estimation is presented. We propose an on-line stereo matching technique, by which the flows of stereo image signals are dynamically controlled to satisfy the matching condition of intensity functionals. The disparity is rapidly estimated from the control of. the signal flows and 3D depth is determined from the disparity.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.03a
• /
• pp.207-212
• /
• 1997

In estimating the formability of sheet metal, the stereo vision system contributes the accuracy of strain of sheet metal, the convenience in measuring the strain of sheet metal, and the handiness in preparing the forming limit diagram by calculating the 3D values and strain of sheet metal. The algorithm has been developed so that the 3D-coordinate values of sheet metal could be calculated by image processing which is composed of camera calibration, and the stereo matching of images in two viewpoints. By comparing with experiments, the possibility and the convenience of algorithm has been verified, which could calculate the 3D-coordinate values of sheet metal automatically by using the preprocessing of the original image of sheet metal, which had the noise before adjusting the camera calibration and the stereo matching algorithm.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.777-780
• /
• 2003

We have tried to create a vision system like human eye for a long time. We have obtained some distinguished results through many studies. Stereo vision is the most similar to human eye among those. This is the process of recreating 3-D spatial information from a pair of 2-D images. In this paper, we have designed a stereo matching algorithm based on systolic array architecture using edges and pixel data. This is more advanced vision system that improves some problems of previous stereo vision systems. This decreases noise and improves matching rate using edges and pixel data and also improves processing speed using high integration one chip FPGA and compact modules. We can apply this to robot vision and automatic control vehicles and artificial satellites.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.173-180
• /
• 2005

This paper proposes an effective algorithm that combines both the stereo matching and the marching cube algorithm. By applying the stereo matching technique to an image obtained from various angles, 3D geometry data are acquired, and using the camera extrinsic parameter, the images are combined. After reconstructing the combined data into mesh using the image index, the normal vector equivalent to each point is obtained and the mesh smoothing is processed. This paper describes the successive processes and techniques on the 3D mesh reconstruction, and by proposing the intermediate iso- surface algorithm. Therefore it improves the 3D data instability problem caused when using the conventional marching cube algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.339-342
• /
• 2002

The feature points in the uncalibrated stereo vision should represent all the characteristics of an image in multiple resolution, have high precision, and have the robustness against mismatching. This paper proposed an algorithm which detects the corner points in multi-resolution for stereo computer vision. The algorithm has sub-pixel precision, rejects the mismatched points, and corrects the lens distortion. We show the performance of the algorithm by estimating the homography with it.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• v.11 no.2
• /
• pp.447-453
• /
• 2006

This paper presents an area-based stereo algorithm suitable to real time applications. The core of the algorithm depends on the uniqueness constraint and on a matching process that allows for rejecting previous matches. The proposed approach is compared with the left right consistency constraint, being the latter the basic method for detecting unreliable matches in many area-based stereo algorithms. We used the watermelon and tomatoes for experiments.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.202-204
• /
• 2006

In this paper, the detection scheme of the spatial coordinates based on stereo camera for a Transformation algorithm of an Leg-wheel Hexapod Robot is proposed. Robot designed as can have advantages that do transfer possibility fast mobility in flat topography and uneven topography through walk that use wheel drive. In the proposed system, using the disparity data obtained from the left and right images captured by the stereo camera system and the perspective transformation between a 3-D scene and an image plane, depth information can be detected. Robot uses construed environmental data and transformation algorithm, decide wheel drive and leg waik, and can calculate width of street and regulate width of robot.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2389-2392
• /
• 2005

We present fast stereo matching algorithm using edge projection. Traditional stereo matching algorithm uses 2D template for the search of corresponding point thus it requires huge the computational cost. In this paper, we reduce the 2D search problem into 1D using edge projection along vertical and horizontal direction inside the region of interest. Also, by accumulation of edge projection along vertical and horizontal direction, the edge projection within the region of interest could simply be obtained by just subtracting two values. Experimental results show that matching algorithm using edge projection also gives comparable discriminating power compared to that of using intensity.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.5
• /
• pp.179-186
• /
• 2021

For stereo matching based on deep learning, the design of network structure is crucial to the calculation of matching cost, and the time-consuming problem of convolutional neural network in image processing also needs to be solved urgently. In this paper, a method of stereo matching using sparse loss volume in parallax dimension is proposed. A sparse 3D loss volume is constructed by using a wide step length translation of the right view feature map, which reduces the video memory and computing resources required by the 3D convolution module by several times. In order to improve the accuracy of the algorithm, the nonlinear up-sampling of the matching loss in the parallax dimension is carried out by using the method of multi-category output, and the training model is combined with two kinds of loss functions. Compared with the benchmark algorithm, the proposed algorithm not only improves the accuracy but also shortens the running time by about 30%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2388-2396
• /
• 2012

This paper is on an simplified orthogonal projection method which cancel the acoustic echo signals in the stereo acoustic echo canceller. Comparing with the NLMS algorithm which is widely used for simplicity and stability, it shows that this method has the improvement of the convergence performances for signals with the high auto-correlation, and has small computational quantities. To verify the convergence characteristics of the proposed algorithm, we simulated about various input signals. And we compared the results of simulation for this algorithm with the ones for the NLMS algorithm. By these works, it was proved that the stereo acoustic echo canceller adopting the proposed algorithm shows about 3dB more high ERLE than the NLMS algorithm for the white noise signals, and 5dB for the colored voice signals.