Temporal Lobe Epilepsy (TLE), a very common type of focal epilepsy, requires early and precise identification to enable prompt treatment and enhance patient outcomes. Traditional methods of detection, most notably manual MRI interpretation, tend to be time-consuming, subjective, and dependent on expert specialists, hindering their scalability and reliability. Due to the limitations of conventional and current automated systems—e.g., poor feature extraction, poor segmentation, and low accuracy in classification—this work presents NeuroTLEDNet, a new end-to-end artificial intelligence model for early TLE detection from medical images. The new methodology integrates multiple series of innovations across every processing phase. In preprocessing, skull stripping, Gaussian blurring, and color normalization are used to improve image uniformity and suppress irrelevant structures. In segmentation, the improved TLE-SegNet + is suggested—based on Mask R-CNN and supplemented with DarkNet-53, DenseNet, HetConv layers, and Attention Feature Pyramid Networks (FPN)—to facilitate highly accurate delineation of epileptogenic areas. For further describing the segmented areas, a rich feature space encompassing color histograms, Local Binary Patterns (LBP), and geometric features (eccentricity, area, perimeter) is developed. To resolve inefficiencies in feature selection, this paper presents the Squirrel Reptilian Optimization (SRO) algorithm, a new hybrid metaheuristic that incorporates both the Squirrel Search Algorithm (SSA) and the Reptile Search Algorithm (RSA). The hybrid enhances discriminative feature selection by handling exploration and exploitation dynamics better compared to individual methods. For categorization, NeuroTLEDNet utilizes an in-depth hybrid ensemble of 3D Convolutional Neural Networks (3D-CNN), Recurrent Neural Networks (RNN), Radial Basis Function Networks (RBFN), and SqueezeNet, facilitating powerful modeling of spatial-temporal relationships in brain MRI scans. Tested on an 80/30 split MRI dataset, the designed model attains a remarkable accuracy of 98.6%, outperforming current methods like CNN-LSTM (94.2%), Mask R-CNN (92.7%), and ResNet-based architectures (93.1%). Indeed, NeuroTLEDNet provides an end-to-end solution for the shortcomings of existing TLE detection methods by utilizing advanced preprocessing, segmentation, feature optimization, and hybrid classification, with state-of-the-art performance in terms of both accuracy and explainability. The suggested model is a promising candidate for clinical application, and it has the potential to assist neurologists in faster and more accurate TLE diagnosis.
Down syndrome (DS) is a genetic condition characterized by distinct facial features and developmental challenges, making early and accurate detection crucial for timely intervention and support. Traditional diagnostic methods often require specialized expertise, which can be resource intensive and inaccessible in many settings. In this study, we propose a novel artificial intelligence (AI)-driven approach to detecting DS using facial images, leveraging advancements in deep learning and machine learning for accurate and scalable diagnostics. A dataset of 168 facial images was curated from publicly accessible platforms, comprising 95 images of individuals without DS and 73 with the condition. The model was implemented using TensorFlow/PyTorch and employs RegNet X and Shifted Window Transformer (SWIN Transformer) for feature extraction, capturing both local and global facial features. To enhance feature representation, an attention-based fusion mechanism was applied, prioritizing the most discriminative patterns while filtering redundant information. For classification, an Extremely Randomized Tree (ExtraTrees) model was employed, known for its ability to efficiently handle high-dimensional data with strong generalization capabilities. The model was fine-tuned using Bayesian Optimization and Hyperband (BOHB), which optimized hyperparameters by balancing exploration and exploitation, thereby improving predictive performance. The final classification achieved a 99.2% accuracy with an area under the curve (AUC) of 1.00, demonstrating exceptional reliability in distinguishing DS from normal cases. By combining advanced feature extraction, fusion, and classification techniques, this study highlights the potential of AI to revolutionize DS diagnostics, offering a non-invasive, efficient, and scalable solution for early detection.
Down syndromeface classificationearly diagnosismodel interpretability
OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON) · 1-6
The deep Q-network (DQN) technique, as a classic value-based deep reinforcement learning process, has been widely applied in fields such as multi-robotic agent motion planning. However, the DQN method faces a series of tasks, such as overestimating Q-values, complex Q-value computations, neural networks lacking historical memory proficiencies, and inefficient exploration when using ε-greedy strategies. This paper proposes a DQN-based multi-robot agent deep reinforcement learning motion planning approach to solve these problems. To accomplish their objectives without colliding with one another, agents can acquire stable and efficient motion planning techniques with the aid of this method. Initially, a Dueling-based optimization tool is suggested, which is based on the DQN approach. It simplifies and improves the calculation of Q-values by calculating state values and advantage function values, and by choosing the appropriate action based on the parameters of the presently updating Q-value network. Additionally, we provide a GRU-based memory mechanism that incorporates GRU modules to facilitate the network's temporal data acquisition and handling of agents' historical information. And lastly, we offer a noise-based exploration technique that works. By introducing parameterized noise, the exploration technique in DQN is modified, improving the examination efficiency of agents, and achieving a balance between exploration and exploitation in multi-robotic agent systems. Tests were conducted in six different simulation scenarios on the PyBullet simulation platform. Experimental results show that the proposed method enables efficient collaboration among multi-robotic agent teams, agreeing them to go where they're going without running into each other, and the methods' training is steady.
Abstract The multi-objective grasshopper optimization algorithm (MOGOA) is a relatively new algorithm inspired by the collective behavior of grasshoppers, which aims to solve multi-objective optimization problems in IoT applications. In order to enhance its performance and improve global convergence speed, the algorithm integrates simulated annealing (SA). Simulated annealing is a metaheuristic algorithm that is commonly used to improve the search capability of optimization algorithms. In the case of MOGOA, simulated annealing is integrated by employing symmetric perturbation to control the movement of grasshoppers. This helps in effectively balancing exploration and exploitation, leading to better convergence and improved performance. The paper proposes two hybrid algorithms based on MOGOA, which utilize simulated annealing for solving multi-objective optimization problems. One of these hybrid algorithms combines chaotic maps with simulated annealing and MOGOA. The purpose of incorporating simulated annealing and chaotic maps is to address the issue of slow convergence and enhance exploitation by searching high-quality regions identified by MOGOA. Experimental evaluations were conducted on thirteen different benchmark functions to assess the performance of the proposed algorithms. The results demonstrated that the introduction of simulated annealing significantly improved the convergence of MOGOA. Specifically, the IDG (Inverse Distance Generational distance) values for benchmark functions ZDT1, ZDT2, and ZDT3 were smaller than the IDG values obtained by using MOGOA alone, indicating better performance in terms of convergence. Overall, the proposed algorithms exhibit promise in solving multi-objective optimization problems.