54 research outputs found

    Designs of Digital Filters and Neural Networks using Firefly Algorithm

    Get PDF
    Firefly algorithm is an evolutionary algorithm that can be used to solve complex multi-parameter problems in less time. The algorithm was applied to design digital filters of different orders as well as to determine the parameters of complex neural network designs. Digital filters have several applications in the fields of control systems, aerospace, telecommunication, medical equipment and applications, digital appliances, audio recognition processes etc. An Artificial Neural Network (ANN) is an information processing paradigm that is inspired by the way biological nervous systems, such as the brain, processes information and can be simulated using a computer to perform certain specific tasks like clustering, classification, and pattern recognition etc. The results of the designs using Firefly algorithm was compared to the state of the art algorithms and found that the digital filter designs produce results close to the Parks McClellan method which shows the algorithm’s capability of handling complex problems. Also, for the neural network designs, Firefly algorithm was able to efficiently optimize a number of parameter values. The performance of the algorithm was tested by introducing various input noise levels to the training inputs of the neural network designs and it produced the desired output with negligible error in a time-efficient manner. Overall, Firefly algorithm was found to be competitive in solving the complex design optimization problems like other popular optimization algorithms such as Differential Evolution, Particle Swarm Optimization and Genetic Algorithm. It provides a number of adjustable parameters which can be tuned according to the specified problem so that it can be applied to a number of optimization problems and is capable of producing quality results in a reasonable amount of time

    Digital Filter Design Using Improved Teaching-Learning-Based Optimization

    Get PDF
    Digital filters are an important part of digital signal processing systems. Digital filters are divided into finite impulse response (FIR) digital filters and infinite impulse response (IIR) digital filters according to the length of their impulse responses. An FIR digital filter is easier to implement than an IIR digital filter because of its linear phase and stability properties. In terms of the stability of an IIR digital filter, the poles generated in the denominator are subject to stability constraints. In addition, a digital filter can be categorized as one-dimensional or multi-dimensional digital filters according to the dimensions of the signal to be processed. However, for the design of IIR digital filters, traditional design methods have the disadvantages of easy to fall into a local optimum and slow convergence. The Teaching-Learning-Based optimization (TLBO) algorithm has been proven beneficial in a wide range of engineering applications. To this end, this dissertation focusses on using TLBO and its improved algorithms to design five types of digital filters, which include linear phase FIR digital filters, multiobjective general FIR digital filters, multiobjective IIR digital filters, two-dimensional (2-D) linear phase FIR digital filters, and 2-D nonlinear phase FIR digital filters. Among them, linear phase FIR digital filters, 2-D linear phase FIR digital filters, and 2-D nonlinear phase FIR digital filters use single-objective type of TLBO algorithms to optimize; multiobjective general FIR digital filters use multiobjective non-dominated TLBO (MOTLBO) algorithm to optimize; and multiobjective IIR digital filters use MOTLBO with Euclidean distance to optimize. The design results of the five types of filter designs are compared to those obtained by other state-of-the-art design methods. In this dissertation, two major improvements are proposed to enhance the performance of the standard TLBO algorithm. The first improvement is to apply a gradient-based learning to replace the TLBO learner phase to reduce approximation error(s) and CPU time without sacrificing design accuracy for linear phase FIR digital filter design. The second improvement is to incorporate Manhattan distance to simplify the procedure of the multiobjective non-dominated TLBO (MOTLBO) algorithm for general FIR digital filter design. The design results obtained by the two improvements have demonstrated their efficiency and effectiveness

    Development of a Real-Time Single-Lead Single-Beat Frequency-Independent Myocardial Infarction Detector

    Get PDF
    The central aim of this research is the development and deployment of a novel multilayer machine learning design with unique application for the diagnosis of myocardial infarctions (MIs) from individual heartbeats of single-lead electrocardiograms (EKGs) irrespective of their sampling frequencies over a given range. To the best of our knowledge, this design is the first to attempt inter-patient myocardial infarction detection from individual heartbeats of single-lead (lead II) electrocardiograms that achieves high accuracy and near real-time diagnosis. The processing time of 300 milliseconds to a diagnosis is just at the time range in between extremely fast heartbeats of around 300 milliseconds, or 200 beats per minute. The design achieves stable performance metrics over the frequency range of 202Hz to 2.8kHz with an accuracy of 77.12%, positive predictive value (PPV) of 75.85%, and a negative predictive value (NPV) of 83.02% over the entire PTB database; 85.07%, 81.54%, 87.31% over the PTB-XL (the largest EKG database available for research) validation set, and 84.17%, 78.37%, 87.55% over the PTB-XL test set. Major design contributions and findings of this work reveal (1) a method for the realtime detection of ventricular depolarization events in the PQRST complex from 12-lead electrocardiograms using Independent Component Analysis (ICA), with a slightly different use of ICA proposed for electrocardiogram analysis and R-peak detection/localization; (2) a multilayer Long-Short Term Memory (LSTM) neural network design that identifies infarcted patients from a single heartbeat of a single-lead (lead II) electrocardiogram; (3) and integrated LSTM neural network with an algorithm that detects the R-peaks in real time for instantaneous detection of myocardial infarctions and for effective monitoring of patients under cardiac stress and/or at risk of myocardial infarction; (4) a fully integrated 12-lead real-time classifier with even higher detection metrics and a deeper neural architecture, which could serve as a near real-time monitoring tool that could gauge disease progression and evaluate benefits gained from early intervention and treatment planning; (5) a real-time frequency-independent design based on a single-lead single-beat MI detector, which is of pivotal importance to deployment as there is no standard sampling frequency for EKGs, making them span a wider frequency spectrum. vi

    Evolvable hardware platform for fault-tolerant reconfigurable sensor electronics

    Get PDF

    A Site-Specific Indoor Wireless Propagation Model

    Get PDF
    In this thesis, we explore the fundamental concepts behind the emerging field of site-specific propagation modeling for wireless communication systems. The first three chapters of background material discuss, respectively, the motivation for this study, the context of the study, and signal behavior and modeling in the predominant wireless propagation environments. A brief survey of existing ray-tracing based site-specific propagation models follows this discussion, leading naturally to the work of new model development undertaken in our thesis project. Following the detailed description of our generalized wireless channel modeling, various interference cases incorporating with this model are thoroughly discussed and results presented at the end of this thesis

    Applied Metaheuristic Computing

    Get PDF
    For decades, Applied Metaheuristic Computing (AMC) has been a prevailing optimization technique for tackling perplexing engineering and business problems, such as scheduling, routing, ordering, bin packing, assignment, facility layout planning, among others. This is partly because the classic exact methods are constrained with prior assumptions, and partly due to the heuristics being problem-dependent and lacking generalization. AMC, on the contrary, guides the course of low-level heuristics to search beyond the local optimality, which impairs the capability of traditional computation methods. This topic series has collected quality papers proposing cutting-edge methodology and innovative applications which drive the advances of AMC

    Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

    Get PDF
    Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

    Evolutionary Computation 2020

    Get PDF
    Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

    Biomedical Image Processing and Classification

    Get PDF
    Biomedical image processing is an interdisciplinary field involving a variety of disciplines, e.g., electronics, computer science, physics, mathematics, physiology, and medicine. Several imaging techniques have been developed, providing many approaches to the study of the human body. Biomedical image processing is finding an increasing number of important applications in, for example, the study of the internal structure or function of an organ and the diagnosis or treatment of a disease. If associated with classification methods, it can support the development of computer-aided diagnosis (CAD) systems, which could help medical doctors in refining their clinical picture
    • …
    corecore