• Title/Summary/Keyword: estimation of distribution algorithms

Search Result 84, Processing Time 0.027 seconds

Comparison of Two Speech Estimation Algorithms Based on Generalized-Gamma Distribution Applied to Speech Recognition in Car Noisy Environment (자동차 잡음환경에서의 음성인식에 적용된 두 종류의 일반화된 감마분포 기반의 음성추정 알고리즘 비교)

  • Kim, Hyoung-Gook;Lee, Jin-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.4
    • /
    • pp.28-32
    • /
    • 2009
  • This paper compares two speech estimators under a generalized Gamma distribution for DFT-based single-microphone speech enhancement methods. For the speech enhancement, the noise estimation based on recursive averaging spectral values by spectral minimum noise is applied to two speech estimators based on the generalized Gamma distribution using $\kappa$=1 or $\kappa$=2. The performance of two speech enhancement algorithms is measured by recognition accuracy of automatic speech recognition(ASR) in car noisy environment.

  • PDF

Adaptive Kernel Estimation for Learning Algorithms based on Euclidean Distance between Error Distributions (오차분포 유클리드 거리 기반 학습법의 커널 사이즈 적응)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.5
    • /
    • pp.561-566
    • /
    • 2021
  • The optimum kernel size for error-distribution estimation with given error samples cannot be used in the weight adjustment of minimum Euclidean distance between error distributions (MED) algorithms. In this paper, a new adaptive kernel estimation method for convergence enhancement of MED algorithms is proposed. The proposed method uses the average rate of change in error power with respect to a small interval of the kernel width for weight adjustment of the MED learning algorithm. The proposed kernel adjustment method is applied to experiments in communication channel compensation, and performance improvement is demonstrated. Unlike the conventional method yielding a very small kernel calculated through optimum estimation of error distribution, the proposed method converges to an appropriate kernel size for weight adjustment of the MED algorithm. The experimental results confirm that the proposed kernel estimation method for MED can be considered a method that can solve the sensitivity problem from choosing an appropriate kernel size for the MED algorithm.

Robust Ultrasound Multigate Blood Volume Flow Estimation

  • Zhang, Yi;Li, Jinkai;Liu, Xin;Liu, Dong Chyuan
    • Journal of Information Processing Systems
    • /
    • v.15 no.4
    • /
    • pp.820-832
    • /
    • 2019
  • Estimation of accurate blood volume flow in ultrasound Doppler blood flow spectrograms is extremely important for clinical diagnostic purposes. Blood volume flow measurements require the assessment of both the velocity distribution and the cross-sectional area of the vessel. Unfortunately, the existing volume flow estimation algorithms by ultrasound lack the velocity space distribution information in cross-sections of a vessel and have the problems of low accuracy and poor stability. In this paper, a new robust ultrasound volume flow estimation method based on multigate (RMG) is proposed and the multigate technology provides detail information on the local velocity distribution. In this method, an accurate double iterative flow velocity estimation algorithm (DIV) is used to estimate the mean velocity and it has been tested on in vivo data from carotid. The results from experiments indicate a mean standard deviation of less than 6% in flow velocities when estimated for a range of SNR levels. The RMG method is validated in a custom-designed experimental setup, Doppler phantom and imitation blood flow control system. In vitro experimental results show that the mean error of the RMG algorithm is 4.81%. Low errors in blood volume flow estimation make the prospect of using the RMG algorithm for real-time blood volume flow estimation possible.

Error Estimation Method for Matrix Correlation-Based Wi-Fi Indoor Localization

  • Sun, Yong-Liang;Xu, Yu-Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2657-2675
    • /
    • 2013
  • A novel neighbor selection-based fingerprinting algorithm using matrix correlation (MC) for Wi-Fi localization is presented in this paper. Compared with classic fingerprinting algorithms that usually employ a single received signal strength (RSS) sample, the presented algorithm uses multiple on-line RSS samples in the form of a matrix and measures correlations between the on-line RSS matrix and RSS matrices in the radio-map. The algorithm makes efficient use of on-line RSS information and considers RSS variations of reference points (RPs) for localization, so it offers more accurate localization results than classic neighbor selection-based algorithms. Based on the MC algorithm, an error estimation method using artificial neural network is also presented to fuse available information that includes RSS samples and localization results computed by the MC algorithm and model the nonlinear relationship between the available information and localization errors. In the on-line phase, localization errors are estimated and then used to correct the localization results to reduce negative influences caused by a static radio-map and RP distribution. Experimental results demonstrate that the MC algorithm outperforms the other neighbor selection-based algorithms and the error estimation method can reduce the mean of localization errors by nearly half.

Evolutionary Algorithms with Distribution Estimation by Variational Bayesian Mixtures of Factor Analyzers (변분 베이지안 혼합 인자 분석에 의한 분포 추정을 이용하는 진화 알고리즘)

  • Cho Dong-Yeon;Zhang Byoung-Tak
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.11
    • /
    • pp.1071-1083
    • /
    • 2005
  • By estimating probability distributions of the good solutions in the current population, some researchers try to find the optimal solution more efficiently. Particularly, finite mixtures of distributions have a very useful role in dealing with complex problems. However, it is difficult to choose the number of components in the mixture models and merge superior partial solutions represented by each component. In this paper, we propose a new continuous evolutionary optimization algorithm with distribution estimation by variational Bayesian mixtures of factor analyzers. This technique can estimate the number of mixtures automatically and combine good sub-solutions by sampling new individuals with the latent variables. In a comparison with two probabilistic model-based evolutionary algorithms, the proposed scheme achieves superior performance on the traditional benchmark function optimization. We also successfully estimate the parameters of S-system for the dynamic modeling of biochemical networks.

A Study for Efficient EM Algorithms for Estimation of the Proportion of a Mixed Distribution (분포 혼합비율의 모수추정을 위한 효율적인 알고리즘에 관한 연구)

  • 황강진;박경탁;유희경
    • Journal of Korean Society for Quality Management
    • /
    • v.30 no.4
    • /
    • pp.68-77
    • /
    • 2002
  • EM algorithm has good convergence rate for numerical procedures which converges on very small step. In the case of proportion estimation in a mixed distribution which has very big incomplete data or of update of new data continuously, however, EM algorithm highly depends on a initial value with slow convergence ratio. There have been many studies to improve the convergence rate of EM algorithm in estimating the proportion parameter of a mixed data. Among them, dynamic EM algorithm by Hurray Jorgensen and Titterington algorithm by D. M. Titterington are proven to have better convergence rate than the standard EM algorithm, when a new data is continuously updated. In this paper we suggest dynamic EM algorithm and Titterington algorithm for the estimation of a mixed Poisson distribution and compare them in terms of convergence rate by using a simulation method.

Comparison of Compton Image Reconstruction Algorithms for Estimation of Internal Radioactivity Distribution in Concrete Waste During Decommissioning of Nuclear Power Plant (원전 해체 시 방사성 콘크리트 폐기물 내부 방사능 분포 예측을 위한 컴프턴 영상 재구성 방법의 비교)

  • Lee, Tae-Woong;Jo, Seong-Min;Yoon, Chang-Yeon;Kim, Nak-Jeom
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.18 no.2
    • /
    • pp.217-225
    • /
    • 2020
  • Concrete waste accounts for approximately 70~80% of the total waste generated during the decommissioning of nuclear power plants (NPPs). Based upon the concentration of each radionuclide, the concrete waste from the decommissioning can be used in the determination of the clearance threshold used to classify waste as radioactive. To reduce the cost of radioactive concrete waste disposal, it is important to perform decontamination before self-disposal or limited recycling. Therefore, it is necessary to estimate the internal radioactivity distribution of radioactive concrete waste to ensure effective decontamination. In this study, the performance metrics of various Compton reconstruction algorithms were compared in order to identify the best strategy to estimate the internal radioactivity distribution in concrete waste during the decommissioning of NPPs. Four reconstruction algorithms, namely, simple back-projection, filtered back-projection, maximum likelihood expectation maximization (MLEM), and energy-deconvolution MLEM (E-MLEM) were used as Compton reconstruction algorithms. Subsequently, the results obtained by using these various reconstruction algorithms were compared with one another and evaluated, using quantitative evaluation methods. The MLEM and E-MLEM reconstruction algorithms exhibited the best performance in maintaining a high image resolution and signal-to-noise ratio (SNR), respectively. The results of this study demonstrate the feasibility of using Compton images in the estimation of the internal radioactive distribution of concrete during the decommissioning of NPPs.

Quasi-Lossless Fast Motion Estimation Algorithm using Distribution of Motion Vector and Adaptive Search Pattern and Matching Criterion (움직임벡터의 분포와 적응적인 탐색 패턴 및 매칭기준을 이용한 유사 무손실 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Jung, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.7
    • /
    • pp.991-999
    • /
    • 2010
  • In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

Design wind speed prediction suitable for different parent sample distributions

  • Zhao, Lin;Hu, Xiaonong;Ge, Yaojun
    • Wind and Structures
    • /
    • v.33 no.6
    • /
    • pp.423-435
    • /
    • 2021
  • Although existing algorithms can predict wind speed using historical observation data, for engineering feasibility, most use moment methods and probability density functions to estimate fitted parameters. However, extreme wind speed prediction accuracy for long-term return periods is not always dependent on how the optimized frequency distribution curves are obtained; long-term return periods emphasize general distribution effects rather than marginal distributions, which are closely related to potential extreme values. Moreover, there are different wind speed parent sample types; how to theoretically select the proper extreme value distribution is uncertain. The influence of different sampling time intervals has not been evaluated in the fitting process. To overcome these shortcomings, updated steps are introduced, involving parameter sensitivity analysis for different sampling time intervals. The extreme value prediction accuracy of unknown parent samples is also discussed. Probability analysis of mean wind is combined with estimation of the probability plot correlation coefficient and the maximum likelihood method; an iterative estimation algorithm is proposed. With the updated steps and comparison using a Monte Carlo simulation, a fitting policy suitable for different parent distributions is proposed; its feasibility is demonstrated in extreme wind speed evaluations at Longhua and Chuansha meteorological stations in Shanghai, China.

Applications of Harmony Search in parameter estimation of probability distribution models for non-homogeneous hydro-meteorological extreme events

  • Lee, Tae-Sam;Yoon, Suk-Min;Gang, Myung-Kook;Shin, Ju-Young;Jung, Chang-Sam
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2012.05a
    • /
    • pp.258-258
    • /
    • 2012
  • In frequency analyses of hydrological data, it is necessary for the interested variables to be homogenous and independent. However, recent evidences have shown that the occurrence of extreme hydro-meteorological events is influenced by large-scale climate variability, and the assumption of homogeneity does not generally hold anymore. Therefore, in order to associate the non-homogenous characteristics of hydro-meteorological variables, we propose the parameter estimation method of probability models using meta-heuristic algorithms, specifically harmony search. All the weather stations in South Korea were employed to demonstrate the performance of the proposed approaches. The results showed that the proposed parameter estimation method using harmony search is a comparativealternative for the probability distribution of the non-homogenous hydro-meteorological variables data.

  • PDF