• Title/Summary/Keyword: Time Weighted Algorithm

Search Result 311, Processing Time 0.028 seconds

A Study On Optimization Of Fuzzy-Neural Network Using Clustering Method And Genetic Algorithm (클러스터링 기법 및 유전자 알고리즘을 이용한 퍼지 뉴럴 네트워크 모델의 최적화에 관한 연구)

  • Park, Chun-Seong;Yoon, Ki-Chan;Park, Byoung-Jun;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 1998.07b
    • /
    • pp.566-568
    • /
    • 1998
  • In this paper, we suggest a optimal design method of Fuzzy-Neural Networks model for complex and nonlinear systems. FNNs have the stucture of fusion of both fuzzy inference with linguistic variables and Neural Networks. The network structure uses the simpified inference as fuzzy inference system and the BP algorithm as learning procedure. And we use a clustering algorithm to find initial parameters of membership function. The parameters such as membership functions, learning rates and momentum coefficients are easily adjusted using the genetic algorithms. Also, the performance index with weighted value is introduced to achieve a meaningful balance between approximation and generalization abilities of the model. To evaluate the performance index, we use the time series data for gas furnace and the sewage treatment process.

  • PDF

NBI Rejection Techniques using Improved Decision Feedback for DS/SS Systems (DS/SS 시스템을 위한 개선된 결정궤환 구조를 가지는 협대역 간섭신호 제거)

  • 유창현;시광규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.10
    • /
    • pp.2679-2686
    • /
    • 1996
  • In this paper, we propsoed the two methods to improve the conventional decision feedback interference canceller in DS/SS communication systems. The data bit is obtained by correlating the PN sequence with the received signals to the present time k, and thus the errors in the reference signal can be reduced by newly deciding all the reference signals with the resultant data bit. Additionally the cancelled signals are computed with less weight for initial reference signals of low processing gain, and highly weighted as the processing gain goes up. the resulting interference canceller outperforms the existing ones. By simulation, we found the proposed algorithm has "2-3 dB" performance gain at BER 10$^{-3}$ compared to the conventional descision feedback algorithm.algorithm.

  • PDF

Derivation of MCE/GPD Training Algorithm Applicable to Weighted Hidden Markov Models (WHMM에 적용가능한 MCE/GPD 학습알고리듬에 관한 연구)

  • Choi, Hong-Sub
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.1
    • /
    • pp.104-109
    • /
    • 1997
  • This paper derives a new training alorithm for WHMM using the well-known MCE/GPD method with experimental results on the E-set. The derived algorithm generalizes the conventional adaptive training algorithm for WHMM, which means that HMMs of multiple competing classes can be trained at the same time. The recognition results on the E-set have shown about 15% and 12% improvement for training and test data, respectively.

  • PDF

High Resolution Frequency Estimation of Real Sinusoids (고분해능의 주파수 추정 알고리즘 개발)

  • Seo, In-Yong
    • Proceedings of the KIEE Conference
    • /
    • 2003.10a
    • /
    • pp.279-282
    • /
    • 2003
  • In this paper, we propose a new high resolution frequency estimator for real sinusoids by using short time data and the AWLS/MFT (Adaptive Weighted Least Squares/ Modulation Function Technique) algorithm. Monte-Carlo simulations verify better performances of the proposed frequency estimator and demonstrate that the proposed AWLS sinusoidal estimator is a high resolution estimator.

  • PDF

Speech Segmentation using Weighted Cross-correlation in CASA System (계산적 청각 장면 분석 시스템에서 가중치 상호상관계수를 이용한 음성 분리)

  • Kim, JungHo;Kang, ChulHo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.188-194
    • /
    • 2014
  • The feature extraction mechanism of the CASA(Computational Auditory Scene Analysis) system uses time continuity and frequency channel similarity to compose a correlogram of auditory elements. In segmentation, we compose a binary mask by using cross-correlation function, mask 1(speech) has the same periodicity and synchronization. However, when there is delay between autocorrelation signals with the same periodicity, it is determined as a speech, which is considered to be a drawback. In this paper, we proposed an algorithm to improve discrimination of channel similarity using Weighted Cross-correlation in segmentation. We conducted experiments to evaluate the speech segregation performance of the CASA system in background noise(siren, machine, white, car, crowd) environments by changing SNR 5dB and 0dB. In this paper, we compared the proposed algorithm to the conventional algorithm. The performance of the proposed algorithm has been improved as following: improvement of 2.75dB at SNR 5dB and 4.84dB at SNR 0dB for background noise environment.

A Parallel Equalization Algorithm with Weighted Updating by Two Error Estimation Functions (두 오차 추정 함수에 의해 가중 갱신되는 병렬 등화 알고리즘)

  • Oh, Kil-Nam
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.32-38
    • /
    • 2012
  • In this paper, to eliminate intersymbol interference of the received signal due to multipath propagation, a parallel equalization algorithm using two error estimation functions is proposed. In the proposed algorithm, multilevel two-dimensional signals are considered as equivalent binary signals, then error signals are estimated using the sigmoid nonlinearity effective at the initial phase equalization and threshold nonlinearity with high steady-state performance. The two errors are scaled by a weight depending on the relative accuracy of the two error estimations, then two filters are updated differentially. As a result, the combined output of two filters was to be the optimum value, fast convergence at initial stage of equalization and low steady-state error level were achieved at the same time thanks to the combining effect of two operation modes smoothly. Usefulness of the proposed algorithm was verified and compared with the conventional method through computer simulations.

A Real Time Flame and Smoke Detection Algorithm Based on Conditional Test in YCbCr Color Model and Adaptive Differential Image (YCbCr 컬러 모델에서의 조건 검사와 적응적 차영상을 이용한 화염 및 연기 검출 알고리즘)

  • Lee, Doo-Hee;Yoo, Jae-Wook;Lee, Kang-Hee;Kim, Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.57-65
    • /
    • 2010
  • In this paper, we propose a new real-time algorithm detecting the flame and smoke in digital CCTV images. Because the forest fire causes the enormous human life and damage of property, the early management according to the early sensing is very important. The proposed algorithm for monitoring forest fire is classified into the flame sensing and detection of smoke. The flame sensing algorithm detects a flame through the conditional test at YCbCr color model from the single frame. For the detection of smoke, firstly the background range is set by using differences between current picture and the average picture among the adjacent frames in the weighted value, and the pixels which get out of this range and have a gray-scale are detected in the smoke area. Because the proposed flame sensing algorithm is stronger than the existing algorithms in the change of the illuminance according to the quantity of sunshine, and the smoke detection algorithm senses the pixel of a gray-scale with the smoke considering the amount of change for unit time, the effective early forest fire detection is possible. The experimental results indicate that the proposed algorithm provides better performance than existing algorithms.

Online Non-preemptive Deadline Scheduling for Weighted Jobs (가중치 작업들의 온라인 비선점 마감시한 스케줄링)

  • Kim Jae-Hoon;Chang Jung-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.2
    • /
    • pp.68-74
    • /
    • 2005
  • In deadline scheduling, jobs have deadlines by which they are completed. The scheduling algorithm determines which jobs are executed at each time. Then only the completed jobs contribute to the throughput or gain of the algorithm. The jobs have arbitrary weights and the gain of the algorithm is given as the sum of weights of the completed jobs. The goal of the scheduling algorithm is to maximize its gain. In this paper, we consider online non-preemptive scheduling, where jobs arrive online and the scheduling algorithm has no information about jobs arriving ahead. Also the jobs cannot be preempted or rejected while they are executed. For this problem, we obtain lower bounds for any online algorithms and also we propose an optimal online algorithm meeting the lower bounds.

Non-uniform Weighted Vibration Target Positioning Algorithm Based on Sensor Reliability

  • Yanli Chu;Yuyao He;Junfeng Chen;Qiwu Wu
    • Journal of Information Processing Systems
    • /
    • v.19 no.4
    • /
    • pp.527-539
    • /
    • 2023
  • In the positioning algorithm of two-dimensional planar sensor array, the estimation error of time difference-ofarrival (TDOA) algorithm is difficult to avoid. Thus, how to achieve accurate positioning is a key problem of the positioning technology based on planar array. In this paper, a method of sensor reliability discrimination is proposed, which is the foundation for selecting positioning sensors with small error and excellent performance, simplifying algorithm, and improving positioning accuracy. Then, a positioning model is established. The estimation characteristics of the least square method are fully utilized to calculate and fuse the positioning results, and the non-uniform weighting method is used to correct the weighting factors. It effectively handles the decreased positioning accuracy due to measurement errors, and ensures that the algorithm performance is improved significantly. Finally, the characteristics of the improved algorithm are compared with those of other algorithms. The experiment data demonstrate that the algorithm is better than the standard least square method and can improve the positioning accuracy effectively, which is suitable for vibration detection with large noise interference.

Variable Rate Limiter in Virus Throttling for Reducing Connection Delay (연결설정 지연 단축을 위한 바이러스 쓰로틀링의 가변 비율 제한기)

  • Shim, Jae-Hong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.559-566
    • /
    • 2006
  • Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connect requests within a certain ratio. The typical virus throttling detects worm occurrence by monitoring the length of delay queue with the fixed period of rate limiter. In this paper, we propose an algorithm that controls the period of rate limiter autonomically by utilizing the weighted average delay queue length and suggest various period determination policies that use the weighted average delay queue length as an input parameter. Through deep experiments, it is verified that the proposed technique is able to lessen inconvenience of users by reducing the connection delay time with haying just little effect on worm detection time.