Enhanced grey wolf optimisation algorithm for feature selection in anomaly detection

Anomaly detection deals with identification of items that do not conform to an expected pattern or items present in a dataset. The performance of different mechanisms utilized to perform the anomaly detection depends heavily on the group of features used. Thus, not all features in the dataset can be used in the classification process since some features may lead to low performance of classifier. Feature selection (FS) is a good mechanism that minimises the dimension of high-dimensional datasets by deleting the irrelevant features. Modified Binary Grey Wolf Optimiser (MBGWO) is a modern metaheuristic algorithm that has successfully been used for FS for anomaly detection. However, the MBGWO has several issues in finding a good quality solution. Thus, this study proposes an enhanced binary grey wolf optimiser (EBGWO) algorithm for FS in anomaly detection to overcome the algorithm issues. The first modification enhances the initial population of the MBGWO using a heuristic based Ant Colony Optimisation algorithm. The second modification develops a new position update mechanism using the Bat Algorithm movement. The third modification improves the controlled parameter of the MBGWO algorithm using indicators from the search process to refine the solution. The EBGWO algorithm was evaluated on NSL-KDD and six (6) benchmark datasets from the University California Irvine (UCI) repository against ten (10) benchmark metaheuristic algorithms. Experimental results of the EBGWO algorithm on the NSL-KDD dataset in terms of number of selected features and classification accuracy are superior to other benchmark optimisation algorithms. Moreover, experiments on the six (6) UCI datasets showed that the EBGWO algorithm is superior to the benchmark algorithms in terms of classification accuracy and second best for the number of selected features. The proposed EBGWO algorithm can be used for FS in anomaly detection tasks that involve any dataset size from various application domains

Optimal Overcurrent Relays Coordination using an Improved Grey Wolf Optimizer

Recently, nature inspired algorithms (NIA) have been implemented to various fields of optimization problems. In this paper, the implementation of NIA is reported to solve the overcurrent relay coordination problem. The purpose is to find the optimal value of the Time Multiplier Setting (TMS) and Plug Setting (PS) in order to minimize the primary relays’ operating time at the near end fault. The optimization is performed using the Improved Grey Wolf Optimization (IGWO) algorithm. Some modifications to the original GWO have been made to improve the candidate’s exploration ability. Comprehensive simulation studies have been performed to demonstrate the reliability and efficiency of the proposed modification technique compared to the conventional GWO and some well-known algorithms. The generated results have confirmed the proposed IGWO is able to optimize the objective function of the overcurrent relay coordination problem

Omega grey wolf optimizer (ωGWO) for optimization of overcurrent relays coordination with distributed generation

Inverse definite minimum time (IDMT) overcurrent relays (OCRs) are among protective devices installed in electrical power distribution networks. The devices are used to detect and isolate the faulty area from the system in order to maintain the reliability and availability of the electrical supply during contingency condition. The overall protection coordination is thus very complicated and could not be satisfied using the conventional method moreover for the modern distribution system. This thesis apply a meta-heuristic algorithm called Grey Wolf Optimizer (GWO) to minimize the overcurrent relays operating time while fulfilling the inequality constraints. GWO is inspired by the hunting behavior of the grey wolf which have firm social dominant hierarchy. Comparative studies have been performed in between GWO and the other well-known methods such as Differential Evolution (DE), Particle Swarm Optimizer (PSO) and Biogeographybased Optimizer (BBO), to demonstrate the efficiency of the GWO. The study is resumed with an improvement to the original GWO’s exploration formula named as Omega-GWO (ωGWO) to enhance the hunting ability. The ωGWO is then implemented to the realdistribution network with the distributed generation (DG) in order to investigate the drawbacks of the DG insertion towards the original overcurrent relays configuration setting. The GWO algorithm is tested to four different test cases which are IEEE 3 bus (consists of six OCRs), IEEE 8 bus (consists of 14 OCRs), 9 bus (consists of 24 OCRs) and IEEE 15 bus (consists of 42 OCRs) test systems with normal inverse (NI) characteristic curve for all test cases and very inverse (VI) curve for selected cases to test the flexibility of the GWO algorithm. The real-distribution network in Malaysia which originally without DG is chosen, to investigate and recommend the optimal DG placement that have least negative impact towards the original overcurrent coordination setting. The simulation results from this study has established that GWO is able to produce promising solutions by generating the lowest operating time among other reviewed algorithms. The superiority of the GWO algorithm is proven with relays’ operational time are reduced for about 0.09 seconds and 0.46 seconds as compared to DE and PSO respectively. In addition, the computational time of the GWO algorithm is faster than DE and PSO with the respective reduced time is 23 seconds and 37 seconds. In Moreover, the robustness of GWO algorithm is establish with low standard deviation of 1.7142 seconds as compared to BBO. The ωGWO has shown an improvement for about 55% and 19% compared to other improved and hybrid method of GA-NLP and PSO-LP respectively and 0.7% reduction in relays operating time compared to the original GWO. The investigation to the DG integration has disclosed that the scheme is robust and appropriate to be implemented for future system operational and topology revolutions

Automated liver tissues delineation based on machine learning techniques: A survey, current trends and future orientations

There is no denying how machine learning and computer vision have grown in the recent years. Their highest advantages lie within their automation, suitability, and ability to generate astounding results in a matter of seconds in a reproducible manner. This is aided by the ubiquitous advancements reached in the computing capabilities of current graphical processing units and the highly efficient implementation of such techniques. Hence, in this paper, we survey the key studies that are published between 2014 and 2020, showcasing the different machine learning algorithms researchers have used to segment the liver, hepatic-tumors, and hepatic-vasculature structures. We divide the surveyed studies based on the tissue of interest (hepatic-parenchyma, hepatic-tumors, or hepatic-vessels), highlighting the studies that tackle more than one task simultaneously. Additionally, the machine learning algorithms are classified as either supervised or unsupervised, and further partitioned if the amount of works that fall under a certain scheme is significant. Moreover, different datasets and challenges found in literature and websites, containing masks of the aforementioned tissues, are thoroughly discussed, highlighting the organizers original contributions, and those of other researchers. Also, the metrics that are used excessively in literature are mentioned in our review stressing their relevancy to the task at hand. Finally, critical challenges and future directions are emphasized for innovative researchers to tackle, exposing gaps that need addressing such as the scarcity of many studies on the vessels segmentation challenge, and why their absence needs to be dealt with in an accelerated manner.Comment: 41 pages, 4 figures, 13 equations, 1 table. A review paper on liver tissues segmentation based on automated ML-based technique

Integrative multimodal image analysis using physical models for characterization of brain tumors in radiotherapy

Therapy failure with subsequent tumor progress is a common problem in radiotherapy of high grade glioma. Definition of treatment volumes with CT and MRI is limited due to uncertainties concerning tumor outlines. The goal of the presented work was to enable assessment of tumor physiology and prediction of progression patterns using multi-modal image analysis and thus, improve target delineation. Physiological imaging modalities, such as 18F-FET PET, diffusion and perfusion MRI were used to predict recurrence patterns. The Medical Imaging Interaction ToolKit together with own software implementation enabled side-by-side evaluation of all image modalities. These included tools for PET analysis and a module for voxel wise fitting of dynamic data with pharmacokinetic models. Robustness and accuracy of parameter estimates were studied on synthetic perfusion data. Parameter feasibility for progression prediction was investigated on DCE MRI and 18F-FET PET data. Using the developed software tools, a pipeline for prediction of tumor progression patterns based on multi-modal image classification with a random forest machine learning algorithm was established. Exemplary prediction analysis was applied on a small patient set for illustration of workflow functionality and classification results

Algoritmos baseados em inteligência de enxames aplicados à multilimiarização de imagens

Orientador: Prof. Dr. Leandro dos Santos CoelhoDissertação (mestrado) - Universidade Federal do Paraná, Setor de Tecnologia, Programa de Pós-Graduação em Engenharia Elétrica. Defesa : Curitiba, 20/08/2018Inclui referências: p.117-122Área de concentração: Sistemas EletrônicosResumo: O processamento de imagens é uma área que cresce à medida que as tecnologias de geração e armazenamento de informações digitais evoluem. Uma das etapas iniciais do processamento de imagem é a segmentação, onde a multilimiarização é uma das técnicas de segmentação mais simples. Um focorelevante de pesquisa nesta área é o projeto de abordagens visando a separação de diferentes objetos na imagem em grupos, por meio de limiares, para facilitar assim a interpretação da informação contida na imagem. Uma imagem perde informação, ou entropia, quando é limiarizada. A equação de limiarização multiníveis de Kapur calcula, a partir dos limiares escolhidos, qual a quantidade de informação que uma imagem apresentará após a limiarização. Assim, pela maximização da equação de multimiliarização de Kapur, é possível determinar os limiares que retornam uma imagem com valor maior de entropia. Quanto maior a quantidade de limiares, maior a dificuldade para encontrar a melhor solução, devido ao aumento significativo da quantidade de possíveis soluções. O objetivo desta dissertação é de apresentar um estudo comparativodecinco algoritmos de otimização (meta-heurísticas de otimização)da inteligência de enxame, incluindo Otimização por Enxame de Partículas (PSO), Otimização por Enxame de Partículas Darwiniano (DPSO), Otimização por Enxame de Partículas Darwiniano de Ordem Fracionária (FO-DPSO), Otimizador baseado no comportamento dos Lobos-cinza (GWO) e Otimizador inspirado no comportamento da Formiga-leão (ALO), de forma a avaliarqual deles obtém a melhor solução e convergência em termos da função objetivo relacionada a entropia da imagem. Uma contribuição desta dissertação é a aplicação de diferentes meta-heurísticas de otimização ao problema de multilimiarização de imagens, assim como o estudo do impacto das suas variáveis de controle (hiperparâmetros) para o problema em questão.Nesta dissertação são apresentados resultados paraquatro imagens diferentes, sendo duas imagens registradas por satélite (Rio Hunza e Yellowstone) e outras duas imagens teste (benchmark) obtidas do Centro de Engenharia Elétrica e Ciência da Computação do MIT (Massachussetts Institute of Technology). Os resultados são comparados considerando a média e o desvio padrão da entropia de cada imagem resultante. Com base nos resultados obtidos conclui-se que o algoritmo mais indicado para o problema de multilimiarização de imagens dos avaliados é o GWO, pelo seu desempenho superior em relação aos outros algoritmos e pelas entropias das imagens resultantes serem satisfatórias. Palavras-chave: Segmentação de imagens. Multilimiarização. Inteligência de enxames. Otimização por enxame de partículas. Otimizador dos lobos-cinza. Otimizador formiga-leão.Abstract: Image processing is a field that grows as digital information storage and generation technologies evolution. One of the initial stages of image processing is segmentation procedure, where the multi level thresholding is one of the simplest segmentation approaches. A relevant research objective in this field is the design of approaches aimed at separating different objects in the image into groups, through thresholds, to facilitate the interpretation of the information contained in the image. An image loses information, or entropy, when it is thresholded. The Kapur multilevel thresholding equation calculates, from the chosen thresholds, how much information an image will present after the thresholding. Thus, by the maximization of the Kapur multilevel limiarization equation, it is possible to determine the thresholds that return an image with a larger value of entropy. The higher the amount of thresholds, the greater the difficulty in finding the best solution, due to the significant increase in the quantity of possible solutions. The objective of this dissertation is to present a comparative study between fiveoptimization metaheuristics of the swarm intelligence field, including Particle Swarm Optimization (PSO), Darwinian Particle Swarm Optimization (DPSO), Fractional Order Darwinian Particle Swarm Optimization (FO-DPSO), Grey Wolf Optimizer (GWO) and the Ant lion behavioral optimizer (ALO), in order to identify which one gets the best solution and convergence in terms of the objective function and the entropy of the image. A contribution of this dissertation is the application of different optimization metaheuristics to the problem of multilimizing of images, as well as the study of the impact of its control variables (hyperparameters) on the problem in question. Experiments are conducted with four images, two images being recorded by satellite (Hunza River and Yellowstone) and two other test(benchmark) images obtained from MIT's (Massachussetts Institute of Technology) Electrical Engineering and Computer Science Center. The results are compared considering the mean and standard deviation values of each resulting image entropy.Based on the results obtained it is concluded that the most suitable algorithm for the problem of multilevel thresholding of images is the GWO, for its superior performance in relation to the other tested algorithms and satisfactory entropies of the resulting images. Key-words: Image segmentation. Multilevel thresholding. Kapur's entropy. Swarm intelligence. Particle swarm optimization. Grey wolf optimizer. Ant lion optimizer

Deep Learning and Quantum-computing Based Optimization in Medical Imaging and Power Dispatcing

兵庫県立大学大学院202

Automated liver tissues delineation techniques: A systematic survey on machine learning current trends and future orientations

Machine learning and computer vision techniques have grown rapidly in recent years due to their automation, suitability, and ability to generate astounding results. Hence, in this paper, we survey the key studies that are published between 2014 and 2022, showcasing the different machine learning algorithms researchers have used to segment the liver, hepatic tumors, and hepatic-vasculature structures. We divide the surveyed studies based on the tissue of interest (hepatic-parenchyma, hepatic-tumors, or hepatic-vessels), highlighting the studies that tackle more than one task simultaneously. Additionally, the machine learning algorithms are classified as either supervised or unsupervised, and they are further partitioned if the amount of work that falls under a certain scheme is significant. Moreover, different datasets and challenges found in literature and websites containing masks of the aforementioned tissues are thoroughly discussed, highlighting the organizers' original contributions and those of other researchers. Also, the metrics used excessively in the literature are mentioned in our review, stressing their relevance to the task at hand. Finally, critical challenges and future directions are emphasized for innovative researchers to tackle, exposing gaps that need addressing, such as the scarcity of many studies on the vessels' segmentation challenge and why their absence needs to be dealt with sooner than later. 2022 The Author(s)This publication was made possible by an Award [GSRA6-2-0521-19034] from Qatar National Research Fund (a member of Qatar Foundation). The contents herein are solely the responsibility of the authors. Open Access funding provided by the Qatar National LibraryScopu

Applications of Medical Physics

Applications of Medical Physics” is a Special Issue of Applied Sciences that has collected original research manuscripts describing cutting-edge physics developments in medicine and their translational applications. Reviews providing updates on the latest progresses in this field are also included. The collection includes a total of 20 contributions by authors from 9 different countries, which cover several areas of medical physics, spanning from radiation therapy, nuclear medicine, radiology, dosimetry, radiation protection, and radiobiology