• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.597-600
• /
• 1999

In this paper, we propose a fast object-tracking algorithm in a moving picture. The proposed object-tracking algorithm is based on a projection scheme. More specifically, to alleviate the computational complexities of the previous motion estimation methods, we propose to use the projected row and column 1-D image data to extract the motion information. Experimental results show that the proposed method can detect the motion of an object fairly well with reduced computational time.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.162-167
• /
• 2005

A 3D solid element mesh generation algorithm was newly developed. 3D surface points of global rectangular coordinates were supplied by a 3D laser scanner. The algorithm is strait forward and simple but it generates hexahedral solid elements. Then, the surface rectangular elements were generated from the solid elements. The key of the algorithm is elimination of unnecessary elements and 3D boundary surface fitting using given 3D surface point data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8C
• /
• pp.801-805
• /
• 2006

A normalization approach to coefficient adaptation in the escalator(ESC) filter structure that conventionally employs least mean square(LMS) algorithm is introduced. Using Taylor's expansion of the local error signal, a normalized form of the ESC-LMS algorithm is derived. Compared with the computational complexity of the conventional ESC-LMS algorithm employs input power estimation for time-varying convergence coefficient using a single-pole low-pass filter, the computational complexity of the proposed method can be reduced by 50% without performance degradation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.483-488
• /
• 2002

In this paper numerical algorithm for the continuum large crack model is proposed based on the return-mapping formulation. The numerical test results show that the present algorithm works appropriately under cyclic loading. It is also shown that in continuum damage models a large crack model to prevent excessive tensile plastic strain should be used to have realistic cyclic loading simulation results.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.278-281
• /
• 2011

The global coordinates generated from Isomap algorithm provide a simple way to analyze and manipulate high dimensional observations in terms of their intrinsic nonlinear degrees of freedom. Thus, Isomap can find globally meaningful coordinates and nonlinear structure of complex data sets, while neither principal component analysis (PCA) nor multidimensional scaling (MDS) are successful in many cases. It is demonstrated that the adapted Isomap algorithm successfully enhances the quality of pattern classification for damage identification in various numerical examples.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.169-173
• /
• 2001

Presented in this paper is a CPO tool-path linking procedure optimizing technological objectives, such as dealing with islands (positive and negative) and minimizing tool retractions, drilling holes and slotting. Main features of the proposed algorithm are as follows; 1) a data structure, called a 'TPE-net', is devised to provide information on the parent/child relationships among the tool-path-elements, 2) the number of tool retractions is minimized by a 'tool-path-element linking algorithm'fading a tour through the TPE-net, and 3) the number of drilling holes is minimized by making use of the concept of the 'free space'.

• Computational Structural Engineering
• /
• v.7 no.3
• /
• pp.167-176
• /
• 1994

A local remeshing algorithm using Delaunay property is developed for the analysis on the phenomenon of quasi-static crack propagation, which is a typical problem of accompanying constantly varying geometry. The algorithm performs both remeshing and refinement. The use of M-integral is demonstrated to simulate crack propagation under mixed mode with the edge spalling problem.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.672-679
• /
• 2021

We propose a high-speed layer-based algorithm for synthesizing computer-generated holograms (CGHs), featuring sparsity-based image segmentation and computational parallelism. The sparsity-based image segmentation of layer-based three-dimensional scenes leads to considerable improvement in the efficiency of CGH computation. The efficiency enhancement of the proposed algorithm is ascribed to the field localization of the fast Fourier transform (FFT), and the consequent reduction of FFT computational complexity.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.5
• /
• pp.249-257
• /
• 2022

This paper presents an improved computational framework for the direct-solution-based finite element tearing and interconnecting (FETI) algorithm. The FETI-local algorithm is further improved herein, and localized Lagrange multipliers are used to define the interface among its subdomains. Selective inverse entry computation, using a property of the Boolean matrix, is employed for the computation of the subdomain interface stiffness and load, in which the original FETI-local algorithm requires a full matrix inverse computation of a high computational cost. In the global interface computation step, the original serial computation is replaced by a parallel multi-frontal method. The performance of the improved FETI-local algorithm was evaluated using a numerical example with 64 million degrees of freedom (DOFs). The computational time was reduced by up to 97.8% compared to that of the original algorithm. In addition, further stable and improved scalability was obtained in terms of a speed-up indicator. Furthermore, a performance comparison was conducted to evaluate the differences between the proposed algorithm and commercial software ANSYS using a large-scale computation with 432 million DOFs. Although ANSYS is superior in terms of computational time, the proposed algorithm has an advantage in terms of the speed-up increase per processor increase.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.382-395
• /
• 2017

Learning computational thinking is very important in programming education. Computational thinking refers to the problem solving ability based on the theories of computer science, indicating the importance of algorithm thinking. That is the reason for focusing on promoting creativity and improving the problem solving ability of the students in programming education. This paper commented the elements to consider for teachers when teaching computational thinking to elementary school students with online coding education website 'code.org' that helps beginners have easy programming experiences based on the characteristics of the website, and proposed the appropriate teaching methods.