• Speech Sciences
• /
• v.14 no.2
• /
• pp.105-114
• /
• 2007

The performance of speaker identifier is severely degraded in noisy environments. A study suggested the concept of observation membership for enhancing performances of speaker identifier with noisy speech [1]. The method scaled observation probabilities of input speech by observation identification values decided by SNR. In the paper [1], the authors suggested heuristic parameter values for membership function. In this paper we attempt to apply particle swarm optimization (PSO) for obtaining the optimal parameters for speaker identification in noisy environments. With the speaker identification experiments using the ETRI database we prove that the optimization approach can yield better performance than using only the original membership function.

• Journal of computational fluids engineering
• /
• v.17 no.4
• /
• pp.32-40
• /
• 2012

Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

• Speech Sciences
• /
• v.15 no.4
• /
• pp.85-96
• /
• 2008

Automatic speech recognition has severe performance degradation under noisy environments. To cope with the noise problem, many methods have been proposed. Most of them focused on noise-robust features or model adaptation. However, researchers have overlooked utterance verification (UV) under noisy environments. In this paper we discuss UV problems based on the normalized confidence measure. First, we show that UV performance is also degraded in noisy environments with the experiments of an isolated word recognition. Then we observe how the degradation of UV performances is suffered. Based on the UV experiments we propose a modeling method of the statistics of phone confidences using sigmoid functions. For obtaining the parameters of the sigmoidal models, the particle swarm optimization (PSO) is adopted. The proposed method improves 20% rejection performance. Our experimental results show that the PSO-NCM can apply noise speech recognition successfully.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.1E
• /
• pp.30-35
• /
• 1998

Given a noisy sampled at equispaced points with white noise, we consider problems where the signal to be recovered is known to be positive; for example, images, chemical spectra or other measurements of intensities. Shrinking noisy wavelet coefficients via thresholding offers very attractive alternatives to existing methods of recovering signals from noisy data. In this paper, we propose a method of recovering the original signal from a corrupted noisy signal, guaranteeing the recovered signal positive. We first obtain wavelet coefficients by thresholding, and use a nonlinear optimization to find the denoised signal which must be positive. Numerical examples are used to illustrate the performance of the proposed algorithm.

• Journal of the Korea Society for Simulation
• /
• v.28 no.4
• /
• pp.21-32
• /
• 2019

Inspired by the social behavior models of a bird flock or fish school, particle swarm optimization (PSO) is a popular metaheuristic optimization algorithm and has been widely used from solving a complex optimization problem to learning a artificial neural network. However, PSO is difficult to apply to many real-life optimization problems involving stochastic noise, since it is originated in a deterministic environment. To resolve this problem, this paper incorporates a resampling method called the uncertainty evaluation (UE) method into PSO. The UE method allows the particles to converge on the accurate optimal solution quickly in a noisy environment by selecting the particles' global best position correctly, one of the significant factors in the performance of PSO. The results of comparative experiments on several benchmark problems demonstrated the improved performance of the propose algorithm compared to the existing studies. In addition, the results of the case study emphasize the necessity of this work. The proposed algorithm is expected to be effectively applied to optimize complex systems through digital twins in the fourth industrial revolution.

• Structural Engineering and Mechanics
• /
• v.52 no.1
• /
• pp.149-172
• /
• 2014

Four algorithms for damage detection of trusses are presented in this paper. These approaches can detect damage by using both complete and incomplete measurements. The suggested methods are based on the minimization of the difference between the measured and analytical static responses of structures. A non-linear constrained optimization problem is established to estimate the severity and location of damage. To reach the responses, the successive quadratic method is used. Based on the objective function, the stiffness matrix of the truss should be estimated and inverted in the optimization procedure. The differences of the proposed techniques are rooted in the strategy utilized for inverting the stiffness matrix of the damaged structure. Additionally, for separating the probable damaged members, a new formulation is proposed. This scheme is employed prior to the outset of the optimization process. Furthermore, a new tactic is presented to select the appropriate load pattern. To investigate the robustness and efficiency of the authors' method, several numerical tests are performed. Moreover, Monte Carlo simulation is carried out to assess the effect of noisy measurements on the estimated parameters.

• Phonetics and Speech Sciences
• /
• v.3 no.2
• /
• pp.65-70
• /
• 2011

Recently, audio-visual speech recognition (AVSR) has been studied to cope with noise problems in speech recognition. In this paper we propose a novel method of deciding weighting factors for audio-visual information fusion. We adopt the particle swarm optimization (PSO) to weighting factor determination. The AVSR experiments show that PSO-based normalized confidence measures (NCM) improve the rejection performance of mis-recognized words by 33%.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.4
• /
• pp.412-424
• /
• 2022

Since traditional derivative-based optimization for noisy simulation shows bad performance, evolutionary algorithms are considered as substitutes. Especially in case when outputs are binary, more simulation trials are needed to get near-optimal solution since the outputs are discrete and have high and heterogeneous variance. In this paper, we propose a genetic algorithm called SARAGA which adopts dynamic resampling and fitness approximation using surrogate. SARAGA reduces unnecessary numbers of expensive simulations to estimate success probabilities estimated from binary simulation outputs. SARAGA allocates number of samples to each solution dynamically and sometimes approximates the fitness without additional expensive experiments. Experimental results show that this novel approach is effective and proper hyper parameter choice of surrogate and resampling can improve the performance of algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.6 s.177
• /
• pp.1408-1418
• /
• 2000

Gradient-based optimization methods are inefficient in applications which require expensive function evaluations, and useless in applications where objective and/or constraint functions are 'noisy' due to modeling and cumulative numerical inaccuracy since gradient evaluation results cannot be reliable. Moreover, it is difficult to be integrated with commercial analysis software, and they cannot be employed when only experimental analysis results are available. In this research an optimization program based on a response surface method has been developed to overcome the aforementioned difficulties. Various methods for design of experiments and new proposed approximation models are implemented in the program. The effectiveness of the optimization program is tested on several test problems and results are discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.649-664
• /
• 2011

Cooperative spectrum sensing (CSS) with decision fusion is considered as a key technology for tackling the challenges caused by fading/shadowing effects and noise uncertainty in spectrum sensing in cognitive radio. However, most existing solutions assume an error-free decision transmission, which is obviously not the case in realistic scenarios. This paper extends the general decision-fusion-based CSS scheme by considering the fading/shadowing effects and noise corruption in the common control channels. With this more practical model, the fusion centre first estimates the local decisions using a binary minimum error probability detector, and then combines them to get the final result. Theoretical analysis and simulation of this CSS scheme are performed over typical channels, which suggest some performance deterioration compared with the pure case that assumes an error-free decision transmission. Furthermore, the fusion strategy optimization in the proposed cooperation model is also investigated using the Bayesian criteria. The numerical results show that the total error rate of noisy CSS is higher than that of the pure case, and the optimal values of fusion parameter in the counting rule under both cases decrease as the local detection threshold increases.