• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.720-725
• /
• 2008

This paper proposes a system architecture for USN with a service robot to provide more active assisted living services for elderly persons by monitoring their mental and physical well-being with USN environments at home, hospital, or silver town. Sensors embedded in USN are used to detect preventive measures for chronic disease. Logged data are transferred to main controller of a service robot via wireless channel in which the analysis of data is performed. For the purpose of handling emergency situations, it needs real-time processing on gathering variety sensor data, routing algorithms for sensor nodes to a moving sink node and processing of logged data. This paper realized multi-hop sensor network to detect user movements with biometric data transmission and performed algorithms on Xenomai, a real-time embedded Linux. To leverage active sensing, a mobile robot is used of which task was implemented with a priority to process urgent data came from the sink-node. This software architecture is anticipated to integrate sensing, communication and computing with real-time manner. In order to verify the usefulness of a proposed system, the performance of data transferring and processing on a real-time OS with non real-time OS is also evaluated.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.41 no.5
• /
• pp.367-374
• /
• 2017

The goal of this study was to develop control algorithms to improve the steering performance of a 120-ton all-terrain crane. To accomplish this, a hydraulic steering system for the crane was modeled using AMESim software, and a PID steering control algorithm was designed in the MATLAB/Simulink environment. The performance of the designed controller was verified through multiphysics co-simulations based on a real-time simulator.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.123-128
• /
• 2016

In manufacturing processing of a secondary battery, the visual inspection system is studied and developed to check the surface defects of the electrode plates. It consists of two parts, one is the hardware control and the other software implementation. The former is made up to the system configuration and the design of the optical system, the illuminations and the controllers. The latter is the detection algorithms of the surface defects. This system achieves the quality improvement of the electrode process and the price competitiveness. By using the proposed defects detection algorithms this system demonstrates the high reliability of spot, line, manhole, extraneous substance, scratch, and crater defect of a electrode plate surface.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.96-105
• /
• 2015

This paper proposes a DSP optimization solution of rain detection and removal algorithm. We propose rain detection and removal algorithms considering camera motion, and also presents optimization results in algorithm level and DSP level. At algorithm level, this paper utilizes a block level binary pattern analysis, and reduces the operation time by using the fast motion estimation algorithm. Also, the algorithm is optimized at DSP level through inter memory optimization, EDMA, and software pipelining for real-time operation. Experiment results show that the proposed algorithm is superior to the other algorithms in terms of visual quality as well as processing speed.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.649-659
• /
• 2017

Typically, a smart car is equipped with access to the Internet and a wireless local area network. Moreover, a smart car is equipped with a global positioning system (GPS) based navigation system that presents a map to a user for recommending the shortest path to a desired destination. This paper presents the design and implementation of a real-time shortest path search system for directed and dynamic roads. Herein, we attempt to simulate real-world road environments, while considering changes in the ratio of directed roads and in road conditions, such as traffic accidents and congestions. Further, we analyze the effect of the ratio of directed roads and road conditions on the communication cost between the server and vehicles and the arrival times of vehicles. In this study, we compare and analyze distance-based shortest path algorithms and driving time-based shortest path algorithms while varying the number of vehicles to search for the shortest path, road conditions, and ratio of directed roads.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1178-1178
• /
• 1999

A spatial join has the property that its execution time exponentially increases in proportion to the number of spatial objects. Recently, there have been many attempts for improving the performance of the spatial join by using parallel processing schemes, In the case of executing parallel spatial join using the parallel machine with shared disk architecture, the disk bottleneck of parallel processing of spatial join worsens in comparison with sequential spatial join. This paper presents the algorithms of task creation and assignment to reduce the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing between processors, This paper proposes object caching which is a higher level of abstraction than page caching, and uses it to do creation and assignment of tasks according to temporal and spatial localities for minimizing disk access time. The object caching shows the performance improvement of 50%. The task creation and assignment using localities gives the gain of 30% and 20%. Overall performance evaluation of the proposed algorithms shows 7.2 times speed up than those of sequential execution of spatial joins.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.7
• /
• pp.327-331
• /
• 2008

Optimal Extension Fields (OEFs) are finite fields of a special form which are very useful for software implementation of elliptic curve cryptosystems. Bailey and Paar introduced efficient OEF arithmetic algorithms including the $p^ith$ powering operation, and an efficient algorithm to construct OEFs for cryptographic use. In this paper, we give a counterexample where their $p^ith$ powering algorithm does not work, and show that their OEF construction algorithm is faulty, i.e., it may produce some non-OEFs as output. We present improved algorithms which correct these problems, and give improved statistics for the number of OEFs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.147-161
• /
• 2003

Video object segmentation is one of the core technologies for content-based real-time MPEG-4 encoding system. For real-time requirement, the segmentation algorithm should be fast and accurate but almost all existing algorithms are computationally intensive and not suitable for real-time applications. The MPEG-4 VM(Verification Model) has provided basic algorithms for MPEG-4 encoding but it has many limitations in practical software development, real-time camera input system and compression efficiency. In this paper, we implemented the preprocessing system for real-time camera input and VOP extraction for content-based video coding and also implemented motion detection to achieve the 180 : 1 compression rate for real-time and high compression MPEG-4 encoding.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.4
• /
• pp.461-467
• /
• 2009

Relative positioning technique by GPS that can obtain the high positioning accuracy has been used for generation of high precision positioning with elimination or the reduction of the common errors. This paper gives some algorithms for RTK and considers the filter to estimate the positioning information and integer ambiguities at each epoch in the whole algorithms. The extended kalman filter has been employed to estimate the state parameters and the modified LAMBDA to resolve the integer ambiguities. The data processing was performed by GPS single frequency and dual frequency in short baseline. The verification procedure of these positioning compared with results from Bernese 5.0 software. We presented some statistic values on positioning errors and the rates of integer ambiguity resolution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2680-2700
• /
• 2017

Finite field arithmetic over GF($2^m$) is used in a variety of applications such as cryptography, coding theory, computer algebra. It is mainly used in various cryptographic algorithms such as the Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), Twofish etc. The multiplication in a finite field is considered as highly complex and resource consuming operation in such applications. Many algorithms and architectures are proposed in the literature to obtain efficient multiplication operation in both hardware and software. In this paper, a modified serial multiplication algorithm with interleaved modular reduction is proposed, which allows for an efficient realization of a sequential polynomial basis multiplier. The proposed sequential multiplier supports multiplication of any two arbitrary finite field elements over GF($2^m$) for generic irreducible polynomials, therefore made versatile. Estimation of area and time complexities of the proposed sequential multiplier is performed and comparison with existing sequential multipliers is presented. The proposed sequential multiplier achieves 50% reduction in area-delay product over the best of existing sequential multipliers for m = 163, indicating an efficient design in terms of both area and delay. The Application Specific Integrated Circuit (ASIC) and the Field Programmable Gate Array (FPGA) implementation results indicate a significantly less power-delay and area-delay products of the proposed sequential multiplier over existing multipliers.