• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.227-232
• /
• 2010

This paper proposes the real time lip reading method in the embedded environment. The embedded environment has the limited sources to use compared to existing PC environment, so it is hard to drive the lip reading system with existing PC environment in the embedded environment in real time. To solve the problem, this paper suggests detection methods of lip region, feature extraction of lips, and awareness methods of phonetic words suitable to the embedded environment. First, it detects the face region by using face color information to find out the accurate lip region and then detects the exact lip region by finding the position of both eyes from the detected face region and using the geometric relations. To detect strong features of lighting variables by the changing surroundings, histogram matching, lip folding, and RASTA filter were applied, and the properties extracted by using the principal component analysis(PCA) were used for recognition. The result of the test has shown the processing speed between 1.15 and 2.35 sec. according to vocalizations in the embedded environment of CPU 806Mhz, RAM 128MB specifications and obtained 77% of recognition as 139 among 180 words were recognized.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.481-488
• /
• 2009

GIS is used to isolate large power electrical equipment using SF6 gas. While GIS has simple structure, it has few break down, relatively high reliability. But it is hard to check up faults for reason of pressure. Faults of GIS should have a ripple effect on community and be hard to recovery. Consequently, GIS imports a preventive diagnostic system to find internal faults in advance. It is most important that reliability on the GIS preventive diagnostic system, because it estimates abnormality of system by analysis result of collected data. But, exist system which used central data management is low efficiency, and hard to guarantee timeliness and accuracy of data. To guarantee timeliness and accuracy, the GIS preventive diagnostic system needs accordingly to use a real-time middleware. So, in this paper, to improve reliability of the GIS preventive diagnostic system, we use a middleware based on TMO for guaranteeing timeliness of real-time distributed computing. And we propose an improved GIS preventive diagnostic system applying data acquisition, monitoring and control methods based on the TMO model. The presented system uses the Communication Control Unit(CCU) for distributed data handling which is supported by TMO. CCU can improve performance of the GIS preventive diagnostic system by guaranteeing timeliness of data handling process and increasing reliability of data through the TMO middleware. And, it has designed to take full charge of overload on a data acquisition task had been processed in an exist server. So, it could reduce overload of the server and apply distribution environment from now. Therefore, the proposed system can improve performance and reliability of the GIS preventive diagnostic system and contribute to stable operation of GIS.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.23 no.6 s.165
• /
• pp.1011-1017
• /
• 1999

Electrolytic in-process dressing grinding technique which enables application of metal bond wheels with fine superabrasives in mirror surface grinding operations has developed. It is possible to make efficient precision machining of hard and brittle material such as ceramic and hard metal by the employment of this technique. However, in order to ensure the success of performances such as efficient machining, surface finish, and surface quality, it is important to sustain the insulating layer that has sharply exposed abrasives in wheel surface. Using AE(Acoustic Emission) sensor, this paper will show whether the insulating layer sustains stably or not in real grinding time. And by comparing AErms value and surface roughness their thresholds for stable electrolytic in-process dressing grinding will be determined.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.3
• /
• pp.65-73
• /
• 2017

The fifth generation(5G) of wireless networks will connect not only smart phone but also unimaginable things. Therefore, 5G cellular network is facing the soaring traffic demand of numerous user devices. To solve this problem, a huge amount of 5G base stations will need to be installed. The base station positioning problem is an NP-hard problem that does not know how long it will take to solve the problem. Because, it can not find an answer other than to check the number of all cases. In this paper, to solve the NP hard problem, we compare the tabu search and the genetic algorithm using real maps for optimal cell planning. We also perform Monte Carlo simulations to study the performance of the Tabu search and Genetic algorithm for 5G cell planning. As a results, Tabu search required 2.95 times less computation time than Genetic algorithm and showed accuracy difference of 2dBm.

• Journal of Platform Technology
• /
• v.10 no.1
• /
• pp.3-10
• /
• 2022

In high-risk workplaces where communication is not possible, such as deforestation, it is necessary to use equipment that monitors the worker's situation in real time and obtains information according to the worker's location in case of an emergency. This paper analyzes the development and demonstration experiments of smart hard hats for deforestation workers to maintain a safe working environment. The developed smart helmet identifies the location of the worker based on the UWB signal for location estimation, and it is necessary to keep the distance between the workers not too close. UWB, Gyro, and LoRa are used to communicate even in the communication shadow area. It is used to provide a safe working environment such as improved construction to reduce worker risks and risks in forest working environments.

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

Although spatial databases support an efficient spatial management on objects in the real world, they have a characteristic that process only spatial information valid at current time, So in case of change in the spatial domain, it is very hard to support an efficient historical management for time-varying spatial information because they delete an old value and then replace with new value that is valid at current time. To solve these problems, there are rapidly increasing of interest for spatiotemporal databases, which serve historical functions for spatial information as well as spatial management functions for an object. However most of them presented in an abstract time-varying spatial phenomenon, but have not presented a concrete policy in spatiotemporal databases. In this paper, we propose a spatiotemporal data model that supports bitemporal time concepts in three dimensional architecture. In the proposed model, not only data types and their operation for object of spatiotemporal databases have been classified, but also mathematical expressions using formal semantics for them have been given. Then, the data structures and their operations based on relational database model as well as object-oriented database model are presented.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1333-1343
• /
• 1999

경성 실시간 시스템의 태스크들은 논리적으로 올바른 결과를 산출해야 하지만 또한 각자의 시간 제한 조건을 만족하여야 한다. 간격제한 스케줄링은 시간 제한 조건이 시간 간격 제한으로 주어지는 실시간 태스크들을 스케줄하기 위하여 도입되었다. 간격제한 스케줄링에서의 각 태스크들은 시간 간격 제한 조건을 갖는데, 이것은 태스크의 두 연속적인 수행의 종료시간에 대해 제한을 가한다. 다시 말해, 간격제한 스케줄링에서의 각 태스크 수행은 그 태스크의 직전 수행 완료 시간으로부터 발생하는 데드라인을 갖는다. 간격제한 태스크 스케줄링에 관한 많은 연구는 단순화 방법에 기초하고 있다. 그러나, 우리는 이 논문에서 단순화 방법을 사용하지 않고, 정적 우선순위 및 정적 분리 제한 정책을 채용한 새로운 간격제한 태스크 스케줄링 방법을 제안한다. 제안된 정적 할당 방법은 스케줄링 분석 및 구현을 매우 간단히 할 수 있으며, 또한 스케줄러의 실행시간 오버헤드를 줄일 수 있다.Abstract Tasks in hard real-time systems must not only be logically correct but also meet their timing constraints. The distance-constrained scheduling has been introduced to schedule real-time tasks whose timing constraints are characterized by temporal distance constraints. Each task in the distance-constrained scheduling has a temporal distance constraint which imposes restriction on the finishing times of two consecutive executions of the task. Thus, each execution of a task in the distance-constrained scheduling has a deadline relative to the finishing time of the previous execution of the task.Much work on the distance-constrained task scheduling has been based on the reduction technique. In this paper, we propose a new scheme for the distance-constrained task scheduling which does not use the reduction technique but adopts static priority and static separation constraint assignment policy. We show that our static assignment approach can simplify the scheduling analysis and its implementation, and can also reduce the run-time overhead of the scheduler.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1373-1381
• /
• 2010

Current flight maneuver diagram used by pilots is based on 2D spatial presentation, so it has limitation on display 3D flight information and hard to understand it instinctively. Flight animation authoring tools for this diagram are complex to use and lack useful features like non-linear editing of flight path and real-time interactivity on multiple aircrafts. This research focuses on 3D flight path generation method in the animation system for flight maneuver education. This research combines initial sketch input on 2D diagram with the thrust of an aircraft to generate 3D linear spline as close as to real flight. Using suggested linear spline creation method, the flight path can be visualized, edited, and animated in real-time at the flight maneuver briefing and debriefing.