Speech Enhancement Based on Adaptive Noise Cancellation and Particle Swarm Optimization

Speech enhancement is used in almost all modern communication systems. This is due to the quality of speech being degraded by environmental interference factors, such as: Acoustic additive noise, acoustic reverberation or white Gaussian noise. This paper, explores the potential of different benchmark optimization techniques for enhancing the speech signal. This is accomplished by fine tuning filter coefficients using a diverse set of adaptive filters for noise suppression in speech signals. We consider the Particle Swarm Optimization (PSO) and its variants in conjunction with the Adaptive Noise Cancellation (ANC) approach, for delivering dual speech enhancement. Comparative simulation results demonstrate the potential of an optimized coefficient ANC over a fixed one. Experiments are performed at different signal to noise ratios (SNRs), using two benchmark datasets: the NOIZEUS and Arabic dataset. The performance of the proposed algorithms is evaluated by maximising the perceptual evaluation of speech quality (PESQ) and comparing to the audio-only Wiener Filter (AW) and the Adaptive PSO for dual channel (APSOforDual) algorithms

Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

Multi-objective swarm intelligence-based (MOSI-based) metaheuristics were proposed to solve multi-objective optimization problems (MOPs) with conflicting objectives. Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. The reference point is determined by the decision maker to guide the search process to a particular region in the true Pareto front. However, HHMO algorithm produces a poor approximation to the Pareto front because lack of information sharing in its population update strategy, equal division of convergence parameter and randomly generated initial population. A two-step enhanced non-dominated sorting HHMO (2SENDSHHMO) algorithm has been proposed to solve this problem. The algorithm includes (i) a population update strategy which improves the movement of hawks in the search space, (ii) a parameter adjusting strategy to control the transition between exploration and exploitation, and (iii) a population generating method in producing the initial candidate solutions. The population update strategy calculates a new position of hawks based on the flush-and-ambush technique of Harris’s hawks, and selects the best hawks based on the non-dominated sorting approach. The adjustment strategy enables the parameter to adaptively changed based on the state of the search space. The initial population is produced by generating quasi-random numbers using Rsequence followed by adapting the partial opposition-based learning concept to improve the diversity of the worst half in the population of hawks. The performance of the 2S-ENDSHHMO has been evaluated using 12 MOPs and three engineering MOPs. The obtained results were compared with the results of eight state-of-the-art multi-objective optimization algorithms. The 2S-ENDSHHMO algorithm was able to generate non-dominated solutions with greater convergence and diversity in solving most MOPs and showed a great ability in jumping out of local optima. This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing