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

Since our physical world cannot be modeled as rigid body, deformable object models are important. For real-time simulation of elastic object, it must be guaranteed by its exact solution and low-latency computational cost. In this paper, we describe the boundary integral equation formulation of linear elastic body and related boundary element method(BEM). The deformation of elastic body can be effectively solved with 1ow run-time computational costs, using precomputed Green Function and fast low-rank updates based on Capacitance Matrix Algorithm.

• The Journal of Korea Robotics Society
• /
• v.17 no.1
• /
• pp.16-24
• /
• 2022

This paper presents a method that can reduce the computational cost of the hierarchical quadratic programming (HQP)-based robot controller. Hierarchical controllers can effectively manage articulated robots with many degrees of freedom (DoFs) to perform multiple tasks. The HQP-based controller is one of the generic hierarchical controllers that can provide a control solution guaranteeing strict task priority while handling numerous equality and inequality constraints. However, according to a large amount of computation, it can be a burden to use it for real-time control. Therefore, for practical use of the HQP, we propose a method to reduce the computational cost by decreasing the size of the decision variable. The computation time and control performance of the proposed method are evaluated by real robot experiments with a 15 DoFs dual-arm manipulator.

• Journal of Mechanical Science and Technology
• /
• v.20 no.3
• /
• pp.376-381
• /
• 2006

In this paper, the quaternion, the dual Euler, and the direction cosine methods are numerically compared using a non-aerodynamic 6 degree-of-freedom rigid model at all-attitude angles of an aircraft. The dual Euler method turns out to be superior to the others in the applications because it shows better numerical accuracy, stability, and robustness in integration step sizes. The dual Euler method is affordably less efficient than the quaternion method in terms of computational cost. Numerical accuracy and stability, which allow larger integration step sizes, are more critical in modern real-time applications than computational efficiency because of today's increased computational power. If the quaternion method is required because of constraints in computation time, then a suppression mechanism should be provided for algebraic constraint errors which will eventually add computational burden.

• Asia pacific journal of information systems
• /
• v.25 no.4
• /
• pp.626-641
• /
• 2015

Conventional case-based reasoning (CBR) does not perform efficiently for high-volume datasets because of case retrieval time. To overcome this problem, previous research suggested clustering a case base into several small groups and retrieving neighbors within a corresponding group to a target case. However, this approach generally produces less accurate predictive performance than the conventional CBR. This paper proposes a new case-based reasoning method called the clustering-merging CBR (CM-CBR). The CM-CBR method dynamically indexes a search pool to retrieve neighbors considering the distance between a target case and the centroid of a corresponding cluster. This method is applied to three real-life medical datasets. Results show that the proposed CM-CBR method produces similar or better predictive performance than the conventional CBR and clustering-CBR methods in numerous cases with significantly less computational cost.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.557-562
• /
• 2004

For constructing virtual environment it is more natural to model object as deformable body than as rigid body. High accuracy of simulation of model and low-latency computational cost for real-time simulation should be guaranteed. We pre-compute Green function through finite element analysis of deformable body and it is possible to simulate deformation of body in real-time environment using Capacitance Matrix Algorithm. Also, the capacitance matrix algorithm enables to construct the haptic rendering which serves the reaction force through a haptic device. The Newmark scheme is used for the more realistic haptic rendering and dynamic simulation in real-time.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2112-2115
• /
• 2003

The system for the real time face detection is described in this paper. For face verification, support vector machine (SVM) was utilized. Although SVM performs quit well, SVM has a drawback that the computational cost is high because all pixels in a mask are used as an input feature vector of SVM. To resolve this drawback, a method to reduce the dimension of feature vectors using the integer DCT was proposed. Also for the real time face detection applications, low-complexity methods for face candidate detection in a gray image were used. As a result, the accurate face detection was performed in real time.

• Journal of Broadcast Engineering
• /
• v.6 no.2
• /
• pp.169-176
• /
• 2001

Most of the previous video watermarking algorithms cannot be supported by real-time video processing. The maul reason is that in order to develop a robust algorithm the watermarking technique requires a very high computational cost when embedding and extracting the watermark in various frequency domains. Previous embedding methods simultaneously try to compress a video by MPEG and embed a watermark supporting real-time processing. However, In this paper, our proposed algorithm can support real-time processing in both spatial and frequency domains. First. the watermark is created on the courier transform domain, and next is inverse-Fourier-transformed ; then, we directly embed it into the video frame In the spatial domain. This procedure does not require a lot of the computational cost during embedding because of the spatial domain processing. Also, it is possible to support a video stream service and a very robust algorithm from MPEG compression and various geometric attacks.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.68-73
• /
• 2016

An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

• Coupled systems mechanics
• /
• v.11 no.1
• /
• pp.43-54
• /
• 2022

In order to analyse the thermal performance of battery systems in electric vehicles complex simulation models with high computational cost are necessary. Using reduced order methods, real-time applicable model can be developed and used for on-board monitoring. In this work a data driven model of the cooling plate as part of the battery system is built and derived from a computational fluid dynamics (CFD) model. The aim of this paper is to create a meta model of the cooling plate that estimates the temperature at the boundary for different heat flow rates, mass flows and inlet temperatures of the cooling fluid. In order to do so, the cooling plate is simulated in a CFD software (ANSYS Fluent ®). A data driven model is built using the design of experiment (DOE) and various approximation methods in Optimus ®. The model can later be combined with a reduced model of the thermal battery system. The assumption and simplification introduced in this paper enable an accurate representation of the cooling plate with a real-time applicable model.