• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.508-511
• /
• 2005

In the near future various new services will be created by using ubiquitous computing and ubiquitous network. Especially u-LBS(Ubiquitous Location Based Services) is recognized as one of the most important services. U-LBS is based on the data created by recognizing objects including both human and matters at any time and anywhere. Many researches related with object locating method by using RF are in the process of studying However there are few researches on the location of objects. In this paper we propose the recognition method of the location of objects by using RF and USN technology. In detail, the strength of RF signal is used to recognize the location of objects. Also we discuss about the future work to enhance the recognition rate of location by using a number of conditions including the weather, temperature etc. And Genetic Algorithm is used to get the optimal parameters with which we can get the more exact recognition rate of location.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.643-650
• /
• 2014

A hardware implementation of phase calculator for extracting 3D depth image from TOF(Time-Of-Flight) sensor is described. The designed phase calculator adopts redundant binary number systems and a pipelined architecture to improve throughput and speed. It performs arctangent operation using vectoring mode of DCORDIC(Differential COordinate Rotation DIgital Computer) algorithm. Fixed-point MATLAB simulations are carried out to determine the optimal bit-widths and number of iteration. The phase calculator has ben verified by FPGA-in-the-loop verification using MATLAB/Simulink. A test chip has been fabricated using a TSMC $0.18-{\mu}m$ CMOS process, and test results show that the chip functions correctly. It has 82,000 gates and the estimated throughput is 400 MS/s at 400Mhz@1.8V.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.697-705
• /
• 2014

This paper presents a vision based object width measurement method and its application where the light sectioning method is employed. The target object for measurement is a tread, which is the most outside component of an automobile tire. The entire system applying the measurement method consists of two processes, i.e. a calibration process and a detection process. The calibration process is to identify the relationships between a camera plane and a laser plane, and to estimate a camera lens distortion parameters. As the process requires a test pattern, namely a jig, which is elaborately manufactured. In the detection process, first of all, the region that a laser light illuminates is extracted by applying an adaptive thresholding technique where the distribution of the pixel brightness is considered to decide the optimal threshold. Then, a thinning algorithm is applied to the region so that the ends and the shoulders of a tread are detected. Finally, the tread width and the shoulder width are computed using the homography and the distortion coefficients obtained by the calibration process.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.645-653
• /
• 2002

The unit commitment problem in a power system involves determining the start-up and shut-down schedules of many dynamos for a day or a week while satisfying the power demands and diverse constraints of the individual units in the system. It is very difficult to derive an economically optimal schedule due to its huge search space when the number of dynamos involved is large. Tabu search is a popular solution method used for various optimization problems because it is equipped with effective means of searching beyond local optima and also it can naturally incorporate and exploit domain knowledge specific to the target problem. When given a large-scaled problem with a number of complicated constraints, however, tabu search cannot easily find a good solution within a reasonable time. This paper shows that a large- scaled optimization problem such as the unit commitment problem can be solved efficiently by using a parallel tabu search. The parallel tabu search not only reduces the search time significantly but also finds a solution of better quality.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.728-737
• /
• 2011

For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.169-178
• /
• 2011

Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.23-28
• /
• 2017

Shape from focus (SFF) is a technique used to reconstruct 3D shape of objects from a sequence of images obtained at different focus settings of the lens. In this paper, a new shape from focus method for 3D reconstruction of microscopic objects is described, which is based on gradient operator in Mathematical Morphology. Conventionally, in SFF methods, a single focus measure is used for measuring the focus quality. Due to the complex shape and texture of microscopic objects, single measure based operators are not sufficient, so we propose morphological operators with multi-structuring elements for computing the focus values. Finally, an optimal focus measure is obtained by combining the response of all focus measures. The experimental results showed that the proposed algorithm has provided more accurate depth maps than the existing methods in terms of three-dimensional shape recovery.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.7 no.1
• /
• pp.81-90
• /
• 2002

This paper presents an Implementation of digital high-performance position sensorless control system of Reluctance Synchronous Motor(RSM) drives with Direct Torque Control(DTC). The system consists of stator flux observer, speed and torque estimator, two digital hysteresis controllers, an optimal switching look-up table, Insulated Gate Bipolar Transistor(IGBT) voltage source inverter, and TMS320C31 DSP board. The stator flux observer Is based on the combined voltage and current model with stator flux feedback adaptive control of which inputs are current and voltage sensed on motor terminal for wide speed range. In order to prove the suggested sensorless control algorithm for industrial field application, we have some simulation and actual experiment at low and high speed range. The developed high-performance speed control by fully digital system are shown a good response characteristic of control results and high performance features using 1.0[kW] RSM having 2.57 reluctance ratio of $L_d/L_q$.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.