Intelligent Path Planning with an Improved Sparrow Search Algorithm for Workshop UAV Inspection

Intelligent workshop UAV inspection path planning is a typical indoor UAV path planning technology. The UAV can conduct intelligent inspection on each work area of the workshop to solve or provide timely feedback on problems in the work area. The sparrow search algorithm (SSA), as a novel swarm intelligence optimization algorithm, has been proven to have good optimization performance. However, the reduction in the SSA's search capability in the middle or late stage of iterations reduces population diversity, leading to shortcomings of the algorithm, including low convergence speed, low solution accuracy and an increased risk of falling into local optima. To overcome these difficulties, an improved sparrow search algorithm (namely the chaotic mapping-firefly sparrow search algorithm (CFSSA)) is proposed by integrating chaotic cube mapping initialization, firefly algorithm disturbance search and tent chaos mapping perturbation search. First, chaotic cube mapping was used to initialize the population to improve the distribution quality and diversity of the population. Then, after the sparrow search, the firefly algorithm disturbance and tent chaos mapping perturbation were employed to update the positions of all individuals in the population to enable a full search of the algorithm in the solution space. This technique can effectively avoid falling into local optima and improve the convergence speed and solution accuracy. The simulation results showed that, compared with the traditional intelligent bionic algorithms, the optimized algorithm provided a greatly improved convergence capability. The feasibility of the proposed algorithm was validated with a final simulation test. Compared with other SSA optimization algorithms, the results show that the CFSSA has the best efficiency. In an inspection path planning problem, the CFSSA has its advantages and applicability and is an applicable algorithm compared to SSA optimization algorithms.

Hybrid Whale Optimization with a Firefly Algorithm for Function Optimization and Mobile Robot Path Planning

With the wide application of mobile robots, mobile robot path planning (MRPP) has attracted the attention of scholars, and many metaheuristic algorithms have been used to solve MRPP. Swarm-based algorithms are suitable for solving MRPP due to their population-based computational approach. Hence, this paper utilizes the Whale Optimization Algorithm (WOA) to address the problem, aiming to improve the solution accuracy. Whale optimization algorithm (WOA) is an algorithm that imitates whale foraging behavior, and the firefly algorithm (FA) is an algorithm that imitates firefly behavior. This paper proposes a hybrid firefly-whale optimization algorithm (FWOA) based on multi-population and opposite-based learning using the above algorithms. This algorithm can quickly find the optimal path in the complex mobile robot working environment and can balance exploitation and exploration. In order to verify the FWOA's performance, 23 benchmark functions have been used to test the FWOA, and they are used to optimize the MRPP. The FWOA is compared with ten other classical metaheuristic algorithms. The results clearly highlight the remarkable performance of the Whale Optimization Algorithm (WOA) in terms of convergence speed and exploration capability, surpassing other algorithms. Consequently, when compared to the most advanced metaheuristic algorithm, FWOA proves to be a strong competitor.

Enhancing the efficacy of depression detection system using optimal feature selection from EHR

Diagnosing depression at an early stage is crucial and majorly depends on the clinician's skill. The present work aims to develop an automated tool for assisting the diagnostic procedure of depression using multiple machine-learning techniques. The dataset of sample size 4184 used in this study contains biometric and demographic information of individuals with or without depression, accessed from the University of Nice Sophia-Antipolis. The Artificial Neural Network (ANN), Support Vector Machine (SVM), Random Forest (RF) and Extreme Gradient Boosting (XGBoost) are used for classifying the depressed from the control group. To enhance the computational efficiency, various feature selection algorithms like Recursive Feature Elimination (RFE), Mutual Information (MI) and three bio-inspired techniques, viz. Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Firefly Algorithms (FA) have been incorporated. To enhance the feature selection process further, majority voting is carried out in all possible combinations of three, four and five feature selection techniques. These feature selection techniques bring down the feature set size significantly to a mean of 33 from the actual size of 61 which is a reduction of 45.90%. The classification accuracy of the enhanced model varies between 84.18% and 88.46%, which is a significant improvement in performance as compared to the pre-existing models (83.76-85.89%). The proposed predictive models outperform the pre-existing classification models without feature selection and thereby enhancing both the performance and efficiency of the diagnostic process.

Fuzzy C-Means Clustering: A Review of Applications in Breast Cancer Detection

This paper reviews the potential use of fuzzy c-means clustering (FCM) and explores modifications to the distance function and centroid initialization methods to enhance image segmentation. The application of interest in the paper is the segmentation of breast tumours in mammograms. Breast cancer is the second leading cause of cancer deaths in Canadian women. Early detection reduces treatment costs and offers a favourable prognosis for patients. Classical methods, like mammograms, rely on radiologists to detect cancerous tumours, which introduces the potential for human error in cancer detection. Classical methods are labour-intensive, and, hence, expensive in terms of healthcare resources. Recent research supplements classical methods with automated mammogram analysis. The basic FCM method relies upon the Euclidean distance, which is not optimal for measuring non-spherical structures. To address these limitations, we review the implementation of a Mahalanobis-distance-based FCM (FCM-M). The three objectives of the paper are: (1) review FCM, FCM-M, and three centroid initialization algorithms in the literature, (2) illustrate the effectiveness of these algorithms in image segmentation, and (3) develop a Python package with the optimized algorithms to upload onto GitHub. Image analysis of the algorithms shows that using one of the three centroid initialization algorithms enhances the performance of FCM. FCM-M produced higher clustering accuracy and outlined the tumour structure better than basic FCM.

Classification of Retinal Diseases in Optical Coherence Tomography Images Using Artificial Intelligence and Firefly Algorithm

In recent years, the number of studies for the automatic diagnosis of biomedical diseases has increased. Many of these studies have used Deep Learning, which gives extremely good results but requires a vast amount of data and computing load. If the processor is of insufficient quality, this takes time and places an excessive load on the processor. On the other hand, Machine Learning is faster than Deep Learning and does not have a much-needed computing load, but it does not provide as high an accuracy value as Deep Learning. Therefore, our goal is to develop a hybrid system that provides a high accuracy value, while requiring a smaller computing load and less time to diagnose biomedical diseases such as the retinal diseases we chose for this study. For this purpose, first, retinal layer extraction was conducted through image preprocessing. Then, traditional feature extractors were combined with pre-trained Deep Learning feature extractors. To select the best features, we used the Firefly algorithm. In the end, multiple binary classifications were conducted instead of multiclass classification with Machine Learning classifiers. Two public datasets were used in this study. The first dataset had a mean accuracy of 0.957, and the second dataset had a mean accuracy of 0.954.

Greedy Firefly Algorithm for Optimizing Job Scheduling in IoT Grid Computing

The Internet of Things (IoT) is defined as interconnected digital and mechanical devices with intelligent and interactive data transmission features over a defined network. The ability of the IoT to collect, analyze and mine data into information and knowledge motivates the integration of IoT with grid and cloud computing. New job scheduling techniques are crucial for the effective integration and management of IoT with grid computing as they provide optimal computational solutions. The computational grid is a modern technology that enables distributed computing to take advantage of a organization's resources in order to handle complex computational problems. However, the scheduling process is considered an NP-hard problem due to the heterogeneity of resources and management systems in the IoT grid. This paper proposed a Greedy Firefly Algorithm (GFA) for jobs scheduling in the grid environment. In the proposed greedy firefly algorithm, a greedy method is utilized as a local search mechanism to enhance the rate of convergence and efficiency of schedules produced by the standard firefly algorithm. Several experiments were conducted using the GridSim toolkit to evaluate the proposed greedy firefly algorithm's performance. The study measured several sizes of real grid computing workload traces, starting with lightweight traces with only 500 jobs, then typical with 3000 to 7000 jobs, and finally heavy load containing 8000 to 10,000 jobs. The experiment results revealed that the greedy firefly algorithm could insignificantly reduce the makespan makespan and execution times of the IoT grid scheduling process as compared to other evaluated scheduling methods. Furthermore, the proposed greedy firefly algorithm converges on large search spacefaster , making it suitable for large-scale IoT grid environments.

Metaheuristic Algorithms Applied to Color Image Segmentation on HSV Space

In this research, we propose an unsupervised method for segmentation and edge extraction of color images on the HSV space. This approach is composed of two different phases in which are applied two metaheuristic algorithms, respectively the Firefly (FA) and the Artificial Bee Colony (ABC) algorithms. In the first phase, we performed a pixel-based segmentation on each color channel, applying the FA algorithm and the Gaussian Mixture Model. The FA algorithm automatically detects the number of clusters, given by histogram maxima of each single-band image. The detected maxima define the initial means for the parameter estimation of the GMM. Applying the Bayes’ rule, the posterior probabilities of the GMM can be used for assigning pixels to clusters. After processing each color channel, we recombined the segmented components in the final multichannel image. A further reduction in the resultant cluster colors is obtained using the inner product as a similarity index. In the second phase, once we have assigned all pixels to the corresponding classes of the HSV space, we carry out the second step with a region-based segmentation applied to the corresponding grayscale image. For this purpose, the bioinspired Artificial Bee Colony algorithm is performed for edge extraction.

Automatic detection of COVID-19 in chest radiographs using serially concatenated deep and handcrafted features

Since the infectious disease occurrence rate in the human community is gradually rising due to varied reasons, appropriate diagnosis and treatments are essential to control its spread. The recently discovered COVID-19 is one of the contagious diseases, which infected numerous people globally. This contagious disease is arrested by several diagnoses and handling actions. Medical image-supported diagnosis of COVID-19 infection is an approved clinical practice. This research aims to develop a new Deep Learning Method (DLM) to detect the COVID-19 infection using the chest X-ray. The proposed work implemented two methods namely, detection of COVID-19 infection using (i) a Firefly Algorithm (FA) optimized deep-features and (ii) the combined deep and machine features optimized with FA. In this work, a 5-fold cross-validation method is engaged to train and test detection methods. The performance of this system is analyzed individually resulting in the confirmation that the deep feature-based technique helps to achieve a detection accuracy of > 92% with SVM-RBF classifier and combining deep and machine features achieves > 96% accuracy with Fine KNN classifier. In the future, this technique may have potential to play a vital role in testing and validating the X-ray images collected from patients suffering from the infection diseases.

COVID-19 Case Recognition from Chest CT Images by Deep Learning, Entropy-Controlled Firefly Optimization, and Parallel Feature Fusion

In healthcare, a multitude of data is collected from medical sensors and devices, such as X-ray machines, magnetic resonance imaging, computed tomography (CT), and so on, that can be analyzed by artificial intelligence methods for early diagnosis of diseases. Recently, the outbreak of the COVID-19 disease caused many deaths. Computer vision researchers support medical doctors by employing deep learning techniques on medical images to diagnose COVID-19 patients. Various methods were proposed for COVID-19 case classification. A new automated technique is proposed using parallel fusion and optimization of deep learning models. The proposed technique starts with a contrast enhancement using a combination of top-hat and Wiener filters. Two pre-trained deep learning models (AlexNet and VGG16) are employed and fine-tuned according to target classes (COVID-19 and healthy). Features are extracted and fused using a parallel fusion approach-parallel positive correlation. Optimal features are selected using the entropy-controlled firefly optimization method. The selected features are classified using machine learning classifiers such as multiclass support vector machine (MC-SVM). Experiments were carried out using the Radiopaedia database and achieved an accuracy of 98%. Moreover, a detailed analysis is conducted and shows the improved performance of the proposed scheme.

Design Optimization of a Pneumatic Soft Robotic Actuator Using Model-Based Optimization and Deep Reinforcement Learning

We present two frameworks for design optimization of a multi-chamber pneumatic-driven soft actuator to optimize its mechanical performance. The design goal is to achieve maximal horizontal motion of the top surface of the actuator with a minimum effect on its vertical motion. The parametric shape and layout of air chambers are optimized individually with the firefly algorithm and a deep reinforcement learning approach using both a model-based formulation and finite element analysis. The presented modeling approach extends the analytical formulations for tapered and thickened cantilever beams connected in a structure with virtual spring elements. The deep reinforcement learning-based approach is combined with both the model- and finite element-based environments to fully explore the design space and for comparison and cross-validation purposes. The two-chamber soft actuator was specifically designed to be integrated as a modular element into a soft robotic pad system used for pressure injury prevention, where local control of planar displacements can be advantageous to mitigate the risk of pressure injuries and blisters by minimizing shear forces at the skin-pad contact. A comparison of the results shows that designs achieved using the deep reinforcement based approach best decouples the horizontal and vertical motions, while producing the necessary displacement for the intended application. The results from optimizations were compared computationally and experimentally to the empirically obtained design in the existing literature to validate the optimized design and methodology.

A detailed and comparative work for retinal vessel segmentation based on the most effective heuristic approaches

Computer based imaging and analysis techniques are frequently used for the diagnosis and treatment of retinal diseases. Although retinal images are of high resolution, the contrast of the retinal blood vessels is usually very close to the background of the retinal image. The detection of the retinal blood vessels with low contrast or with contrast close to the background of the retinal image is too difficult. Therefore, improving algorithms which can successfully distinguish retinal blood vessels from the retinal image has become an important area of research. In this work, clustering based heuristic artificial bee colony, particle swarm optimization, differential evolution, teaching learning based optimization, grey wolf optimization, firefly and harmony search algorithms were applied for accurate segmentation of retinal vessels and their performances were compared in terms of convergence speed, mean squared error, standard deviation, sensitivity, specificity. accuracy and precision. From the simulation results it is seen that the performance of the algorithms in terms of convergence speed and mean squared error is close to each other. It is observed from the statistical analyses that the algorithms show stable behavior and also the vessel and the background pixels of the retinal image can successfully be clustered by the heuristic algorithms.

Grey-Wolf-Based Wang's Demons for Retinal Image Registration

Image registration has an imperative role in medical imaging. In this work, a grey-wolf optimizer (GWO)-based non-rigid demons registration is proposed to support the retinal image registration process. A comparative study of the proposed GWO-based demons registration framework with cuckoo search, firefly algorithm, and particle swarm optimization-based demons registration is conducted. In addition, a comparative analysis of different demons registration methods, such as Wang’s demons, Tang’s demons, and Thirion’s demons which are optimized using the proposed GWO is carried out. The results established the superiority of the GWO-based framework which achieved 0.9977 correlation, and fast processing compared to the use of the other optimization algorithms. Moreover, GWO-based Wang’s demons performed better accuracy compared to the Tang’s demons and Thirion’s demons framework. It also achieved the best less registration error of 8.36 × 10⁻⁵.

Fuzzy Logic and Bio-Inspired Firefly Algorithm Based Routing Scheme in Intrabody Nanonetworks

An intrabody nanonetwork (IBNN) is composed of nanoscale (NS) devices, implanted inside the human body for collecting diverse physiological information for diagnostic and treatment purposes. The unique constraints of these NS devices in terms of energy, storage and computational resources are the primary challenges in the effective designing of routing protocols in IBNNs. Our proposed work explicitly considers these limitations and introduces a novel energy-efficient routing scheme based on a fuzzy logic and bio-inspired firefly algorithm. Our proposed fuzzy logic-based correlation region selection and bio-inspired firefly algorithm based nano biosensors (NBSs) nomination jointly contribute to energy conservation by minimizing transmission of correlated spatial data. Our proposed fuzzy logic-based correlation region selection mechanism aims at selecting those correlated regions for data aggregation that are enriched in terms of energy and detected information. While, for the selection of NBSs, we proposed a new bio-inspired firefly algorithm fitness function. The fitness function considers the transmission history and residual energy of NBSs to avoid exhaustion of NBSs in transmitting invaluable information. We conduct extensive simulations using the Nano-SIM tool to validate the in-depth impact of our proposed scheme in saving energy resources, reducing end-to-end delay and improving packet delivery ratio. The detailed comparison of our proposed scheme with different scenarios and flooding scheme confirms the significance of the optimized selection of correlated regions and NBSs in improving network lifetime and packet delivery ratio while reducing the average end-to-end delay.

Time Difference of Arrival (TDoA) Localization Combining Weighted Least Squares and Firefly Algorithm

Time difference of arrival (TDoA) based on a group of sensor nodes with known locations has been widely used to locate targets. Two-step weighted least squares (TSWLS), constrained weighted least squares (CWLS), and Newton–Raphson (NR) iteration are commonly used passive location methods, among which the initial position is needed and the complexity is high. This paper proposes a hybrid firefly algorithm (hybrid-FA) method, combining the weighted least squares (WLS) algorithm and FA, which can reduce computation as well as achieve high accuracy. The WLS algorithm is performed first, the result of which is used to restrict the search region for the FA method. Simulations showed that the hybrid-FA method required far fewer iterations than the FA method alone to achieve the same accuracy. Additionally, two experiments were conducted to compare the results of hybrid-FA with other methods. The findings indicated that the root-mean-square error (RMSE) and mean distance error of the hybrid-FA method were lower than that of the NR, TSWLS, and genetic algorithm (GA). On the whole, the hybrid-FA outperformed the NR, TSWLS, and GA for TDoA measurement.

A Novel Hybrid Meta-Heuristic Algorithm Based on the Cross-Entropy Method and Firefly Algorithm for Global Optimization

Global optimization, especially on a large scale, is challenging to solve due to its nonlinearity and multimodality. In this paper, in order to enhance the global searching ability of the firefly algorithm (FA) inspired by bionics, a novel hybrid meta-heuristic algorithm is proposed by embedding the cross-entropy (CE) method into the firefly algorithm. With adaptive smoothing and co-evolution, the proposed method fully absorbs the ergodicity, adaptability and robustness of the cross-entropy method. The new hybrid algorithm achieves an effective balance between exploration and exploitation to avoid falling into a local optimum, enhance its global searching ability, and improve its convergence rate. The results of numeral experiments show that the new hybrid algorithm possesses more powerful global search capacity, higher optimization precision, and stronger robustness.

The Nature-Inspired Metaheuristic Method for Predicting the Creep Strain of Green Concrete Containing Ground Granulated Blast Furnace Slag

The aim of this study was to develop a nature-inspired metaheuristic method to predict the creep strain of green concrete containing ground granulated blast furnace slag (GGBFS) using an artificial neural network (ANN)model. The firefly algorithm (FA) was used to optimize the weights in the ANN. For this purpose, the cement content, GGBFS content, water-to-binder ratio, fine aggregate content, coarse aggregate content, slump, the compaction factor of concrete and the age after loading were used as the input parameters, and in turn, the creep strain (ε_cr) of the GGBFS concrete was considered as the output parameters. To evaluate the accuracy of the FA-ANN model, it was compared with the well-known genetic algorithm (GA), imperialist competitive algorithm (ICA) and particle swarm optimization (PSO). Results indicated that the ANNs model, in which the weights were optimized by the FA, were more capable, flexible and precise than other optimization algorithms in predicting the ε_cr of GGBFS concrete.

A Novel Hybrid Swarm Optimized Multilayer Neural Network for Spatial Prediction of Flash Floods in Tropical Areas Using Sentinel-1 SAR Imagery and Geospatial Data

Flash floods are widely recognized as one of the most devastating natural hazards in the world, therefore prediction of flash flood-prone areas is crucial for public safety and emergency management. This research proposes a new methodology for spatial prediction of flash floods based on Sentinel-1 SAR imagery and a new hybrid machine learning technique. The SAR imagery is used to detect flash flood inundation areas, whereas the new machine learning technique, which is a hybrid of the firefly algorithm (FA), Levenberg–Marquardt (LM) backpropagation, and an artificial neural network (named as FA-LM-ANN), was used to construct the prediction model. The Bac Ha Bao Yen (BHBY) area in the northwestern region of Vietnam was used as a case study. Accordingly, a Geographical Information System (GIS) database was constructed using 12 input variables (elevation, slope, aspect, curvature, topographic wetness index, stream power index, toposhade, stream density, rainfall, normalized difference vegetation index, soil type, and lithology) and subsequently the output of flood inundation areas was mapped. Using the database and FA-LM-ANN, the flash flood model was trained and verified. The model performance was validated via various performance metrics including the classification accuracy rate, the area under the curve, precision, and recall. Then, the flash flood model that produced the highest performance was compared with benchmarks, indicating that the combination of FA and LM backpropagation is proven to be very effective and the proposed FA-LM-ANN is a new and useful tool for predicting flash flood susceptibility.

Feature Selection for Motor Imagery EEG Classification Based on Firefly Algorithm and Learning Automata

Motor Imagery (MI) electroencephalography (EEG) is widely studied for its non-invasiveness, easy availability, portability, and high temporal resolution. As for MI EEG signal processing, the high dimensions of features represent a research challenge. It is necessary to eliminate redundant features, which not only create an additional overhead of managing the space complexity, but also might include outliers, thereby reducing classification accuracy. The firefly algorithm (FA) can adaptively select the best subset of features, and improve classification accuracy. However, the FA is easily entrapped in a local optimum. To solve this problem, this paper proposes a method of combining the firefly algorithm and learning automata (LA) to optimize feature selection for motor imagery EEG. We employed a method of combining common spatial pattern (CSP) and local characteristic-scale decomposition (LCD) algorithms to obtain a high dimensional feature set, and classified it by using the spectral regression discriminant analysis (SRDA) classifier. Both the fourth brain-computer interface competition data and real-time data acquired in our designed experiments were used to verify the validation of the proposed method. Compared with genetic and adaptive weight particle swarm optimization algorithms, the experimental results show that our proposed method effectively eliminates redundant features, and improves the classification accuracy of MI EEG signals. In addition, a real-time brain-computer interface system was implemented to verify the feasibility of our proposed methods being applied in practical brain-computer interface systems.

A clustering method of Chinese medicine prescriptions based on modified firefly algorithm

This paper is aimed to study the clustering method for Chinese medicine (CM) medical cases. The traditional K-means clustering algorithm had shortcomings such as dependence of results on the selection of initial value, trapping in local optimum when processing prescriptions form CM medical cases. Therefore, a new clustering method based on the collaboration of firefly algorithm and simulated annealing algorithm was proposed. This algorithm dynamically determined the iteration of firefly algorithm and simulates sampling of annealing algorithm by fitness changes, and increased the diversity of swarm through expansion of the scope of the sudden jump, thereby effectively avoiding premature problem. The results from confirmatory experiments for CM medical cases suggested that, comparing with traditional K-means clustering algorithms, this method was greatly improved in the individual diversity and the obtained clustering results, the computing results from this method had a certain reference value for cluster analysis on CM prescriptions.

Prediction of protein-protein interaction network using a multi-objective optimization approach

Protein-Protein Interactions (PPIs) are very important as they coordinate almost all cellular processes. This paper attempts to formulate PPI prediction problem in a multi-objective optimization framework. The scoring functions for the trial solution deal with simultaneous maximization of functional similarity, strength of the domain interaction profiles, and the number of common neighbors of the proteins predicted to be interacting. The above optimization problem is solved using the proposed Firefly Algorithm with Nondominated Sorting. Experiments undertaken reveal that the proposed PPI prediction technique outperforms existing methods, including gene ontology-based Relative Specific Similarity, multi-domain-based Domain Cohesion Coupling method, domain-based Random Decision Forest method, Bagging with REP Tree, and evolutionary/swarm algorithm-based approaches, with respect to sensitivity, specificity, and F1 score.