Hybrid bio-inspired lateral inhibition and Imperialist Competitive Algorithm for complicated image matching

Bio-inspired intelligent algorithms, such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), have been applied to solve image matching problems. However, due to high computational complexity and premature convergence problems associated with these methods, they have limitations in defining the global optimal matcher efficiently and accurately. To address these problems, we proposed a hybrid bio-inspired optimization approach, coupling the lateral inhibition mechanism and Imperialist Competitive Algorithm (ICA), to solve complicated image matching problems. With the adoption of the lateral inhibition mechanism, the global convergence of conventional ICA algorithms has been greatly improved. We demonstrate the efficiency and feasibility of the proposed approach by extensive comparative experiments.     

A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation

Recent advances in coupling novel optimization methods to large-scale computing problems have opened the door to tackling a diverse set of physically realistic engineering design problems. A large computational overhead is associated with computing the cost function for most practical problems involving complex physical phenomena. Such problems are also plagued with uncertainties in a diverse set of parameters. We present a novel stochastic derivative-free optimization approach for tackling such problems. Our method extends the previously developed surrogate management framework (SMF) to allow for uncertainties in both simulation parameters and design variables. The stochastic collocation scheme is employed for stochastic variables whereas Kriging based surrogate functions are employed for the cost function. This approach is tested on four numerical optimization problems and is shown to have significant improvement in efficiency over traditional Monte-Carlo schemes. Problems with multiple probabilistic constraints are also discussed.     

An Adaptive Rank Aggregation-Based Ensemble Multi-Filter Feature Selection Method in Software Defect Prediction

Feature selection is known to be an applicable solution to address the problem of high dimensionality in software defect prediction (SDP). However, choosing an appropriate filter feature selection (FFS) method that will generate and guarantee optimal features in SDP is an open research issue, known as the filter rank selection problem. As a solution, the combination of multiple filter methods can alleviate the filter rank selection problem. In this study, a novel adaptive rank aggregation-based ensemble multi-filter feature selection (AREMFFS) method is proposed to resolve high dimensionality and filter rank selection problems in SDP. Specifically, the proposed AREMFFS method is based on assessing and combining the strengths of individual FFS methods by aggregating multiple rank lists in the generation and subsequent selection of top-ranked features to be used in the SDP process. The efficacy of the proposed AREMFFS method is evaluated with decision tree (DT) and naïve Bayes (NB) models on defect datasets from different repositories with diverse defect granularities. Findings from the experimental results indicated the superiority of AREMFFS over other baseline FFS methods that were evaluated, existing rank aggregation based multi-filter FS methods, and variants of AREMFFS as developed in this study. That is, the proposed AREMFFS method not only had a superior effect on prediction performances of SDP models but also outperformed baseline FS methods and existing rank aggregation based multi-filter FS methods. Therefore, this study recommends the combination of multiple FFS methods to utilize the strength of respective FFS methods and take advantage of filter–filter relationships in selecting optimal features for SDP processes.     

Throughput maximization of an IRS-assisted wireless powered network with interference: A deep unsupervised learning approach

We consider an intelligent reflecting surface (IRS)-assisted wireless powered communication network (WPCN) in which a multi antenna power beacon (PB) sends a dedicated energy signal to a wireless powered source. The source first harvests energy and then utilizing this harvested energy, it sends an information signal to destination where an external interference may also be present. For the considered system model, we formulated an analytical problem in which the objective is to maximize the throughput by jointly optimizing the energy harvesting (EH) time and IRS phase shift matrices. The optimization problem is high dimensional non-convex, thus a good quality solution can be obtained by invoking any state-of-the-art algorithm such as Genetic algorithm (GA). It is well-known that the performance of GA is generally remarkable, however it incurs a high computational complexity. To this end, we propose a deep unsupervised learning (DUL) based approach in which a neural network (NN) is trained very efficiently as time-consuming task of labeling a data set is not required. Numerical examples show that our proposed approach achieves a better performance–complexity trade-off as it is not only several times faster but also provides almost same or even higher throughput as compared to the GA.     

Particle Swarm Optimization-Based Approach for Optic Disc Segmentation

Fundus segmentation is an important step in the diagnosis of ophthalmic diseases, especially glaucoma. A modified particle swarm optimization algorithm for optic disc segmentation is proposed, considering the fact that the current public fundus datasets do not have enough images and are unevenly distributed. The particle swarm optimization algorithm has been proved to be a good tool to deal with various extreme value problems, which requires little data and does not require pre-training. In this paper, the segmentation problem is converted to a set of extreme value problems. The scheme performs data preprocessing based on the features of the fundus map, reduces noise on the picture, and simplifies the search space for particles. The search space is divided into multiple sub-search spaces according to the number of subgroups, and the particles inside the subgroups search for the optimal solution in their respective sub-search spaces. The gradient values are used to calculate the fitness of particles and contours. The entire group is divided into some subgroups. Every particle flies in their exploration for the best solution. During the iteration, particles are not only influenced by local and global optimal solutions but also additionally attracted by particles between adjacent subgroups. By collaboration and information sharing, the particles are capable of obtaining accurate disc segmentation. This method has been tested with the Drishti-GS and RIM-ONE V3 dataset. Compared to several state-of-the-art methods, the proposed method substantially improves the optic disc segmentation results on the tested datasets, which demonstrates the superiority of the proposed work.     

Intelligent resource allocation for transmission security on IRS-assisted spectrum sharing systems with OFDM

In this paper, intelligent reflecting surface (IRS) technology is employed to enhance physical layer security (PLS) for spectrum sharing communication systems with orthogonal frequency division multiplexing (OFDM). Aiming to improve the secondary users’ secrecy rates, a design problem for jointly optimizing the transmission beamforming of secondary base station (SBS), the IRS’s reflecting coefficient and the channel allocation is formulated under the constraints of the requirements of minimum data rates of primary users and the interference between users. As the scenario is highly complex, it is quite challenging to address the non-convexity of the optimization problem. Thus, a deep reinforcement learning (DRL) based approach is taken into consideration. Specifically, we use dueling double deep Q networks (D3QN) and soft Actor–Critic (SAC) to solve the discrete and continuous action space optimization problems, respectively, taking full advantage of the maximum entropy RL algorithm to explore all possible optimal paths. Finally, simulation results show that our proposed approach has a great improvement in security transmission rate compared with the scheme without IRS and OFDM, and our proposed D3QN-SAC approach is more effective than other approaches in terms of maximum security transmission rate.     

Learning Competitive Swarm Optimization

Particle swarm optimization (PSO) is a popular method widely used in solving different optimization problems. Unfortunately, in the case of complex multidimensional problems, PSO encounters some troubles associated with the excessive loss of population diversity and exploration ability. This leads to a deterioration in the effectiveness of the method and premature convergence. In order to prevent these inconveniences, in this paper, a learning competitive swarm optimization algorithm (LCSO) based on the particle swarm optimization method and the competition mechanism is proposed. In the first phase of LCSO, the swarm is divided into sub-swarms, each of which can work in parallel. In each sub-swarm, particles participate in the tournament. The participants of the tournament update their knowledge by learning from their competitors. In the second phase, information is exchanged between sub-swarms. The new algorithm was examined on a set of test functions. To evaluate the effectiveness of the proposed LCSO, the test results were compared with those achieved through the competitive swarm optimizer (CSO), comprehensive particle swarm optimizer (CLPSO), PSO, fully informed particle swarm (FIPS), covariance matrix adaptation evolution strategy (CMA-ES) and heterogeneous comprehensive learning particle swarm optimization (HCLPSO). The experimental results indicate that the proposed approach enhances the entropy of the particle swarm and improves the search process. Moreover, the LCSO algorithm is statistically and significantly more efficient than the other tested methods.     

Bearing-Fault Diagnosis with Signal-to-RGB Image Mapping and Multichannel Multiscale Convolutional Neural Network

Deep learning bearing-fault diagnosis has shown strong vitality in recent years. In industrial practice, the running state of bearings is monitored by collecting data from multiple sensors, for instance, the drive end, the fan end, and the base. Given the complexity of the operating conditions and the limited number of bearing-fault samples, obtaining complementary fault features using the traditional fault-diagnosis method, which uses statistical characteristic in time or frequency, is difficult and relies heavily on prior knowledge. In addition, intelligent bearing-fault diagnosis based on a convolutional neural network (CNN) has several deficiencies, such as single-scale fixed convolutional kernels, excessive dependence on experts’ experience, and a limited capacity for learning a small training dataset. Considering these drawbacks, a novel intelligent bearing-fault-diagnosis method based on signal-to-RGB image mapping (STRIM) and multichannel multiscale CNN (MCMS-CNN) is proposed. First, the signals from three different sensors are converted into RGB images by the STRIM method to achieve feature fusion. To extract RGB image features effectively, the proposed MCMS-CNN is established, which can automatically learn complementary and abundant features at different scales. By increasing the width and decreasing the depth of the network, the overfitting caused by the complex network for a small dataset is eliminated, and the fault classification capability is guaranteed simultaneously. The performance of the method is verified through the Case Western Reserve University’s (CWRU) bearing dataset. Compared with different DL approaches, the proposed approach can effectively realize fault diagnosis and substantially outperform other methods.     

An Efficient Improved Greedy Harris Hawks Optimizer and Its Application to Feature Selection

To overcome the lack of flexibility of Harris Hawks Optimization (HHO) in switching between exploration and exploitation, and the low efficiency of its exploitation phase, an efficient improved greedy Harris Hawks Optimizer (IGHHO) is proposed and applied to the feature selection (FS) problem. IGHHO uses a new transformation strategy that enables flexible switching between search and development, enabling it to jump out of local optima. We replace the original HHO exploitation process with improved differential perturbation and a greedy strategy to improve its global search capability. We tested it in experiments against seven algorithms using single-peaked, multi-peaked, hybrid, and composite CEC2017 benchmark functions, and IGHHO outperformed them on optimization problems with different feature functions. We propose new objective functions for the problem of data imbalance in FS and apply IGHHO to it. IGHHO outperformed comparison algorithms in terms of classification accuracy and feature subset length. The results show that IGHHO applies not only to global optimization of different feature functions but also to practical optimization problems.     

A Multi-Objective Multi-Label Feature Selection Algorithm Based on Shapley Value

Multi-label learning is dedicated to learning functions so that each sample is labeled with a true label set. With the increase of data knowledge, the feature dimensionality is increasing. However, high-dimensional information may contain noisy data, making the process of multi-label learning difficult. Feature selection is a technical approach that can effectively reduce the data dimension. In the study of feature selection, the multi-objective optimization algorithm has shown an excellent global optimization performance. The Pareto relationship can handle contradictory objectives in the multi-objective problem well. Therefore, a Shapley value-fused feature selection algorithm for multi-label learning (SHAPFS-ML) is proposed. The method takes multi-label criteria as the optimization objectives and the proposed crossover and mutation operators based on Shapley value are conducive to identifying relevant, redundant and irrelevant features. The comparison of experimental results on real-world datasets reveals that SHAPFS-ML is an effective feature selection method for multi-label classification, which can reduce the classification algorithm’s computational complexity and improve the classification accuracy.     

UWB LOS/NLOS identification in multiple indoor environments using deep learning methods

Indoor location-aware service is booming in daily life and business activities, making the demand for precise indoor positioning systems thrive. The identification between line-of-sight (LOS) and non-line-of-sight (NLOS) is critical for wireless indoor time-of-arrival-based localization methods. Ultra-Wide-Band (UWB) is considered low cost among the many wireless positioning systems. It can resolve multi-path and have high penetration ability. This contribution addresses UWB NLOS/LOS identification problem in multiple environments. We propose a LOS/NLOS identification method using Convolutional Neural Network parallel with Gate Recurrent Unit, named Indoor NLOS/LOS identification Neural Network. The Convolutional Neural Network extracts spatial features of UWB channel impulse response data. While the Gate Recurrent Unit is an effective approach for designing deep recurrent neural networks which can extract temporal features. By integrating squeeze-and-extraction blocks into these architectures we can assign weights on channel-wise features. We simulated UWB channel impulse response signals in residential, office, and industrial scenarios based on the IEEE 802.15.4a channel model report. The presented network was tested in simulation scenarios and an open-source real-time measured dataset. Our method can solve NLOS identification problems for multiple indoor environments. Thus more versatile compare with networks only working in one scenario. Popular machine learning methods and deep learning methods are compared against our method. The test results show that the proposed network outperforms benchmark methods in simulation datasets and real-time measured datasets.     

Synthesis of long-period fiber gratings with a Lagrange multiplier optimization method

Based on the Lagrange multiplier optimization (LMO) method, a new synthesis approach for designing complex long-period fiber grating (LPG) filters is developed and demonstrated. The proposed synthesis method is a simple and direct approach. It was used to efficiently search for optimal solutions and constrain various parameters of the designed LPG filters according to practical requirements. The inverse scattering algorithm is a good tool for designing FBG filters; as well as for designing transmission-type fiber grating filters like LPGs. Compared to the results of the discrete layer-peeling (DLP) inverse scattering algorithm for LPGs, the synthesized LPGs, using the LMO approach, are more flexible and workable for the constraint conditions can be easily set in the user-defined cost functional, such as the limitation on the maximum value of the refractive index modulation and the parameters of the initial guess in LMO algorithm. Linear transmission LPG filters and EDFA gain flattening filters are synthesized and analyzed systematically by using the proposed method with different parameters. Moreover, as a variation-based method, we find that the convergence and the synthesized results of the LMO method are strongly dependent on the initial guess parameters.     

3D beamforming in Intelligent Reflecting Surface (IRS)-assisted multi-user cognitive radio networks

In this paper, we consider a multi-user cognitive radio network (CRN) equipped with an intelligent reflecting surface (IRS). We examine the network performance by evaluating the fairness of the secondary system, which is satisfying the minimum required signal to interference and noise ratio (SINR) for each secondary user (SU). The minimum SINR of the SUs is maximized by joint optimization of the beamforming vector and three-dimensional beamforming (3DBF) angles at the secondary base station (SBS) and also the phase shifts of the IRS elements. This optimization problem is highly non-convex. To solve this problem, we utilize Dinkelbach’s algorithm along with an alternating optimization (AO) approach to achieve some sub-problems. Accordingly, by further applying a semi-definite relaxation method, we convert these sub-problems to equivalent convex forms and find a solution. Furthermore, analytically we propose an algorithm for optimizing 3DBF angles at the SBS. Through numerical results, the improvement of the sum SINR of the secondary system using the proposed method is illustrated. Moreover, it is shown that as the number of reflecting elements of IRS increases, the sum SINR significantly augments while satisfying fairness. Also, the convergence of the proposed algorithm is verified utilizing numerical results.     

Multilevel Deep Feature Generation Framework for Automated Detection of Retinal Abnormalities Using OCT Images

Optical coherence tomography (OCT) images coupled with many learning techniques have been developed to diagnose retinal disorders. This work aims to develop a novel framework for extracting deep features from 18 pre-trained convolutional neural networks (CNN) and to attain high performance using OCT images. In this work, we have developed a new framework for automated detection of retinal disorders using transfer learning. This model consists of three phases: deep fused and multilevel feature extraction, using 18 pre-trained networks and tent maximal pooling, feature selection with ReliefF, and classification using the optimized classifier. The novelty of this proposed framework is the feature generation using widely used CNNs and to select the most suitable features for classification. The extracted features using our proposed intelligent feature extractor are fed to iterative ReliefF (IRF) to automatically select the best feature vector. The quadratic support vector machine (QSVM) is utilized as a classifier in this work. We have developed our model using two public OCT image datasets, and they are named database 1 (DB1) and database 2 (DB2). The proposed framework can attain 97.40% and 100% classification accuracies using the two OCT datasets, DB1 and DB2, respectively. These results illustrate the success of our model.     

Optimization design of RIS-assisted high-capacity visible light communications based on HDMA

In this paper, a new non-orthogonal multiple access (NOMA) scheme is proposed for the reconfigurable intelligent surface (RIS) assisted high-capacity visible light communication (VLC) system, which is named hybrid domain multiple access (HDMA). HDMA enjoys the benefit of hybrid-domain signals, including the power domain, code domain, and frequency domain, where the message passing algorithm (MPA) and successive interference cancellation (SIC) detectors are jointly used at the HDMA receiver. Furthermore, to achieve a higher communication capacity for the VLC system, we proposed an optimization model by jointly optimizing the power allocation ratio and RIS reflection units. The simulation results verified the proposed scheme. By comparing the system capacity of different RIS allocation schemes and multiple access methods, the VLC system based on HDMA proposed in this paper can significantly improve its communication capacity.     

基于混沌粒子群优化算法的异结构混沌反同步自抗扰控制

针对一类连续时间异结构混沌系统, 利用自抗扰控制很强的鲁棒性, 提出了一种异结构混沌系统反同步的自抗扰控制策略.针对所设计的自抗扰控制器参数较多, 难以整定的问题, 提出了应用混沌粒子群优化算法对控制器进行参数寻优设计. 以Lorenz系统和Chua系统两个异结构混沌系统为例进行仿真验证, 由仿真结果可知, 该方法可以实现异结构混沌系统较快的反同步控制, 且具有很强的抗干扰能力. 关键词： 异结构混沌系统反同步 自抗扰控制器 混沌粒子群优化算法 参数寻优     

Reliable Fault Diagnosis of Bearings Using an Optimized Stacked Variational Denoising Auto-Encoder

Variational auto-encoders (VAE) have recently been successfully applied in the intelligent fault diagnosis of rolling bearings due to its self-learning ability and robustness. However, the hyper-parameters of VAEs depend, to a significant extent, on artificial settings, which is regarded as a common and key problem in existing deep learning models. Additionally, its anti-noise capability may face a decline when VAE is used to analyze bearing vibration data under loud environmental noise. Therefore, in order to improve the anti-noise performance of the VAE model and adaptively select its parameters, this paper proposes an optimized stacked variational denoising autoencoder (OSVDAE) for the reliable fault diagnosis of bearings. Within the proposed method, a robust network, named variational denoising auto-encoder (VDAE), is, first, designed by integrating VAE and a denoising auto-encoder (DAE). Subsequently, a stacked variational denoising auto-encoder (SVDAE) architecture is constructed to extract the robust and discriminative latent fault features via stacking VDAE networks layer on layer, wherein the important parameters of the SVDAE model are automatically determined by employing a novel meta-heuristic intelligent optimizer known as the seagull optimization algorithm (SOA). Finally, the extracted latent features are imported into a softmax classifier to obtain the results of fault recognition in rolling bearings. Experiments are conducted to validate the effectiveness of the proposed method. The results of analysis indicate that the proposed method not only can achieve a high identification accuracy for different bearing health conditions, but also outperforms some representative deep learning methods.     

EGFAFS: A Novel Feature Selection Algorithm Based on Explosion Gravitation Field Algorithm

Feature selection (FS) is a vital step in data mining and machine learning, especially for analyzing the data in high-dimensional feature space. Gene expression data usually consist of a few samples characterized by high-dimensional feature space. As a result, they are not suitable to be processed by simple methods, such as the filter-based method. In this study, we propose a novel feature selection algorithm based on the Explosion Gravitation Field Algorithm, called EGFAFS. To reduce the dimensions of the feature space to acceptable dimensions, we constructed a recommended feature pool by a series of Random Forests based on the Gini index. Furthermore, by paying more attention to the features in the recommended feature pool, we can find the best subset more efficiently. To verify the performance of EGFAFS for FS, we tested EGFAFS on eight gene expression datasets compared with four heuristic-based FS methods (GA, PSO, SA, and DE) and four other FS methods (Boruta, HSICLasso, DNN-FS, and EGSG). The results show that EGFAFS has better performance for FS on gene expression data in terms of evaluation metrics, having more than the other eight FS algorithms. The genes selected by EGFAGS play an essential role in the differential co-expression network and some biological functions further demonstrate the success of EGFAFS for solving FS problems on gene expression data.     

Intelligent Reflecting Surface Assisted Secure Transmission in UAV-MIMO Communication Systems

This paper studies the intelligent reflecting surface (IRS) assisted secure transmission in unmanned aerial vehicle (UAV) communication systems, where the UAV base station, the legitimate receiver, and the malicious eavesdropper in the system are all equipped with multiple antennas. By deploying an IRS on the facade of a building, the UAV base station can be assisted to realize the secure transmission in this multiple-input multiple-output (MIMO) system. In order to maximize the secrecy rate (SR), the transmit precoding (TPC) matrix, artificial noise (AN) matrix, IRS phase shift matrix, and UAV position are jointly optimized subject to the constraints of transmit power limit, unit modulus of IRS phase shift, and maximum moving distance of UAV. Since the problem is non-convex, an alternating optimization (AO) algorithm is proposed to solve it. Specifically, the TPC matrix and AN covariance matrix are derived by the Lagrange dual method. The alternating direction method of multipliers (ADMM), majorization-minimization (MM), and Riemannian manifold gradient (RCG) algorithms are presented, respectively, to solve the IRS phase shift matrix, and then the performance of the three algorithms is compared. Based on the proportional integral (PI) control theory, a secrecy rate gradient (SRG) algorithm is proposed to iteratively search for the UAV position by following the direction of the secrecy rate gradient. The theoretic analysis and simulation results show that our proposed AO algorithm has a good convergence performance and can increase the SR by 40.5% compared with the method without IRS assistance.