Ankit Kumar, Bijal Talati, Mihir Rajput, H. Trivedi
{"title":"A Novel Approach to Low Light Object Detection Using Exclusively Dark Images","authors":"Ankit Kumar, Bijal Talati, Mihir Rajput, H. Trivedi","doi":"10.1145/3533050.3533064","DOIUrl":"https://doi.org/10.1145/3533050.3533064","url":null,"abstract":"The efficiency of our vision highly depends on the light’s intensity. In dark images, the intensity of light in our surroundings is generally lower, reducing the efficiency of vision and the capability to distinguish different objects. An analysis of lowlight images is possible with handcrafted and learned features. This process of object recognition also needs to take into consideration the intensity of light that is produced by a particular pixel varies depending on the color space used for a particular image since different colors produce different intensities of light. Therefore, the exclusively dark dataset has been used recently as a benchmark dataset for object recognition in the dark that contains 10 low light illumination types and 12 different categories of objects, and it has the potential to be used as the standard database for benchmarking research in the domain of low light. CSPNet is essential for the purpose of feature extraction. This reduces the computational load required by our model and also ensures that the accuracy does not significantly reduce. When it is coupled with the CNN, the results show potential for practical applications. The goal of this paper is to further improve the recognition rate of various objects in the dark.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127624883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Elfeky, Madeleine Cochrane, L. Marsh, S. Elsayed, B. Sims, Simon Crase, D. Essam, R. Sarker
{"title":"Coevolutionary Algorithm for Evolving Competitive Strategies in the Weapon Target Assignment Problem","authors":"E. Elfeky, Madeleine Cochrane, L. Marsh, S. Elsayed, B. Sims, Simon Crase, D. Essam, R. Sarker","doi":"10.1145/3533050.3533052","DOIUrl":"https://doi.org/10.1145/3533050.3533052","url":null,"abstract":"This paper considers a non-cooperative real-time strategy game between two teams; each has multiple homogeneous players with identical capabilities. In particular, the first team consists of multiple land vehicles under attack by a team of drones, and the vehicles are equipped with weapons to counterattack the drones. However, with the increase in the number of drones, it may become difficult for human operators to coordinate actions across vehicles in a timely manner. Therefore, we explore a coevolutionary approach to simultaneously evolve competitive weapon target assignment strategies for the land vehicles and drone threats to address this problem. Different scenarios involving a different number of land vehicles and drone threats have been considered to evaluate the performance of the proposed approach. Results showed some advantages of applying such a coevolutionary approach.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116043633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of Hybrid PSO and SQP Algorithm in Optimization of the Retardance of Citrate Coated Ferrofluids","authors":"Jing-Fung Lin, J. Sheu","doi":"10.1145/3533050.3533060","DOIUrl":"https://doi.org/10.1145/3533050.3533060","url":null,"abstract":"The citrate (citric acid, CA) coated ferrofluids with great magneto-optical retardance can meet the high magnetic responsive demand, especially in widely potential biomedical applications such as hyperthermia and magnetic resonance imaging. In this study, the measured retardances are based on the Taguchi method with nine tests for four parameters, including pH of suspension, molar ratio of CA to Fe3O4, CA volume, and coating temperature. The retardance obtained from the double centrifugation test is also included. Three optimization algorithms including the particle swarm optimization (PSO), the sequential quadratic programming (SQP), and a hybrid PSO-SQP algorithm are executed to obtain high retardance. The comparisons are made among the retardance results obtained from these algorithms. Seven start points chosen from the orthogonal test are input into the SQP, the PSO is applied to the stepwise regression equation, and while executing the hybrid PSO-SQP algorithm, the parametric combination obtained by the PSO is adopted as the start point in the SQP simulation. The global optimum retardance and the corresponding parameter values are effectively assured by the global search ability of the PSO and the local search ability of the SQP.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115971671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Sangeetha, R. Krishankumar, K. S. Ravichandran, A. Gandomi
{"title":"Understanding the Effects of Ant Algorithms on Path Planning with Gain-Ant Colony Optimization","authors":"V. Sangeetha, R. Krishankumar, K. S. Ravichandran, A. Gandomi","doi":"10.1145/3533050.3533058","DOIUrl":"https://doi.org/10.1145/3533050.3533058","url":null,"abstract":"With the advent of more automated and unmanned systems, there is an increasing need for path planners. Intelligent path planners play an important role in the navigation of automated systems. In this work, the performance of an enhanced gain-ant colony optimization has been tested with the most popularly used ant algorithms – Ant system, Ant colony system and Min-Max ant system in the application of path planning. The pheromone update mechanism of traditional ant metaheuristic is enhanced with a local optimization mechanism and simulated with popular ant algorithms for an efficient choice of update rule. Evaluation is done using performance measures like path length and computation time taken. The results are statistically verified and analyzed. Path planned by proposed algorithm was found to be 3.25% shorter than existing algorithms.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128412925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Static Polynomial Approximation Using Set-based Particle Swarm Optimisation","authors":"Donovan Edeling, A. Engelbrecht","doi":"10.1145/3533050.3533061","DOIUrl":"https://doi.org/10.1145/3533050.3533061","url":null,"abstract":"Recently, a set-based particle swarm optimisation (SBPSO) algorithm was developed to find optimal polynomials for univariate polynomial approximation problems. This SBPSO algorithm employed a computational costly adaptive coordinate descent (ACD) algorithm to find optimal monomial coefficients. In addition, the ACD algorithm prematurely converged in coefficient space. This paper presents a variation of the SBPSO polynomial approximation algorithm where the ACD algorithm is replaced with a standard particle swarm optimisation (PSO) algorithm, which is applied to find optimal monomial coefficients only after an optimal polynomial architecture has been found. This results in a significant reduction in computational costs and prevents premature stagnation in coefficient space. The results show that the new SBPSO algorithm for polynomial approximation performs well on univariate, static polynomial approximation problems.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128896463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Discrete Whale Optimization Algorithm with a Spiral 3-opt Local Search for Solving the Traveling Salesperson Problem","authors":"Elias Rotondo, S. Heber","doi":"10.1145/3533050.3533056","DOIUrl":"https://doi.org/10.1145/3533050.3533056","url":null,"abstract":"The whale optimization algorithm is a metaheuristic inspired by the hunting strategy of humpback whales. This paper proposes a new discrete spiral whale optimization algorithm (DSWOA) to solve the traveling salesperson problem (TSP). Our approach uses sequential consecutive crossover and spiral 3-opt search, a modified version of the popular 3-opt local search. Spiral 3-opt search works like the original 3-opt heuristic but only uses part of the tour to generate 3-opt moves. We show that spiral 3-opt achieves results similar to the original 3-opt technique and significantly reduces runtime. We evaluate DSWOA's performance on 19 TSP instances against six benchmark algorithms. Our results suggest that DSWOA produces TSP solutions that are as good or better than our competitors. For five of the six benchmark algorithms, we demonstrated statistically significant improvements.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116491412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolutionary Algorithm for Solving Supervised Classification Problems: An Experimental Study","authors":"Daniel Soto, Wilson Soto","doi":"10.1145/3533050.3533054","DOIUrl":"https://doi.org/10.1145/3533050.3533054","url":null,"abstract":"Evolutionary Algorithms (EAs) are population-based, stochastic search algorithms that mimic natural evolution. Over the years, EAs have been successfully applied to many classification problems. In this paper, we propose to demonstrate the performance of an improved evolutionary algorithm for synthesizing classifiers in supervised data scenarios. This approach generates an arithmetic expression DAG (Directed Acyclic Graph) for each training class in order to adjust each test class to one of them. We compare our approach with well-known machine learning methods, such as SVM and KNN. The performance of the improved algorithm for evolving classifiers is competitive with respect to the solution quality.","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126757593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AxDFM:Position Prediction System Based on the Importance of High-Order Features","authors":"Chang Su, Haoxiang Feng, Xianzhong Xie","doi":"10.1145/3533050.3533065","DOIUrl":"https://doi.org/10.1145/3533050.3533065","url":null,"abstract":"The exploration and combination of high-level features is crucial for many machine learning tasks. At the same time, we cannot ignore the different importance of high-level features. In traditional machine learning predictive models, analyzing and combining the original data and manually making these features will undoubtedly increase the complexity and cost of the system. The emergence of factorization machines can use the vector product to represent the interaction of features, and automatically learn features The combination of to get high-order feature interactions not only reduces the complexity of the system, but also increases the diversity of high-order features. We refer to the depth factorization machine (xDeepFM) to generate high-level feature interactions at the display mode and vector level, and The importance of different features is dynamically learned through the squeeze-incentive (SENET) mechanism, and different weights are used for interaction.Then, use the attention mechanism to extract the importance of the obtained high-order features and assign weights, and finally get the prediction classification through the fully connected layer. We further summarized these methods into a unified model, and named the model the Advanced Attention Depth Factorization Machine (AxDFM).","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131410217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","authors":"","doi":"10.1145/3533050","DOIUrl":"https://doi.org/10.1145/3533050","url":null,"abstract":"","PeriodicalId":109214,"journal":{"name":"Proceedings of the 2022 6th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131552277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}