• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.67-72
• /
• 2019

This paper proposes a computer vision-based banknote recognition system intended to assist the blind. This system is robust and fast in recognizing banknotes on videos recorded with a smartphone on real-life scenarios. To reduce the computation time and enable a robust recognition in cluttered environments, this study segments the banknote candidate area from the background utilizing a technique called Pixel-Based Adaptive Segmenter (PBAS). The Speeded-Up Robust Features (SURF) interest point detector is used, and SURF feature vectors are computed only when sufficient interest points are found. The proposed algorithm achieves a recognition accuracy of 98%, a 100% true recognition rate and a 0% false recognition rate. Although Korean banknotes are used as a working example, the proposed system can be applied to recognize other countries' banknotes.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.46.1-46.1
• /
• 2019

We present an accurate and efficient method to calculate the gravitational potential of an isolated system in three-dimensional Cartesian and cylindrical coordinates subject to vacuum (open) boundary conditions. Our method consists of two parts: an interior solver and a boundary solver. The interior solver adopts an eigenfunction expansion method together with a tridiagonal matrix solver to solve the Poisson equation subject to the zero boundary condition. The boundary solver employs James's method to calculate the boundary potential due to the screening charges required to keep the zero boundary condition for the interior solver. A full computation of gravitational potential requires running the interior solver twice and the boundary solver once. We develop a method to compute the discrete Green's function in cylindrical coordinates, which is an integral part of the James algorithm to maintain second-order accuracy. We implement our method in the {\tt Athena++} magnetohydrodynamics code, and perform various tests to check that our solver is second-order accurate and exhibits good parallel performance.

• Journal of Information Technology Services
• /
• v.18 no.1
• /
• pp.79-90
• /
• 2019

Maximizing energy efficiency minimizes the energy consumption of computation, storage and communications required for IT services, resulting in economic and environmental benefits. Recent advancement of flash and next generation non-volatile memory technology and price decrease of those memories have led to the rise of so-called AFA (All-Flash Array) storage devices made of flash or next generation non-volatile memory. Currently, the AFA devices are rapidly replacing traditional storages in the high-performance servers due to their fast input/output characteristics. However, it is not well known how effective the energy efficiency of the AFA devices in the real world. This paper shows input/output performance and power consumption of the AFA devices measured on the Linux XFS file system via experiments and discusses energy efficiency of the AFA devices in the real world.

• Journal of the Korean Society of Industry Convergence
• /
• v.23 no.6_1
• /
• pp.889-896
• /
• 2020

We describe a new approach to the analyze the control performance of robotic manipulator based on the monitoring system. The structure of monitoring simulator is consist of seven modes such as control state mode, coordinate mode, input/output mode, program mode, parameters mode, and track mode. The applied control algorithme consists of an time varying feed-forward and feedback controller. The proposed scheme is simple in structure, fast in computation, and suitable for real-time implimemtation. Moreover, this scheme does not require any accurate dynamic modeling and values of parameters. Performance of the proposed monitoring system is illustrated by simulation and experiment for robot manipulator with six degrees of freedom.

• The Pure and Applied Mathematics
• /
• v.28 no.4
• /
• pp.329-341
• /
• 2021

In this study, we consider an efficient and accurate finite difference method for the four underlying asset equity-linked securities (ELS). The numerical method is based on the operator splitting method with non-uniform grids for the underlying assets. Even though the numerical scheme is implicit, we solve the system of discrete equations in explicit manner using the Thomas algorithm for the tri-diagonal matrix resulting from the system of discrete equations. Therefore, we can use a relatively large time step and the computation of the ELS option pricing is fast. We perform characteristic computational test. The numerical test confirm the usefulness of the proposed method for pricing the four underlying asset equity-linked securities.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.100-104
• /
• 1998

This paper describes the real-time implementation of an adaptive controller fur the robotic manipulator. Digital signal processors(DSPs) are special purpose micro-processors that are particularly powerful for intensive numerical computations involving sums and products of variables. TMS320C50 chips are used in implementing real time adaptive control algorithms to provide an enhanced motion for robotic manipulators. In the proposed scheme, adaptation laws are derived from the improved Lyapunov second stability analysis based on the direct adaptive control theory. The adaptive controller consists of an adaptive feedforward controller and feedback controller. The proposed control scheme is simple in structure, fast in computation, and suitable for real-time control. Moreover, this scheme does not require any accurate dynamic modeling, nor values of manipulator parameters and payload. Performance of the adaptive controller is illustrated by simulation and experimental results for a assembling robot.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05a
• /
• pp.49-52
• /
• 2004

Scalar multiplication is the back-bone operation in the elliptic curve cryptosystem. Quad-and-add algorithm replaced the traditional double-and-add algorithm to compute the scalar multiplication. In this paper, we introduce the method of utilizing the point quadruple scalar operation in the elliptic curve cryptosystem. Induced expressions were applied to real cryptosystem and proven at C language level. Point quadruple operation can be utilized to fast and efficient computation in the elliptic curve cryptosystem.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.250-253
• /
• 2011

Chip manufacture nowadays turned their attention from accelerating uniprocessors to integrating multiple cores on a chip. Moreover desktop graphic hardware is now starting to support general purpose computation. Desktop users are able to use multi-core CPU and GPU as a high performance computing resources these days. However exploiting parallel computing resources are still challenging because of lack of higher programming abstraction for parallel programming. The 2-dimensional discrete cosine transform (2D-DCT) algorithms are most computational intensive part of JPEG encoding. There are many fast 2D-DCT algorithms already studied. We implemented several algorithms and estimated its runtime on multi-core CPU and GPU environments. Experiments show that data parallelism can be fully exploited on CPU and GPU architecture. We expect parallelized DCT bring performance benefit towards its applications such as JPEG and MPEG.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.67-76
• /
• 1996

In the present paper we propose two new improved iterative restoration algorithms. One is to accelerate convergence of the steepest descent method using the improved search directions, while the other accelerates convergence by using preconditioners. It is also shown that the proposed preconditioned algorithm can accelerate iteration-adaptive iterative image restoration algorithm. The preconditioner in the proposed algorithm can be implemented by using the FIR filter structure, so it can be applied to practical application with manageable amount of computation. Experimental results of the proposed methods show good perfomance improvement in the sense of both convergence speed and quality of the restored image. Although the proposed methods cannot be directly included in spatially-adaptive restoration, they can be used as pre-processing for iteration-adaptive algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.209-220
• /
• 2004

The main feature of H.264 standard against conventional video standards is the high coding efficiency and the network friendliness. In spite of these outstanding features, it is not easy to implement H.264 codec as a real-time system due to its high requirement of memory bandwidth and intensive computation. Although the variable block size motion compensation using multiple reference frames is one of the key coding tools to bring about its main performance gain, it demands substantial computational complexity due to SAD (Sum of Absolute Difference) calculation among all possible combinations of coding modes to find the best motion vector. For speedup of motion estimation process, therefore, this paper proposes fast algorithms for both integer-pel and fractional-pel motion search. Since many conventional fast integer-pel motion estimation algorithms are not suitable for H.264 having variable motion block sizes, we propose the motion field adaptive search using the hierarchical block structure based on the diamond search applicable to variable motion block sizes. Besides, we also propose fast fractional-pel motion search using small diamond search centered by predictive motion vector based on statistical characteristic of motion vector.