• Title/Summary/Keyword: off-line algorithm

Search Result 282, Processing Time 0.029 seconds

Ground Contact Analysis for Korea's Fictitious Lunar Orbiter Mission

  • Song, Young-Joo;Ahn, Sang-Il;Choi, Su-Jin;Sim, Eun-Sup
    • Journal of Astronomy and Space Sciences
    • /
    • v.30 no.4
    • /
    • pp.255-267
    • /
    • 2013
  • In this research, the ground contact opportunity for the fictitious low lunar orbiter is analyzed to prepare for a future Korean lunar orbiter mission. The ground contact opportunity is basically derived from geometrical relations between the typical ground stations at the Earth, the relative positions of the Earth and Moon, and finally, the lunar orbiter itself. Both the cut-off angle and the orbiter's Line of Sight (LOS) conditions (weather orbiter is located at near or far side of the Moon seen from the Earth) are considered to determine the ground contact opportunities. Four KOMPSAT Ground Stations (KGSs) are assumed to be Korea's future Near Earth Networks (NENs) to support lunar missions, and world-wide separated Deep Space Networks (DSNs) are also included during the contact availability analysis. As a result, it is concluded that about 138 times of contact will be made between the orbiter and the Daejeon station during 27.3 days of prediction time span. If these contact times are converted into contact duration, the duration is found to be about 8.55 days, about 31.31% of 27.3 days. It is discovered that selected four KGSs cannot provide continuous tracking of the lunar orbiter, meaning that international collaboration is necessary to track Korea's future lunar orbiter effectively. Possible combinations of world-wide separated DSNs are also suggested to compensate for the lack of contact availability with only four KGSs, as with primary and backup station concepts. The provided algorithm can be easily modified to support any type of orbit around the Moon, and therefore, the presented results could aid further progress in the design field of Korea's lunar orbiter missions.

An Vision System for Traffic sign Recognition (교통표지판 인식을 위한 비젼시스템)

  • Kim, Tae-Woo;Kang, Yong-Seok;Cha, Sam;Bae, Cheol-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.2 no.2
    • /
    • pp.45-50
    • /
    • 2009
  • This paper presents an active vision system for on-line traffic sign recognition. The system is composed of two cameras, one is equipped with a wide-angle lens and the other with a telephoto lends, and a PC with an image processing board. The system first detects candidates for traffic signs in the wide-angle image using color, intensity, and shape information. For each candidate, the telephoto-camera is directed to its predicted position to capture the candidate in a large size in the image. The recognition algorithm is designed by intensively using built in functions of an off-the-shelf image processing board to realize both easy implementation and fast recognition. The results of on-road experiments show the feasibility of the system.

  • PDF

Design and Evaluation of a VOD Buffer Management Algorithm Using Fixed Prefetch and Drop Strategics (고정 선반입과 Drop 정책을 이용한 VOD 버퍼 관리 알고리즘 설계 및 평가)

  • 박규석;문병철
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.2
    • /
    • pp.101-111
    • /
    • 2000
  • Resource managing is very difficult because the multimedia data compressed by a VBR shows a bit rate change within high range, Therefore, the VOD server should use the prefetch method in order to improve system utilization, such as prefetching data in the overload period by a meta table that is the reference pattern of MPEG data which is analyzed off line. This prefetch method will not result in a failure to display at overload, however, this method can not keep a minimum loading time and low costs, because the prefetched section is being maximizes. In this paper, we suggest another method that the system utilization can be improved using the fixed prefetched section to keep loading time and costs under a constant range at overload. But this technique will result in a failure to display, due to fixed prefetched section. Rut, in this paper we suggest a drop module that drops only the B frame in the GOP, consistently distributes a lower drop in media quality for the user.

  • PDF

Development of Texture Neutralization System for the Invisible e-Performance (투명 e-퍼포먼스를 위한 텍스쳐 중화 시스템 개발)

  • Lee, Dong-Hoon;Yun, Tae-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.4
    • /
    • pp.585-594
    • /
    • 2011
  • On live performance such as play and musical, various stage effects are utilized to attract a diverse audience. These stage effects include traditional direction techniques, striking display effects and all kinds of ways of being immersed in the scene. In this paper, we propose a novel digital visual effects(digilog) for controlling the surface texture of objects based on spatial augmented reality. For this purpose, we present a method of neutralizing the appearance of an arbitrary object using a projector-camera system. To make the object appear as if it is a transparent object by projecting a carefully determined compensation image onto the surface of objects, we use the homography method for a simple and effective off-line projector-camera calibration. The successful uses of the basic algorithm of Smart Projector for measuring radiometric parameters led us believe that this method may be used for temporal variation of plays and musicals.

A Study on the Dynamic Analysis of Mooring System During Hook-up Installation

  • Lee, Min Jun;Jo, Hyo Jae;Lee, Sung Wook;Hwang, Jea Hyuk;Kim, Jea Heui;Kim, Young Kyu;Baek, Dong Il
    • Journal of Ocean Engineering and Technology
    • /
    • v.34 no.5
    • /
    • pp.285-293
    • /
    • 2020
  • This study evaluated the Hook-up installation of an offshore site construction process, which is the final step in an offshore site installation process. During Hook-up installation, the offshore structure can have a detrimental effect on the work stability due to low-frequency motion. Moreover, economic costs can be incurred by the increase in available days of a tugboat. Therefore, this study developed a numerical analysis program to assess the dynamic behavior of mooring systems during hook-up installation to analyze the generally performed installation process and determine when the tugboat should be released. In this program, the behavior of an offshore structure was calculated using Cummin's time-domain motion equation, and the mooring system was calculated by Lumped mass method (LMM). In addition, a tugboat algorithm for hook-up installation was developed to apply the Hook-up procedure. The model used in the calculations was the barge type assuming FPSO (Floating production storage and off-loading) and has a taut mooring system connected to 16 mooring lines. The results of the simulation were verified by comparing with both MOSES, which is a commercial program, and a calculation method for restoring coefficient matrix, which was introduced by Patel and Lynch (1982). Finally, the offset of the structure according to the number of tugboats was calculated using the hook-up simulation, and the significant value was used to represent the calculation result.

Reinforcement Learning for Minimizing Tardiness and Set-Up Change in Parallel Machine Scheduling Problems for Profile Shops in Shipyard (조선소 병렬 기계 공정에서의 납기 지연 및 셋업 변경 최소화를 위한 강화학습 기반의 생산라인 투입순서 결정)

  • So-Hyun Nam;Young-In Cho;Jong Hun Woo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.60 no.3
    • /
    • pp.202-211
    • /
    • 2023
  • The profile shops in shipyards produce section steels required for block production of ships. Due to the limitations of shipyard's production capacity, a considerable amount of work is already outsourced. In addition, the need to improve the productivity of the profile shops is growing because the production volume is expected to increase due to the recent boom in the shipbuilding industry. In this study, a scheduling optimization was conducted for a parallel welding line of the profile process, with the aim of minimizing tardiness and the number of set-up changes as objective functions to achieve productivity improvements. In particular, this study applied a dynamic scheduling method to determine the job sequence considering variability of processing time. A Markov decision process model was proposed for the job sequence problem, considering the trade-off relationship between two objective functions. Deep reinforcement learning was also used to learn the optimal scheduling policy. The developed algorithm was evaluated by comparing its performance with priority rules (SSPT, ATCS, MDD, COVERT rule) in test scenarios constructed by the sampling data. As a result, the proposed scheduling algorithms outperformed than the priority rules in terms of set-up ratio, tardiness, and makespan.

Quality Assurance of Multileaf Collimator Using Electronic Portal Imaging (전자포탈영상을 이용한 다엽시준기의 정도관리)

  • ;Jason W Sohn
    • Progress in Medical Physics
    • /
    • v.14 no.3
    • /
    • pp.151-160
    • /
    • 2003
  • The application of more complex radiotherapy techniques using multileaf collimation (MLC), such as 3D conformal radiation therapy and intensity-modulated radiation therapy (IMRT), has increased the significance of verifying leaf position and motion. Due to thier reliability and empirical robustness, quality assurance (QA) of MLC. However easy use and the ability to provide digital data of electronic portal imaging devices (EPIDs) have attracted attention to portal films as an alternatives to films for routine qualify assurance, despite concerns about their clinical feasibility, efficacy, and the cost to benefit ratio. In this study, we developed method for daily QA of MLC using electronic portal images (EPIs). EPID availability for routine QA was verified by comparing of the portal films, which were simultaneously obtained when radiation was delivered and known prescription input to MLC controller. Specially designed two-test patterns of dynamic MLC were applied for image acquisition. Quantitative off-line analysis using an edge detection algorithm enhanced the verification procedure as well as on-line qualitative visual assessment. In conclusion, the availability of EPI was enough for daily QA of MLC leaf position with the accuracy of portal films.

  • PDF

Detecting Shared Resource Usage Errors with Global Predicates (광역조건식에 의한 공유자원 접근오류 검색)

  • Lee, Eun-Jeong;Yun, Gi-Jung
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1445-1454
    • /
    • 1999
  • 광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.

Study on Improvement of Target Tracking Performance for RASIT(RAdar of Surveillance for Intermediate Terrain) Using Active Kalman filter (능동형 Kalman filter를 이용한 지상감시레이더의 표적탐지능력 향상에 관한 연구)

  • Myung, Sun-Yang;Chun, Soon-Yong
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.46 no.3
    • /
    • pp.52-58
    • /
    • 2009
  • If a moving target has a linear characteristics, the Kalman filter can estimate relatively accurate the location of a target, but this performance depends on how the dynamic status characteristics of the target is accurately modeled. In many practical problems of tracking a maneuvering target, a simple kinematic model can fairly accurately describe the target dynamics for a wide class of maneuvers. However, since the target can exhibit a wide range of dynamic characteristics, no fixed SKF(Simple Kalman filter) can be matched to estimate, to the required accuracy, the states of the target for every specific maneuver. In this paper, a new AKF(Active Kalman filter) is proposed to solve this problem The process noise covariance level of the Kalman filter is adjusted at each time step according to the study result which uses the neural network algorithm. It is demonstrated by means of a computer simulation that the tracking capability of the proposed AKF(Active Kalman filter) is better than that of the SKF(Simple Kalman Filter).

Comparison of Feature Performance in Off-line Hanwritten Korean Alphabet Recognition (오프라인 필기체 한글 자소 인식에 있어서 특징성능의 비교)

  • Ko, Tae-Seog;Kim, Jong-Ryeol;Chung, Kyu-Sik
    • Korean Journal of Cognitive Science
    • /
    • v.7 no.1
    • /
    • pp.57-74
    • /
    • 1996
  • This paper presents a comparison of recognition performance of the features used inthe recent handwritten korean character recognition.This research aims at providing the basis for feature selecion in order to improve not only the recognition rate but also the efficiency of recognition system.For the comparison of feature performace,we analyzed the characteristics of theose features and then,classified them into three rypes:global feature(image transformation)type,statistical feature type,and local/ topological feature type.For each type,we selected four or five features which seem more suitable to represent the characteristics of korean alphabet,and performed recongition experiments for the first consonant,horizontal vowel,and vertical vowel of a korean character, respectively.The classifier used in our experiments is a multi-layered perceptron with one hidden layer which is trained with backpropagation algorithm.The training and test data in the experiment are taken from 30sets of PE92. Experimental results show that 1)local/topological features outperform the other two type features in terms of recognition rates 2)mesh and projection features in statical feature type,walsh and DCT features in global feature type,and gradient and concavity features in local/topological feature type outperform the others in each type, respectively.

  • PDF