Search

Feature selection and lung nodule recognition are the core modules of the lung computer-aided detection (Lung CAD) system. To improve the performance of the Lung CAD system, algorithmic research is carried out for the above two parts, respectively. First, in view of the poor interpretability of deep features and the incomplete expression of clinically defined handcrafted features, a feature cascade method is proposed to obtain richer feature information of nodules as the final input of the classifier. Second, to better map the global characteristics of samples, the multiple kernel learning support vector machine (MKL-SVM) algorithm with a linear convex combination of polynomial kernel and sigmoid kernel is proposed. Furthermore, this paper applied the methods for speed contraction factor and roulette strategy, and a mixture of simulated annealing (SA) and particle swarm optimization (PSO) is used for global optimization, so as to solve the problem that the PSO is easy to lose particle diversity and fall into the local optimal solution as well as improve the model's training speed. Therefore, the MKL-SVM algorithm is presented in this paper, which is based on swarm intelligence optimization is proposed for lung nodule recognition. Finally, the algorithm construction experiments are conducted on the cooperative hospital dataset and compared with 8 advanced algorithms on the public dataset LUNA16. The experimental results show that the proposed algorithms can improve the accuracy of lung nodule recognition and reduce the missed detection of nodules. [ABSTRACT FROM AUTHOR]

Variational mode decomposition (VMD) has been applied in the field of rolling bearing fault diagnosis because of its good ability of frequency segmentation. Mode number K and quadratic penalty term α have a significant influence on the decomposition result of VMD. At present, the commonly used method is to determine these two parameters adaptively through intelligent optimization algorithm, namely, the parameter-adaptive VMD (PAVMD) method. The key of the PAVMD method is the setting of an objective function, and the traditional PAVMD method is prone to overdecomposition or underdecomposition. To solve these problems, an improved parameter-adaptive VMD (IPAVMD) method is proposed. A new objective function, the maximum average envelope kurtosis (MAEK), is proposed in this paper. The new objective function fully considers the equivalent filtering characteristics of VMD, and squared envelope kurtosis has good antinoise performance. In the optimization method, this paper uses an improved particle swarm optimization (PSO) algorithm. The MAEK and PSO can make sure the IPAVMD method reaches the best complete decomposition of the signal without an underdecomposition or overdecomposition problem. Through the analysis of simulation data and experimental data, the performance of the IPAVMD and the traditional PAVMD is compared. The comparison results show that the proposed IPAVMD has better performance and stronger robustness than the traditional method and is suitable for both single-fault and multiple-fault cases of rolling bearings. The research results have certain theoretical significance and application value for improving the fault diagnosis effect of rolling bearings. [ABSTRACT FROM AUTHOR]

This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment. [ABSTRACT FROM AUTHOR]

This paper presents an original and efficient PSO algorithm, which is divided into three phases: (1) stabilization, (2) breadth-first search, and (3) depth-first search. The proposed algorithm, called PSO-3P, was tested with 47 benchmark continuous unconstrained optimization problems, on a total of 82 instances. The numerical results show that the proposed algorithm is able to reach the global optimum. This work mainly focuses on unconstrained optimization problems from 2 to 1,000 variables. [ABSTRACT FROM AUTHOR]