• Korean Journal of Computational Design and Engineering
• /
• v.8 no.3
• /
• pp.133-140
• /
• 2003

This paper describes a Multi-step Digitizing Method and Reverse Model generation algorithm for improvement of reverse engineering accuracy. Reverse engineering is the process of reproducing computational model by directly extracting geometric information on the physical objects. For the improvement of measuring data accuracy, we propose a multi-step digitizing method. First, measuring cloud-of-point by use of a laser scanning system. Second, gathering digitizing data by a scanning touch probe. Fine digitizing plan generated from coarse surface model directly from the cloud-of-point and it allows CMM more accurate scanning data. Finally in this paper we propose the algorithm of generating NURB surface from more accurate measuring points.

• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.3
• /
• pp.182-190
• /
• 2021

Computational simulations of turbulent flows around a model ship have been performed to investigate an influence of TVD schemes on the accuracy of advective terms associated with ship resistances. Several TVD schemes including upwind, second-order upwind, vanLeer, and QUICK as well as a nonTVD linear scheme were studied by examining temporal and spatial characteristics of accuracy transition in adjacent cells to the hull. Even though vanLeer scheme was the most accurate among TVD schemes in both structured and unstructured grid systems, the ratio of accuracy switch from 2^nd order to 1^st order in vanLeer scheme was considerable compared with the 2^nd order linear scheme. Also, the accuracy transition was observed to be overally scattered in the unstructured grid while the accuracy transition in the structured grid appeared relatively clustered. It concluded that TVD schemes had to be carefully used in computational simulations of turbulent flows around a model ship due to the loss of accuracy despite its attraction of numerical stability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.305-326
• /
• 2019

Discriminative correlation filter (DCF) based tracking algorithms have recently shown impressive performance on benchmark datasets. However, amount of recent researches are vulnerable to heavy occlusions, irregular deformations and so on. In this paper, we intend to solve these problems and handle the contradiction between accuracy and real-time in the framework of tracking-by-detection. Firstly, we propose an innovative strategy to combine the template and color-based models instead of a simple linear superposition and rely on the strengths of both to promote the accuracy. Secondly, to enhance the discriminative power of the learned template model, the spatial regularization is introduced in the learning stage to penalize the objective boundary information corresponding to features in the background. Thirdly, we utilize a discriminative multi-scale estimate method to solve the problem of scale variations. Finally, we research strategies to limit the computational complexity of our tracker. Abundant experiments demonstrate that our tracker performs superiorly against several advanced algorithms on both the OTB2013 and OTB2015 datasets while maintaining the high frame rates.

• Bulletin of the Korean Chemical Society
• /
• v.29 no.2
• /
• pp.363-371
• /
• 2008

As a computational method for the discovery of the effective agonists for PPARd, we address the usefulness of molecular dynamics free energy (MDFE) simulation with explicit solvent in terms of the accuracy and the computing cost. For this purpose, we establish an efficient computational protocol of thermodynamic integration (TI) that is superior to free energy perturbation (FEP) method in parallel computing environment. Using this protocol, the relative binding affinities of GW501516 and its derivatives for PPARd are calculated. The accuracy of our protocol was evaluated in two steps. First, we devise a thermodynamic cycle to calculate the absolute and relative hydration free energies of test molecules. This allows a self-consistent check for the accuracy of the calculation protocol. Second, the calculated relative binding affinities of the selected ligands are compared with experimental IC50 values. The average deviation of the calculated binding free energies from the experimental results amounts at the most to 1 kcal/mol. The computational efficiency of current protocol is also assessed by comparing its execution times with those of the sequential version of the TI protocol. The results show that the calculation can be accelerated by 4 times when compared to the sequential run. Based on the calculations with the parallel computational protocol, a new potential agonist of GW501516 derivative is proposed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.30-33
• /
• 2023

The recent scholarly focus has been directed towards the expeditious and accurate detection of salient objects, a task that poses considerable challenges for resource-limited edge devices due to the high computational demands of existing models. To mitigate this issue, some contemporary research has favored inference speed at the expense of accuracy. In an effort to reconcile the intrinsic trade-off between accuracy and computational efficiency, we present novel model for salient object detection. Our model incorporate group-wise attentive module within the decoder of the encoder-decoder framework, with the aim of minimizing computational overhead while preserving detection accuracy. Additionally, the proposed architectural design employs attention mechanisms to generate boundary information and semantic features pertinent to the salient objects. Through various experimentation across five distinct datasets, we have empirically substantiated that our proposed models achieve performance metrics comparable to those of computationally intensive state-of-the-art models, yet with a marked reduction in computational complexity.

• Journal of Korea Multimedia Society
• /
• v.23 no.1
• /
• pp.31-42
• /
• 2020

During the 4th Industrial Revolution, service platforms utilizing diverse contents are emerging, and research on recommended systems that can be customized to users to provide quality service is being conducted. hybrid recommendation systems that provide high accuracy recommendations are being researched in various domains, and various filtering techniques, machine learning, and deep learning are being applied to recommended systems. However, in a recommended service environment where data must be analyzed and processed real time, the accuracy of the recommendation is important, but the computational speed is also very important. Due to high level of model complexity, a hybrid recommendation system or a Deep Learning-based recommendation system takes a long time to calculate. In this paper, a Cascade-hybrid recommended algorithm is proposed that can reduce the computational time while maintaining the accuracy of the recommendation. The proposed algorithm was designed to reduce the complexity of the model and minimize the computational speed while processing sequentially, rather than using existing weights or using a hybrid recommendation technique handled in parallel. Therefore, through the algorithms in this paper, contents can be analyzed and recommended effectively and real time through services such as SNS environments or shared economy platforms.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.349-358
• /
• 2012

Over a wireless sensor network (WSN), accurate localization of sensor nodes is an important factor in enhancing the association between location information and sensory data. There are many research works on the development of a localization algorithm over three-dimensional (3D) space. Recently, the complexity-reduced 3D trilateration localization approach (COLA), simplifying the 3D computational overhead to 2D trilateration, was proposed. The method provides proper accuracy of location, but it has a high computational cost. Considering practical applications over resource constrained devices, it is necessary to strike a balance between accuracy and computational cost. In this paper, we present a novel 3D localization method based on the received signal strength indicator (RSSI) values of four anchor nodes, which are deployed in the initial setup process. This method provides accurate location estimation results with a reduced computational cost and a smaller number of anchor nodes.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.10a
• /
• pp.47-50
• /
• 2006

In the aeroacoustic application of computational fluid dynamics, the physical phenomena like the crackle in the unsteady compressible jets should be based on very time-accurate numerical solution. The accuracy of the present numerical scheme is extended to the fifth order, using the WENO filter to the sixth-order central difference computation. However, the computational capacity is very restricted by the environment of computational power, so therefore the quadrilateral adaptive grids technique is introduced for this high-order accuracy scheme. The first problem is the multi-dimensional interpolation between fine and coarse grids. Some general benchmark problems are solved to show the effectiveness of this method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2497-2517
• /
• 2020

For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

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