• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.723-724
• /
• 2008

In this paper, we explore face recognition technology for embedded system. We develop an algorithm suitable for systems under ubiquitous environment. The basic requirements includes appropriate data format and ratio of feature data to achieve efficiency of algorithm. Our experiment presents a face recognition technique for handheld devices. The essential parts for face recognition based on embedded system includes; integer representation from floating point calculation and optimization for memory management.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.835-836
• /
• 2006

For non-contact structure vibration displacement measurement system, an algorithm for image processing using high speed CCD camera is introduced. The system sets the target to the structure, take picture using camera and image processing is performed to display the vibration data. The algorithm flow is basic preprocessing, projection data generation and curve fitting to find three crossing points for calibration or one center point in limited area.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2561-2564
• /
• 2003

Data mining is an effective method of the discovery of useful information such as rules and previously unknown patterns existing in large databases. The discovery of association rules is an important data mining problem. We have developed a new parallel mining called Distributed Frequent Pattern Tree (abbreviated by DFPT) algorithm on a distributed shared nothing parallel system to detect association rules. DFPT algorithm is devised for parallel execution of the FP-growth algorithm. It needs only two full disk data scanning of the database by eliminating the need for generating the candidate items. We have achieved good workload balancing throughout the mining process by distributing the work equally to all processors. We implemented the algorithm on a PC cluster system, and observed that the algorithm outperformed the Improved Count Distribution scheme.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.696-701
• /
• 2004

A vehicle cruise control algorithm using an Interacting Multiple Model (IMM)-based Multi-Target Tracking (MTT) method has been presented in this paper. The vehicle cruise control algorithm consists of three parts; track estimator using IMM-Probabilistic Data Association Filter (PDAF), a primary target vehicle determination algorithm and a single-target adaptive cruise control algorithm. Three motion models; uniform motion, lane-change motion and acceleration motion, have been adopted to distinguish large lateral motions from longitudinal motions. The models have been validated using simulated and experimental data. The improvement in the state estimation performance when using three models is verified in target tracking simulations. The performance and safety benefits of a multi-model-based MTT-ACC system is investigated via simulations using real driving radar sensor data. These simulations show system response that is more realistic and reflective of actual human driving behavior.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1708-1734
• /
• 2022

In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.109-113
• /
• 2007

The COMS provides the LRIT/HRIT services to users. The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The requirement is important and critical enough to impact overall performance of the LHGS. HRIT image data is acquired from INRSM output receiving but LRIT image data is generated by sub-sampling HRIT image data in the LHGS. Specially, since LRIT is acquired from sub-sampled HRIT image data, LRIT processing spent more time. Besides, some of data loss for LRIT occurs since LRIT is compressed by lossy JPEG. Therefore, algorithm with the fastest processing speed and simplicity to be implemented should be selected to satisfy the requirement. Investigated sub-sampling algorithm for the LHGS were nearest neighbour algorithm, bilinear algorithm and bicubic algorithm. Nearest neighbour algorithm is selected for COMS LHGS considering the speed, simplicity and anti-aliasing corresponding to the guideline of user (KMA: Korea Meteorological Administration) to maintain the most cloud itself information in a view of meteorology. But the nearest neighbour algorithm is known as the worst performance. Therefore, it is studied in this paper that the selection of nearest neighbour algorithm for the LHGS is reasonable. First of all, characteristic of 3 sub-sampling algorithms is studied and compared. Then, several sub-sampling algorithm were applied to MTSAT-1R image data corresponding to COMS HRIT. Also, resized image was acquired from sub-sampled image with the identical sub-sampling algorithms applied to sub-sampling from HRIT to LRIT. And the difference between original image and resized image is compared. Besides, PSNR and MSE are calculated for each algorithm. This paper shows that it is appropriate to select nearest neighbour algorithm for COMS LHGS since sub-sampled image by nearest neighbour algorithm is little difference with that of other algorithms in quality performance from PSNR.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.566-572
• /
• 2000

The System identification is the process of developing or improving a mathematical model of a physical system using experimental data of the input, output and noise relationship. The field of system identification has been an important discipline within the automatic control area. The reason is the requirement that mathematical models having a specified accuracy must be used to apply modem control methods. In this paper, it is confirmed that we can obtain transfer function of flexible beam that is expressed in the forms of identified state-space system matrix A, B, C, D and identified observer gain G using Eigensystem Realization Algorithm including singular value decomposition. And these matrices can be applied to the automatic control. In addition to, it is also confirmed that transfer function can express a system using identified observer gain G, in spite of a noisy data or a periodic disturbance.

• Proceedings of the KSR Conference
• /
• 2002.10a
• /
• pp.471-477
• /
• 2002

In this paper, it is proposed instruction code satisfied algorithm that is able to prevent data collision when transponder access in the area of recognition system that is operated to single channel. Differ from absolute collision is used to in the time domain procedure, instruction code satisfied algorithm, transmits data which don't generate collision and must satisfy instruction code. So, to prevent data collision, transponder is of great if it read the entire instruction code. Consequently, it is applied to algorithm that made the system of wireless recognition13.56 Mhz. As a result, for the time of one bit data transmission had 14${\mu}$s difference, it is proved the prevention of data loss in experiment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.3
• /
• pp.34-42
• /
• 2007

It is very important for the combat system to process extensive data exactly at short time for the better situation awareness compared with the threats in these days. This paper suggests to add radial velocity on the decision factor of sensor data fusion in the existing algorithm for the accuracy enhancement of the sensor data fusion in the combat system.

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.769-777
• /
• 2014

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.