Search

The image object recognition and detection technology are widely used in many scenarios. In recent years, big data has become increasingly abundant, and big data-driven artificial intelligence models have attracted more and more attention. Evolutionary computation has also provided a powerful driving force for the optimization and improvement of deep learning models. In this paper, we propose an image object detection method based on self-supervised and data-driven learning. Differ from other methods, our approach stands out due to its innovative use of multispectral data fusion and evolutionary computation for model optimization. Specifically, our method uniquely combines visible light images and infrared images to detect and identify image targets. Firstly, we utilize a self-supervised learning method and the AutoEncoder model to perform high-dimensional feature extraction on the two types of images. Secondly, we fuse the extracted features from the visible light and infrared images to detect and identify objects. Thirdly, we introduce a model parameter optimization method using evolutionary learning algorithms to enhance model performance. Validation on public datasets shows that our method achieves comparable or superior performance to existing methods. [ABSTRACT FROM AUTHOR]

Detecting brain tumours is complex due to the natural variation in their location, shape, and intensity in images. While having accurate detection and segmentation of brain tumours would be beneficial, current methods still need to solve this problem despite the numerous available approaches. Precise analysis of Magnetic Resonance Imaging (MRI) is crucial for detecting, segmenting, and classifying brain tumours in medical diagnostics. Magnetic Resonance Imaging is a vital component in medical diagnosis, and it requires precise, efficient, careful, efficient, and reliable image analysis techniques. The authors developed a Deep Learning (DL) fusion model to classify brain tumours reliably. Deep Learning models require large amounts of training data to achieve good results, so the researchers utilised data augmentation techniques to increase the dataset size for training models. VGG16, ResNet50, and convolutional deep belief networks networks extracted deep features from MRI images. Softmax was used as the classifier, and the training set was supplemented with intentionally created MRI images of brain tumours in addition to the genuine ones. The features of two DL models were combined in the proposed model to generate a fusion model, which significantly increased classification accuracy. An openly accessible dataset from the internet was used to test the model's performance, and the experimental results showed that the proposed fusion model achieved a classification accuracy of 98.98%. Finally, the results were compared with existing methods, and the proposed model outperformed them significantly. [ABSTRACT FROM AUTHOR]

Plant leaf diseases are challenging to categorize due to the complexity of the pattern variations and the high degrees of inter‐class similarity. Plant ailments harm food quality and production. To ensure the quality and quantity of harvests, it is essential to protect plants from disease. Detection of diseases at an early stage is the main and the most complex task for farmers due to common morphological properties like colour, shape, texture, and edges. In this study, a Hybrid Deep Learning model named Hybrid‐Convolutional Support Machine (H‐CSM) based on 'Support Vector Machine (SVM)', 'Convolutional Neural Network (CNN)' and 'Convolutional Block Attention Module (CBAM)' is proposed for the early diagnosis and classification of leaf diseases in plants leaf. The suggested model can initially identify different plant leaf illnesses, although it is not constrained to these. A database of pictures of plant leaves is used to test the suggested method based on different evaluation parameters. The results were highly promising, with an accuracy of up to 98.72% which has been increased by applying better learning methods. Farmers can quickly identify 36 common diseases with a little instruction for 14 plant categories, enabling them to take prompt preventive measures using the proposed method. [ABSTRACT FROM AUTHOR]

Cephalometric analysis has an important and essential role to treat the patients with craniofacial and dentofacial deformities. Cephalometric analysis is a relationship of human geometry which can be quantified and derived from the linear and angular measurements. To treat any patient, such analysis is required to be performed on the Head X‐ray image of the patient. The objective of the proposed work is to detect cephalometric landmarks automatically on CT (computational tomography) images. Twenty cephalometric landmarks were automatically localized on 100 CT scans using hybrid coarse‐to‐fine computational method. The mean error for landmark detection was computed as 2.88 mm and standard deviation of 1.85 mm. The highest detection rate for cephalometric landmarks was received as 100% for Nasion landmark under 4‐mm error and the highest detection rate was received as 99% for Nasion landmark under 3‐mm error. The less number of datasets were used for the training and higher number of datasets were used for the testing. Compared to the literature methods, our method used higher number of datasets to demonstrate the accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

In this article, we present two resilient algorithms, the improved alternative hard c‐means (IAHCM) and the improved alternative fuzzy c‐means (IAFCM). We implement the Gaussian distance‐dependent function proposed by Zhang and Chen (D.‐Q. Zhang and Chen, 2004). In some cases, Zhang and Chen's metric distance does not account for the clustering centroid effect predicted by the large value. R* is employed in IAHCM and IAFCM to discover robust results while minimizing its sensitivity. Experiments are conducted using two‐and three‐dimensional data, including Diamond and Iris real‐world data. The results are based on demonstrating the robust simplicity and applicability of the offered algorithms. Similarly, computational complexity is assessed. [ABSTRACT FROM AUTHOR]

The significance of community structure in complex networks, such as social, biological, and online networks, has been widely recognized. Detecting communities in social media networks typically relies on two sources of information: the network's topological structure and node attributes. Incorporating rich node content attribute information poses both flexibility and challenges for community detection. Traditional approaches either focus on mining one information source or linearly combining results from both sources, which fails to effectively fuse the information. This paper introduces a practical collaborative learning approach that explores the multi-dimensional attribute characteristics of nodes to facilitate community division. By leveraging graphical matrix decomposition, the proposed algorithm, CDGMF, improves the effectiveness and robustness of community detection. Experimental results demonstrate the method's ability to effectively utilize node attribute information for guiding community detection, resulting in higher-quality community divisions. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) are capable of achieving data dissemination between them such that exploration of their potential could be performed based on their frequency range. It is considered to be highly difficult for recharging sensor devices under adverse situations. The main drawbacks of WSNs concern to the issue of network lifetime, coverage area, scheduling and data aggregation. In particular, prolonging network lifetime confirms the success together with the energy conservation of sensor nodes, data transmission reliability and scalability of their operation in data aggregation. Clustering schemes are considered to be highly suitable for effectively utilising the resources with lower overhead, such that energy consumption is enhanced for upgrading the network lifespan. In this paper, a Hybrid Modified Artificial Bee Colony and Firefly Algorithm (HMABCFA) -Based Cluster Head Selection is proposed for ensuring energy stabilisation, delay minimisation and inter-node distance reduction for improving the network lifetime. This proposed HMABCFA integrates the benefit of the Firefly optimisation algorithm for generating a new position that which has the capability of replacing the position, which is not updated in the scout bee phase of ABC. This incorporation of Firefly optimisation algorithm into the ABC algorithm prevents the limitations of premature convergence, slow convergence and the possibility of being trapped into the local point of optimality in the clustering process. The modified ABC-based clustering process is phenomenal in improving the feasible dimensions for enhancing the process of exploitation and exploration. The results of the HMABCFA, on an average are confirmed to enhance the network lifetime by 23.21%, energy stability by 19.84% and reduce network latency by 22.88%, compared to the benchmarked approaches. [ABSTRACT FROM AUTHOR]

This article outlines an integrated strategy that combines fuzzy multi‐objective programming and a multi‐criteria decision‐making framework to achieve a number of transportation system management‐related objectives. To rank fleet cars using various criteria enhancement, the Fuzzy technique for order of preference by resemblance to optimum solution are initially integrated. We then offer a novel Multi‐Objective Possibilistic Linear Programming (MOPLP) model, based on the rankings of the vehicles, to determine the number of vehicles chosen for the work while taking into consideration the constraints placed on them. The search for optimal solutions to MOPs has benefited from the decades‐long development of classical optimisation techniques. As a result of its potential for use in the real world, multi‐objective optimisation (MOO) under uncertainty has gained traction in recent years. Recently, fuzzy set theory has been used to solve challenges in multi‐objective linear programming. In this paper, we present a method for solving MOPs that makes use of both linear and non‐linear membership functions to maximize user happiness. A hypothetical case study of transportation issue is taken here. This innovative approach improves management for the betterment of transportation networks in smart cities. The method is a more robust and versatile approach to the complex difficulties of contemporary urban transportation because it incorporates the TOPSIS method for vehicle ranking and then using Distance Operator and variable Membership Functions in fuzzy goal programming operation on the selected vehicles. The results provide valuable insights into the strengths and limitations of each technique, facilitating informed decision‐making in real‐world optimization scenarios. [ABSTRACT FROM AUTHOR]