• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.90-98
• /
• 2013

The stereo system based on local matching is very popular due to its algorithmic simplicity, however it is limited to apply to various applications because it shows poor quality with low matching rates. In this paper, we propose and design a realtime stereo system based on an adaptive support-weight and the system shows low error rates and realtime performance. Generally, in the adaptive support-weight algorithm the intermediate computing results can not be reused to reduce the number of computations. In this research we modify the scheduling to reuse the intermediate results for the better performance by processing rows and columns separately. The nonlinear functions such as exponential or arc tangent have been designed with piecewise linear and step functions by empirical simulations and error analysis. The proposed architecture is composed of 9 processing elements for realtime performance. The proposed stereo system has been designed and synthesized using Donbu Hitek 0.18um standard cell library and can run up to 350Mhz operation frequency (33 frames per second) with 424K gates.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.104-115
• /
• 1999

This paper proposes an efficient method for 3D modeling of a human face from trinocular images by reconstructing face surface using range data. By using a trinocular camera system, we mitigated the tradeoff between the occlusion problem and the range resolution limitation which is the critical limitation in binocular camera system. We also propose an MPC_MBS (Matching Pixel Count Multiple Baseline Stereo) area-based matching method to reduce boundary overreach phenomenon and to improve both of accuracy and precision in matching. In this method, the computing time can be reduced significantly by removing the redundancies. In the model generation sub-pixel accurate surface data are achieved by 2D interpolation of disparity values, and are sampled to make regular triangular meshes. The data size of the triangular mesh model can be controlled by merging the vertices that lie on the same plane within user defined error threshold.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.385-388
• /
• 2000

본 논문에서는 영상처리 기법 중 하나인 이진 영상에 대한 골격화를 이용한 새로운 형상 기술자를 제안한다. 내용기반 영상 검색에서 형상을 이용하는 것은 가장 우세하고 인간이 가장 쉽게 인지할수 있는 방법 중의 하나이다. 형상을 이용한 검색을 위해 서는 인간이 인지하는 형상에 대한 정보를 간략화시킬 수 있는 기술자가 필요하다. 본 논문에서 제안하는 골격을 이용한 형상 기술자는 물체의 중요한 정보 중 하나인 골격을 영상 검색에 이용함으로써 기존의 물체가 갖고 있는 복잡한 형상 정보들을 여러개의 직선의 조합으로 간략하게 표현하고 이를 검색에 사용하는 것이다. 이를 위해서 단순한 골격화 외의 다른 형태학적 영상 처리를 이용하여 효과적인 직선 추출을 위한 여건을 마련한다. 그리고 근사화된 직선들이 추출되면 스케일에 대해 정규화 하여 골격을 이루는 직선들의 양 끝점을 형상 기술자로 얻을 수 있다. 각 특징벡터에 대한 정합은 각각의 회전에 대해 유클리디안 거리를 이용한다. 실험 결과, 제안된 방법이 자세한 부분보다는 대략적인 형상 검색과 동일한 카테고리의 데이타 집합에서 부분적인 변화에 대해 우수한 성능을 나타낸다는 것을 알 수 있다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.7 no.5
• /
• pp.440-446
• /
• 1996

The multiple-ridged circular waveguides is analyzed using Fourier series and the mode matching technique. The enforcement of the boundary conditions yields the simultaneous equations for the field coefficient inside the waveguides. The simultaneous equations are solved to represent a dispersion relation in an analytic series form. The numerical computation is performed to illustrate the behavior of the cutoff wavenumbers in terms of number, length and angle of ridges. The presented series solution is exact and rapidly-convergent so that it is efficient for numerical computation. A simple dispersion relation based on the dominant mode analysis is obtained and is shown to be very accurate for most practical applications.

• Proceedings of the KSRS Conference
• /
• 2009.03a
• /
• pp.7-12
• /
• 2009

고해상도 위성영상을 이용한 DEM 제작의 경우 영상의 센서모델과 정합을 이용한 방식이 일반적으로 사용되어 왔다. 이 방식의 경우 영상에 존재하는 건물 및 도로, 그리고 지역 등에 따라 오류가 발생하게 되며 이는 DEM의 제작 시 공백(Hole)이나, 오류(Blunder)의 원인이 된다 이 방식을 보완하기 위하여, 본 실험에서는 1m 급의 공간해상도를 가지는 스테레오 위성 영상을 이용하여 제작된 고해상도 DEM을 제작해보았으며, 전 세계적으로 제작되어 있는 30m 정확도를 가지는 DTED를 이용하여 동일지역의 DEM의 갱신을 시도하였다. 고해상도 스테레오 위성영상에서 매칭 결과로 구해진 높이 값과 30m DTED와의 결과 비교를 통해 최상위 피라미드 단계에서의 DEM의 제작 시 발생할 수 있는 에러들을 걸러냄으로 정확한 DEM의 생성을 시도하였으며, 새롭게 구해진 DEM의 높이 값을 30m DTED의 높이 값에 근사시켜 기존의 방식보다 더 부드러운 고해상도 DEM의 제작이 가능함을 확인할 수 있었다.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.8 no.1
• /
• pp.72-80
• /
• 1996

Two analytical solutions for oscillations in a rectangular harbour are presented. In this paper, the correct solution is obtained by use of matched asymptotic expansion method, which was first derived by Mei(1989). The other solution derived from eigenfunction expansion method is also presented, in which more accurate numerical integration is employed. In order to check the solutions, amplification factors inside the harbor are calculated and plotted by both analytical methods and numerical boundary integral equation method.

• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.278-288
• /
• 2007

We propose the fast full search algorithm that reduces the computational load of the block matching algorithm which is used for a motion estimation in the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion picture. However we proposed the efficient motion estimation method which is good for the fast and slow motion picture. Firstly, when finding the initial threshold value, we use the expanded predictor that can approximately calculate minimum threshold value. The proposed algorithm estimates the motion in the new search order after partitioning the search window and adapt the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm reduces the computational load 94% in average compared to the conventional spiral full search algorithm without any loss of image quality.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.11 no.4
• /
• pp.29-37
• /
• 1974

Theoretical analysis is carried out for the curtoff wavelength characteristics of rectangular waveguide containing a step-ridge. In order to obtain the cutoff wavelength of step-rigde waveguide, an transmission matriz is formulated by the method of equivalent transverse resonance. The characteristic equation, in which the wavelength is obtainable by the numerical method, is derived from the equation. An approximate determination of the dominant mode fields in step-ridge waveguides at all frequencies has been made. Using these fields, the characteristic impedance equation is derived from power considerations. Analyzing the results of the calculations, the following characteristics are noted. The values of λ /a of TE10 mode increase with decreasing gap lengths and with increasing step width S or S , or both. Experimental results of cutoff characteristics are in good agreement with the theoretical analusis. It is shown that a waveguide within which a step-ridge is placed has a lower cutoff frequency and impedance than empty guide without it. Therefore, the role of a step-ridge guide is to broadening the bandwidth 2 to 3 times more than that of an empty guide of the same demension.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.520-529
• /
• 2005

A feature-based 3D modeling algorithm is presented in this paper. Since conventional methods use depth-based techniques, they need much time for the image matching to extract depth information. Even feature-based methods have less computation load than that of depth-based ones, the calculation of modeling error about whole pixels within a triangle is needed in feature-based algorithms. It also increase the computation time. Therefore, the proposed algorithm consists of three phases, which are an initial 3D model generation, model evaluation, and model refinement phases, in order to acquire an efficient 3D model. Intensity gradients and incremental Delaunay triangulation are used in the Initial model generation. In this phase, a morphological edge operator is adopted for a fast edge filtering, and the incremental Delaunay triangulation is modified to decrease the computation time by avoiding the calculation errors of whole pixels and selecting a vertex at the near of the centroid within the previous triangle. After the model generation, sparse vertices are matched, then the faces are evaluated with the size, approximation error, and disparity fluctuation of the face in evaluation stage. Thereafter, the faces which have a large error are selectively refined into smaller faces. Experimental results showed that the proposed algorithm could acquire an adaptive model with less modeling errors for both smooth and abrupt areas and could remarkably reduce the model acquisition time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.