Research and Design of Adaptive Noise Cancellation Based on Particle Swarm Optimization Algorithm

2012 ◽  
Vol 479-481 ◽  
pp. 1942-1945
Author(s):  
Jie Zhang ◽  
Shi Qi Jiang

Particle swarm optimization (PSO) is a kind of evolutionary computation technology which simulates the behavior of biological species. The essence of adaptive noise cancellation (ANC) is adjust the weight value of filter based on the input signals, the LMS algorithm is commonly used in this system, However, the convergence behavior and maladjustment of the LMS algorithm is seriously affected by the step-size μ, and the optimum value of μ cannot be determined easily, In this paper, Particle Swarm Optimization with linear decreasing inertia weight is proposed to solve the filter problem instead of LMS, taking the FIR filter of ANC as example, the simulation shows that ANC based on the PSO algorithm is better than classic ANC based on the LMS algorithm, and it gives the satisfactory results.

2014 ◽  
Vol 886 ◽  
pp. 390-393
Author(s):  
Jing Mo ◽  
Wei He ◽  
Dan Su ◽  
Jing Wei Wu

It presents the Multi-level filters idea of the adaptive noise cancellation system based on the fact that the adaptive noise cancellation system cant filter out noise signal completely. According to the linear combination and the variable step-size LMS algorithm, it analyzes the effects of the two level filters. Theory analyzing and simulation results prove that the multi-level filter can get a better the filtering effect than the one-filter, which improves the filter performance in terms of the fast convergence speed, tracking speed and the low maladjustment error. And the anti-noise materials with multi-level filter based on the adaptive noise cancellation system has the good de-noising ability of noisy signals.


2010 ◽  
Vol 118-120 ◽  
pp. 409-413
Author(s):  
Shao Tan Xu ◽  
Xin Yu Li ◽  
Liang Gao ◽  
Yi Sun

To realize the integration of process planning and scheduling (IPPS) in the manufacturing system, a particle swarm optimization (PSO) algorithm is utilized. Based on the general PSO (GPSO) model, one GPSO algorithm is projected to solve IPPS. In GPSO, crossover and mutation operations of genetic algorithm are respectively used for particles to exchange information and search randomly, and tabu search (TS) is used for particles’ local search. And time varying crossover probability and time varying maximum step size of tabu search are introduced. Experimental results show that IPPS can be solved by GPSO effectively. The feasibility of the proposed GPSO model and the significance of the research on IPPS are also demonstrated.


Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2868
Author(s):  
Gong Cheng ◽  
Huangfu Wei

With the transition of the mobile communication networks, the network goal of the Internet of everything further promotes the development of the Internet of Things (IoT) and Wireless Sensor Networks (WSNs). Since the directional sensor has the performance advantage of long-term regional monitoring, how to realize coverage optimization of Directional Sensor Networks (DSNs) becomes more important. The coverage optimization of DSNs is usually solved for one of the variables such as sensor azimuth, sensing radius, and time schedule. To reduce the computational complexity, we propose an optimization coverage scheme with a boundary constraint of eliminating redundancy for DSNs. Combined with Particle Swarm Optimization (PSO) algorithm, a Virtual Angle Boundary-aware Particle Swarm Optimization (VAB-PSO) is designed to reduce the computational burden of optimization problems effectively. The VAB-PSO algorithm generates the boundary constraint position between the sensors according to the relationship among the angles of different sensors, thus obtaining the boundary of particle search and restricting the search space of the algorithm. Meanwhile, different particles search in complementary space to improve the overall efficiency. Experimental results show that the proposed algorithm with a boundary constraint can effectively improve the coverage and convergence speed of the algorithm.


2021 ◽  
pp. 1-17
Author(s):  
J. Shobana ◽  
M. Murali

Text Sentiment analysis is the process of predicting whether a segment of text has opinionated or objective content and analyzing the polarity of the text’s sentiment. Understanding the needs and behavior of the target customer plays a vital role in the success of the business so the sentiment analysis process would help the marketer to improve the quality of the product as well as a shopper to buy the correct product. Due to its automatic learning capability, deep learning is the current research interest in Natural language processing. Skip-gram architecture is used in the proposed model for better extraction of the semantic relationships as well as contextual information of words. However, the main contribution of this work is Adaptive Particle Swarm Optimization (APSO) algorithm based LSTM for sentiment analysis. LSTM is used in the proposed model for understanding complex patterns in textual data. To improve the performance of the LSTM, weight parameters are enhanced by presenting the Adaptive PSO algorithm. Opposition based learning (OBL) method combined with PSO algorithm becomes the Adaptive Particle Swarm Optimization (APSO) classifier which assists LSTM in selecting optimal weight for the environment in less number of iterations. So APSO - LSTM ‘s ability in adjusting the attributes such as optimal weights and learning rates combined with the good hyper parameter choices leads to improved accuracy and reduces losses. Extensive experiments were conducted on four datasets proved that our proposed APSO-LSTM model secured higher accuracy over the classical methods such as traditional LSTM, ANN, and SVM. According to simulation results, the proposed model is outperforming other existing models.


Author(s):  
Na Geng ◽  
Zhiting Chen ◽  
Quang A. Nguyen ◽  
Dunwei Gong

AbstractThis paper focuses on the problem of robot rescue task allocation, in which multiple robots and a global optimal algorithm are employed to plan the rescue task allocation. Accordingly, a modified particle swarm optimization (PSO) algorithm, referred to as task allocation PSO (TAPSO), is proposed. Candidate assignment solutions are represented as particles and evolved using an evolutionary process. The proposed TAPSO method is characterized by a flexible assignment decoding scheme to avoid the generation of unfeasible assignments. The maximum number of successful tasks (survivors) is considered as the fitness evaluation criterion under a scenario where the survivors’ survival time is uncertain. To improve the solution, a global best solution update strategy, which updates the global best solution depends on different phases so as to balance the exploration and exploitation, is proposed. TAPSO is tested on different scenarios and compared with other counterpart algorithms to verify its efficiency.


2021 ◽  
Vol 13 (6) ◽  
pp. 1207
Author(s):  
Junfei Yu ◽  
Jingwen Li ◽  
Bing Sun ◽  
Yuming Jiang ◽  
Liying Xu

Synthetic aperture radar (SAR) systems are susceptible to radio frequency interference (RFI). The existence of RFI will cause serious degradation of SAR image quality and a huge risk of target misjudgment, which makes the research on RFI suppression methods receive widespread attention. Since the location of the RFI source is one of the most vital information for achieving RFI spatial filtering, this paper presents a novel location method of multiple independent RFI sources based on direction-of-arrival (DOA) estimation and the non-convex optimization algorithm. It deploys an L-shaped multi-channel array on the SAR system to receive echo signals, and utilizes the two-dimensional estimating signal parameter via rotational invariance techniques (2D-ESPRIT) algorithm to estimate the positional relationship between the RFI source and the SAR system, ultimately combines the DOA estimation results of multiple azimuth time to calculate the geographic location of RFI sources through the particle swarm optimization (PSO) algorithm. Results on simulation experiments prove the effectiveness of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document