• Journal of the Korean Magnetics Society
• /
• v.18 no.1
• /
• pp.36-38
• /
• 2008

We calculate the electron scattering amplitude with reduced angular momentum expansion(RAME) and compare it with the plane wave approximation. By using WKB approximation it is shown that the curvature correction factor given by RAME is originated from the source wave centrifugal potential energy. The factor also can be understood as an effective wave number correction factor in plane wave approximation. Angular momentum and its relationship with scattering amplitude is explicitly shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.6
• /
• pp.322-332
• /
• 2014

This paper proposes a robust lane detection algorithm for non-flat roads by combining a piecewise linear model and dynamic programming. Compared with other lane models, the piecewise linear model can represent 3D shapes of roads from the scenes acquired by monocular camera since it can form a curved surface through a set of planar road. To represent the real road, the planar roads are created by various angles and positions at each section. And dynamic programming determines an optimal combination of planar roads based on lane properties. Experiment results demonstrate the robustness of proposed algorithm against non-flat road, curved road, and camera vibration.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.7
• /
• pp.1-7
• /
• 1989

For H-polarized incident plane wave, an exact integral expression for the scattered field by an inversely tapered resistive half plane is obtained by using Kontorovich-Lebedev transform. Uniform asymptotic results available for all angles are obtained, and non-uniform asymptotic results which provide the ray-optical interpretation of the calculated scattered field are also obtained. The edge diffraction patterns for several values of inverse proportionality of resistivity are shown. We find out that the results are in agreement with physical reasoning.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.140-146
• /
• 1989

An efficient quantization and encoding of BTC (Block Truncation Coding) parameters {($Y_{\alpha},\;Y_{\beta}),\;P_{{\beta}/{\beta}}$} are investigated, In our algorithm 4${\times}$4 blocks are classified into flat or edge block. While edge block is represented by two approximation level $Y_{\alpha},\;Y_{\beta}$ with label plane $P_{{\beta}/{\beta}}$, flat block is represented by single approximation level Y. The approximation levels Y, $Y_{\alpha}$ and $Y_{\beta}$ are encoded by predictive quatization specially designed, and the label plane $P_{{\beta}/{\beta}}$ is tried to be encoded using stored 32 reference plantes. The performance of the proposed scheme has appeared comparable to much more complex transform coding in terms of SNR, although it requires more study on the representation of small slope in background.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3C
• /
• pp.264-270
• /
• 2010

Non-planar screens such as cylinder and sphere shaped screens are widely used for high-resolution immersive visualization environments. An existing method employs quadric matrix that maps an image onto a curved screen. However if the shape of the screen changes or moves, the quadric matrix will not be valid. In this paper, we assume that the screen is a quadric shape and the screen movement or change are relatively small. Then we propose to use a piecewise planar approximations for the screen to compensate for the geometric distortion on a non-planar screen. We demonstrate the effectiveness and efficiency of the proposed method through experiments.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.2 s.40
• /
• pp.3-14
• /
• 2007

This study proposes an automatic method to generate 3D building models using a draft map, which is an intermediate product generated during the map generation process based on aerial photos. The proposed method is to generate a terrain model, roof models, and wall models sequentially from the limited 3D information extracted from an existing draft map. Based on the planar fitting error of the roof corner points, the roof model is generated as a single planar facet or a multiple planar structure. The first type is derived using a robust estimation method while the second type is constructed through segmentation and merging based on a triangular irregular network. Each edge of this roof model is then projected to the terrain model to create a wall facet. The experimental results from its application to real data indicates that the building models of various shapes in wide areas are successfully generated. The proposed method is evaluated to be an cost and time effective method since it utilizes the existing data.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.22 no.3
• /
• pp.163-170
• /
• 2010

Both scatterer method and transfer matrix method are compared to analyze their characteristics, which are wave propagation models due to topographic change based on plane wave approximation. Results from the scatterer method are closer to the results obtained by the more accurate existing models and it is appraised that the scatterer method gives the clearer explanation about physical process involved in the wave transformation. Since both methods have analytical solutions, in the computational point of view they are very fast and easy to be implemented. Both methods give a good prediction for wave scattering by relatively simple bedform.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.901-903
• /
• 2005

본 논문에서는 평면 상에 두 볼록집합 P와 Q가 주어졌을 때, P를 강체운동 하에서 수평 이동 및 회전이동하여 Q와 겹치는 영역이 근사적으로 최대가 되는 알고리즘을 제시한다. 임의의 양의 상수 $\epsilon$이 주어졌을 때, 본 알고리즘은 가장 많이 겹치는 넓이의 $1-\epsilon$ 배를 보장하는 P의 강체운동을 $O((1/\epsilon)$ 번의 기하 질의 와 $O((1/{\epsilon}^2)log(1/$\epsilon)) 시간 내에 구할 수 있다. 특히 P와 Q가 볼록다각형 일 때, $O((1/\epsilon)log\;n+(1/{\epsilon}^2)log(1/\epsilon))$ 시간에 구한다. 만약 수평 이동만 사용할 경우는 $O((1/\epsilon)log\;n+(1/\epsilon)log(1/\epsilon))$ 시간에 구할 수 있다.

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

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.