• 제목/요약/키워드: Algorithm Model

검색결과 12,861건 처리시간 0.037초

Hidden Markov Model 과 Genetic Algorithm을 이용한 온라인 문자인식에 관한 연구 (On-Line Character Recognition using Hidden Markov Model and Genetic Algorithm)

  • 홍영표;장춘서
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
    • /
    • pp.29-32
    • /
    • 2000
  • HMM(Hidden Markov Model)은 시간적인 정보를 토대로 하는 수학적인 방법으로서 문자인식에 많이 사용되어지고 있다. 그런데 HMM이 적용되고자 하는 문제에서 사용되어지는 상태 수와 HMM에서 사용되어지는 parameter들은 처음에 결정되는 값들에 의해서 상당히 많은 영향을 받게 된다. 따라서 한글의 특성을 이용한 HMM의 상태 수를 결정한 후 결정되어진 각각의 HMM parameter들을 Genetic Algorithm을 이용하였다. Genetic Algorithm은 매개변수 최적화 문제에 대하여 자연의 진화 원리를 마땅한 알고리즘으로 선택, 교배, 돌연변이 연산을 이용하여 최적의 개체를 구하게 된다. 여기서는 HMM에서의 Viterbi Algorithm을 적합도 검사에 사용하였다.

  • PDF

도시부 ATIS 효율적 적용을 위한 탐색영역기법 및 양방향 링크탐색 알고리즘의 구현 (An Integration of Searching Area Extraction Scheme and Bi-directional Link Searching Algorithm for the Urban ATIS Application)

  • 이승환;최기주;김원길
    • 대한교통학회지
    • /
    • 제14권3호
    • /
    • pp.45-59
    • /
    • 1996
  • The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

  • PDF

유전알고리즘을 이용한 하천수질관리모형에 관한 연구 (A Study on the River Water Quality Management Model using Genetic Algorithm)

  • 조재현;성기석
    • 상하수도학회지
    • /
    • 제18권4호
    • /
    • pp.453-460
    • /
    • 2004
  • The objective of this research is to develop the water quality management model to achieve the water quality goal and the minimization of the waste load abatement cost. Most of existing water quality management model can calculate BOD and DO. In addition to those variables, N and P are included in the management model of this study. With a genetic algorithm, calculation results from the mathematical water quality model can be used directly in this management model. Developed management model using genetic algorithm was applicated for the Youngsan River basin. To verify the management model, water quality and pollution source of the Youngsan River had been investigated. Treatment types and optimum treatment costs of the existing and planned WWTPs in the baisn were calculated from the model. The results of genetic algorithm indicate that Kwangju and Naju WWTP have to do the advanced treatment to achieve the water quality goal about BOD, DO and TP. Total annual treatment cost including the upgrade cost of existing WWTPs in the Youngsan River basin was about 50.3 billion Won.

유전자 알고리즘과 회귀식을 이용한 오염부하량의 예측 (Estimation of Pollutant Load Using Genetic-algorithm and Regression Model)

  • 박윤식
    • 한국환경농학회지
    • /
    • 제33권1호
    • /
    • pp.37-43
    • /
    • 2014
  • BACKGROUND: Water quality data are collected less frequently than flow data because of the cost to collect and analyze, while water quality data corresponding to flow data are required to compute pollutant loads or to calibrate other hydrology models. Regression models are applicable to interpolate water quality data corresponding to flow data. METHODS AND RESULTS: A regression model was suggested which is capable to consider flow and time variance, and the regression model coefficients were calibrated using various measured water quality data with genetic-algorithm. Both LOADEST and the regression using genetic-algorithm were evaluated by 19 water quality data sets through calibration and validation. The regression model using genetic-algorithm displayed the similar model behaviors to LOADEST. The load estimates by both LOADEST and the regression model using genetic-algorithm indicated that use of a large proportion of water quality data does not necessarily lead to the load estimates with smaller error to measured load. CONCLUSION: Regression models need to be calibrated and validated before they are used to interpolate pollutant loads, as separating water quality data into two data sets for calibration and validation.

A Model Stacking Algorithm for Indoor Positioning System using WiFi Fingerprinting

  • JinQuan Wang;YiJun Wang;GuangWen Liu;GuiFen Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권4호
    • /
    • pp.1200-1215
    • /
    • 2023
  • With the development of IoT and artificial intelligence, location-based services are getting more and more attention. For solving the current problem that indoor positioning error is large and generalization is poor, this paper proposes a Model Stacking Algorithm for Indoor Positioning System using WiFi fingerprinting. Firstly, we adopt a model stacking method based on Bayesian optimization to predict the location of indoor targets to improve indoor localization accuracy and model generalization. Secondly, Taking the predicted position based on model stacking as the observation value of particle filter, collaborative particle filter localization based on model stacking algorithm is realized. The experimental results show that the algorithm can control the position error within 2m, which is superior to KNN, GBDT, Xgboost, LightGBM, RF. The location accuracy of the fusion particle filter algorithm is improved by 31%, and the predicted trajectory is close to the real trajectory. The algorithm can also adapt to the application scenarios with fewer wireless access points.

정화 능력 진단 적용을 위한 학습을 통한 삼원촉매 모델의 구현에 관한 연구 (A Study on an Adaptive Three-Way Catalyst Model for the Monitoring Algorithm)

  • 최동범;김용민;박재홍;윤형진
    • 한국자동차공학회논문집
    • /
    • 제11권3호
    • /
    • pp.65-70
    • /
    • 2003
  • In this paper, an adapted TWC model and its application to the monitoring algorithm are proposed. As TWCs have the different characteristics, the model has to be corrected to diagnose more accurately. In the TWC model oxygen storage and release rate model are adapted to the installed TWC to whose characteristics related. The model learns from the downstream $O_2$ sensor output during the vehicle's operation. From the results, the model is adapted to the Installed TWC's characteristics. using this model, the monitoring algorithm can diagnose the no more accurately. Finally the algorithm is validated with simulations using the data logged from a retail car.

A New Rijection Algorithm Using Word-Dependent Garbage Models

  • Lee, Gang-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • 제16권2E호
    • /
    • pp.27-31
    • /
    • 1997
  • This paper proposes a new rejection algorithm which distinguishes unregistered spoken words(or non-keywords) from registered vocabulary. Two kinds of garbage models are employed in this design ; the original garbage model and a new word garbage model. The original garbage model collects all non-keyword patterns where the new word garbage model collects patterns classified by recognizing each non-keyword pattern with registered vocabulary. These two types of garbage models work together to make a robust reject decision. The first stage of processing is the classification of an input pattern through the original garbage model. In the event that the first stage of processing is ambiguous, the new word dependent garbage model is used to classify thye input pattern as either a registered or non-registered word. This paper shows the efficiency of the new word dependent garbage model. A Dynamic Multisection method is used to test the performance of the algorithm. Results of this experiment show that the proposed algorithm performs at a higher level than that of the original garbage model.

  • PDF

Electro-Mechanical Brake의 클램핑력 제어를 위한 전류 및 힘 센서 고장 검출 알고리즘 개발 (Current and Force Sensor Fault Detection Algorithm for Clamping Force Control of Electro-Mechanical Brake)

  • 한광진;양이진;허건수
    • 제어로봇시스템학회논문지
    • /
    • 제17권11호
    • /
    • pp.1145-1153
    • /
    • 2011
  • EMB (Electro-Mechanical Brake) systems can provide improved braking and stability functions such as ABS, EBD, TCS, ESC, BA, ACC, etc. For the implementation of the EMB systems, reliable and robust fault detection algorithm is required. In this study, a model-based fault detection algorithm is designed based on the analytical redundancy method in order to monitor current and force sensor faults in EMB systems. A state-space model for the EMB is derived including faulty signals. The fault diagnosis algorithm is constructed using the analytical redundancy method. Observer is designed for the EMB and the fault detectability condition is examined based on the residual analysis. The performance of the proposed model-based fault detection algorithm is verified in simulations. The effectiveness of the proposed algorithm is demonstrated in various faulty cases.

단일 실행의 빠른 근사해 기법과 반복 실행의 최적화 기법을 이용한 이산형 시스템의 시뮬레이션 연구 (Simulation Study of Discrete Event Systems using Fast Approximation Method of Single Run and Optimization Method of Multiple Run)

  • 박경종;이영해
    • 대한산업공학회지
    • /
    • 제32권1호
    • /
    • pp.9-17
    • /
    • 2006
  • This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

복합 휴리스틱 알고리즘을 이용한 지대공 유도무기 최적배치 모형 : 항공기 방어를 중심으로 (The Optimal Allocation Model for SAM Using Multi-Heuristic Algorithm : Focused on Aircraft Defense)

  • 곽기훈;이재영;정치영
    • 한국경영과학회지
    • /
    • 제34권4호
    • /
    • pp.43-56
    • /
    • 2009
  • In korean peninsular, aircraft defense with SAM (Surface-to-Air Missile) is very important because of short range of combat space in depth. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Set covering model which can handle both factors simultaneously and Multi-heuristic algorithm for solving allocation problem of the batteries and missile assignment problem in each battery. Genetic algorithm is used to decide optimal location of the batteries. To determine the number of SAM, a heuristic algorithm is applied for solving missile assignment problem. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of air defense operations.