• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1589-1596
• /
• 2005

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

• 한국멀티미디어학회논문지
• /
• 제20권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.

• 산업경영시스템학회지
• /
• 제21권47호
• /
• pp.35-45
• /
• 1998

Scheduling problem in Flexible Manufacturing Systems(FMS) is complex because of various situation of Manufacturing Systems. Especially, in case of short-term scheduling demanding high efficiency, low cost at short-period, efficient scheduling is a serious problem. To solve this problem, many dispatching rules are developed. But, it leave much to be desired, because real situation in shop floor is complex and real-time scheduling is needed in real manufacturing shop floor. In this paper, search algorithm that allocate different dispatching rules to each machine is presented to complement lack of dispatching rule and develop practical real-time scheduling system. The search algorithm is described in detail. First, algorithm detect machine breakdown, evaluate each dispatching rule. dispatching rules for each machine meeting performance criteria are ranked. The algorithm selects new dispatching nile for bottleneck machine. The effectivenes and efficiency of the mixed dispatching rule and search algorithm is demonstrated.

• 전기학회논문지
• /
• 제63권9호
• /
• pp.1259-1265
• /
• 2014

In this paper, the real-time attitude determination based Matlab using low-cost receivers was designed and evaluated. The GNSS attitude determination system was implemented to operation in real-time by TimerCallback in MATLAB. The TTM(Transmission Time Misalignment) of U-blox receiver was confirmed through zero baseline tests and this problem was revised. The computed attitude by the high-cost NovAtel receiver was compared to the computed attitude by the low-cost U-blox receiver. As a result of this, the performance of attitude determination systems by low-cost receiver was confirmed. To determine baseline, LAMBDA and BC-LAMBDA for integer ambiguities search methods were used. To confirm suitable integer ambiguity search method in real-time attitude determination algorithm, determined baselines by two methods were compared, and it was confirmed that BC-LAMBDA is more suitable. As a result of this, the operation of real-time attitude determination system was confirmed using 3 low-cost receivers.

• 한국전자통신학회논문지
• /
• 제19권3호
• /
• pp.523-530
• /
• 2024

웹페이지나 디지털 문서 등과 같은 온라인에서는 사용자가 검색하고 싶은 특정 단어나 특정 문구를 실시간으로 검색하는 기능이 있다. 인쇄된 도서나 참고서 등과 같은 인쇄물에는 실시간으로 특정 단어나 특정 문구를 찾는 기능이 없어 어려움을 겪는 경우가 많다. 본 논문에서는 텍스트를 탐지(Detection)하는 딥러닝 모델과 텍스트를 인식(Recognition)하는 OCR을 활용한 실시간 문자 탐지 시스템의 개발내용에 관해 기술한다. 본 연구에서는 EAST 모델을 사용하여 텍스트를 탐지하는 방법, 탐지한 텍스트를 EasyOCR을 사용하여 인식하는 방법, 인식한 텍스트를 사용자가 검색하고 싶은 특정 단어나 특정 문구를 비교하여 bounding box로 나타내는 방법을 제안한다. 이 시스템을 통해 사용자는 도서나 참고서 등과 같은 인쇄물에서 실시간으로 검색하고 싶은 특정 단어나 특정 문구를 찾아 필요한 정보를 쉽고 빠르게 찾는 것에 효과적일 것을 기대한다.

• 제어로봇시스템학회논문지
• /
• 제19권11호
• /
• pp.1036-1042
• /
• 2013

In this paper, an elderly assistance system is developed based on Xenomai, a real-time development framework cooperating with the Linux kernel. A Kinect sensor is used to recognize the behavior of the elderly and A-star search algorithm is implemented to find the shortest path to the person. The mobile robot also generates a trajectory using a digital convolution operator which is based on a Bezier curve for smooth driving. In order to follow the generated trajectory within the control period, we developed real-time tasks and compared the performance of the tracking trajectory with that of non real-time tasks. The real-time task has a better result on following the trajectory within the physical constraints which means that it is more appropriate to apply to an elderly assistant system.

• 대한기계학회논문집A
• /
• 제27권5호
• /
• pp.681-687
• /
• 2003

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

• 한국멀티미디어학회논문지
• /
• 제18권11호
• /
• pp.1289-1301
• /
• 2015

Pedestrian detection (PD) is an essential task in various applications and sliding window-based methods utilizing HOG (Histogram of Oriented Gradients) or HOG-like descriptors have been shown to be very effective for accurate PD. However, due to exhaustive search across images, PD methods based on sliding window usually require heavy computational time. In this paper, we propose a real-time PD method for embedded visual surveillance with fixed backgrounds. The proposed PD method employs HOG descriptors as many PD methods does, but utilizes selective search so that it can save processing time significantly. The proposed selective search is guided by restricting searching to candidate regions extracted from Adaptive Gaussian Mixture Model (AGMM)-based background subtraction technique. Moreover, approximate computation of HOG descriptor and implementation in fixed-point arithmetic mode contributes to reduction of processing time further. Possible accuracy degradation due to approximate computation is compensated by applying an appropriate one among three offline trained SVM classifiers according to sizes of candidate regions. The experimental results show that the proposed PD method significantly improves processing speed without noticeable accuracy degradation compared to the original HOG-based PD and HOG with cascade SVM so that it is a suitable real-time PD implementation for embedded surveillance systems.

• 한국IT서비스학회지
• /
• 제10권4호
• /
• pp.243-258
• /
• 2011

With increasing interest in ubiquitous computing technology, an infrastructure for the short-distance wireless communication has been extended socially, bringing spotlight to the security system using the image or location. In case of existing security system, there have been issues such as the occurrences of blind spots, difficulty in recognizing multiple objects and storing of the unspecified objects. In order to solve this issue, zone-based location-estimation search system for the image have been suggested as an alternative based on the real-time location determination technology combined with image. This paper intends to suggest the search service for the image zone-based location-estimation. For this, it proposed the location determination algorism using IEEE 802.15.4/ZigBee's RSSI and for real-time image service, the RTP/RTCP protocol was applied. In order to combine the location and image, at the event of the entry of the specified target, the record of the time for image and the time of occurrence of the event on a global time standard, it has devised a time stamp, applying XML based meta data formation method based on the media's feature data based in connection with the location based data for the events of the object. Using the proposed meta data, the service mode which can search for the image from the point in time when the entry of the specified target was proposed.

• 대한인간공학회지
• /
• 제36권3호
• /
• pp.197-211
• /
• 2017

Objective: We propose to apply color information to facilitate finding books in the library. Background: Currently, books are classified in the basis of a decimal classification system and a call number in the library. Users find a book using the call number. However, this classification system causes various difficulties. Method: In a process analysis and survey study, we identify what the real problem is and where the problem is occurred. To solve the real problems, we derived a new search method using color information. We conducted a comparative experiment with 48 participants to see whether the new method can show higher performance. Results: The new method using color information showed faster time and higher subjective rating scores than current call number method. Also, the new method showed faster time regardless of the skill level while the call number method showed time differences in terms of the skill level. Conclusion: The effectiveness of the proposed method was verified by experiments. Users will be able to find the desired book without difficulty. This method can improve the quality of service and satisfaction of library use. Application: Our book search method can be applied as a book search tool in a real public library. We hope that the method can provide higher satisfaction to users.