Generalised cellular neural networks (GCNNs) constructed using particle swarm optimisation for spatio-temporal evolutionary pattern identification

Particle swarm optimization (PSO) is introduced to implement a new constructive learning algorithm for training generalized cellular neural networks (GCNNs) for the identification of spatio-temporal evolutionary (STE) systems. The basic idea of the new PSO-based learning algorithm is to successively approximate the desired signal by progressively pursuing relevant orthogonal projections. This new algorithm will thus be referred to as the orthogonal projection pursuit (OPP) algorithm, which is in mechanism similar to the conventional projection pursuit approach. A novel two-stage hybrid training scheme is proposed for constructing a parsimonious GCNN model. In the first stage, the orthogonal projection pursuit algorithm is applied to adaptively and successively augment the network, where adjustable parameters of the associated units are optimized using a particle swarm optimizer. The resultant network model produced at the first stage may be redundant. In the second stage, a forward orthogonal regression (FOR) algorithm, aided by mutual information estimation, is applied to re. ne and improve the initially trained network. The effectiveness and performance of the proposed method is validated by applying the new modeling framework to a spatio-temporal evolutionary system identification problem

Block matching algorithm for motion estimation based on Artificial Bee Colony (ABC)

Block matching (BM) motion estimation plays a very important role in video coding. In a BM approach, image frames in a video sequence are divided into blocks. For each block in the current frame, the best matching block is identified inside a region of the previous frame, aiming to minimize the sum of absolute differences (SAD). Unfortunately, the SAD evaluation is computationally expensive and represents the most consuming operation in the BM process. Therefore, BM motion estimation can be approached as an optimization problem, where the goal is to find the best matching block within a search space. The simplest available BM method is the full search algorithm (FSA) which finds the most accurate motion vector through an exhaustive computation of SAD values for all elements of the search window. Recently, several fast BM algorithms have been proposed to reduce the number of SAD operations by calculating only a fixed subset of search locations at the price of poor accuracy. In this paper, a new algorithm based on Artificial Bee Colony (ABC) optimization is proposed to reduce the number of search locations in the BM process. In our algorithm, the computation of search locations is drastically reduced by considering a fitness calculation strategy which indicates when it is feasible to calculate or only estimate new search locations. Since the proposed algorithm does not consider any fixed search pattern or any other movement assumption as most of other BM approaches do, a high probability for finding the true minimum (accurate motion vector) is expected. Conducted simulations show that the proposed method achieves the best balance over other fast BM algorithms, in terms of both estimation accuracy and computational cost.Comment: 22 Pages. arXiv admin note: substantial text overlap with arXiv:1405.4721, arXiv:1406.448

pythOPT: A problem-solving environment for optimization methods

Optimization is a process of finding the best solutions to problems based on mathematical models. There are numerous methods for solving optimization problems, and there is no method that is superior for all problems. This study focuses on the Particle Swarm Optimization (PSO) family of methods, which is based on the swarm behaviour of biological organisms. These methods are easily adjustable, scalable, and have been proven successful in solving optimization problems. This study examines the performance of nine optimization methods on four sets of problems. The performance analysis of these methods is based on two performance metrics (the win-draw-loss metric and the performance profiles metric) that are used to analyze experimental data. The data are gathered by using each optimization method in multiple configurations to solve four classes of problems. A software package pythOPT was created. It is a problem-solving environment that is comprised of a library, a framework, and a system for benchmarking optimization methods. pythOPT includes code that prepares experiments, executes computations on a distributed system, stores results in a database, analyzes those results, and visualizes analyses. It also includes a framework for building PSO-based methods and a library of benchmark functions used in one of the presented analyses. Using pythOPT, the performance of these nine methods is compared in relation to three parameters: number of available function evaluations, accuracy of solutions, and communication topology. This experiment demonstrates that two methods (SPSO and GCPSO) are superior in finding solutions for the tested classes of problems. Finally, by using pythOPT we can recreate this study and produce similar ones by changing the parameters of an experiment. We can add new methods and evaluate their performances, and this helps in developing new optimization methods

Autonomous Space Surveillance for Arbitrary Domains

Space is becoming increasingly congested every day and the task of accurately tracking satellites is paramount for the continued safe operation of both manned and unmanned space missions. In addition to new spacecraft launches, satellite break-up events and collisions generate large amounts of orbital debris dramatically increasing the number of orbiting objects with each such event. In order to prevent collisions and protect both life and property in orbit, accurate knowledge of the position of orbiting objects is necessary. Space Domain Awareness (SDA) used interchangeably with Space Situational Awareness (SSA), are the names given to the daunting task of tracking all orbiting objects. In addition to myriad objects in low-earth-orbit (LEO) up to Geostationary (GEO) orbit, there are a growing number of spacecraft in cislunar space expanding the task of cataloguing and tracking space objects to include the whole of the earth-moon system. This research proposes a series of algorithms to be used in autonomous SSA for earth-orbiting and cislunar objects. The algorithms are autonomous in the sense that once a set of raw measurements (images in this case) are input to the algorithms, no human in the loop input is required to produce an orbit estimate. There are two main components to this research, an image processing and satellite detection component, and a dynamics modeling component for three-body relative motion. For the image processing component, resident space objects, (commonly referred to as RSOs) which are satellites or orbiting debris are identified in optical images. Two methods of identifying RSOs in a set of images are presented. The first method autonomously builds a template image to match a constellation of satellites and proceeds to match RSOs across a set of images. The second method utilizes optical flow to use the image velocities of objects to differentiate between stars and RSOs. Once RSOs have been detected, measurements are generated from the detected RSO locations to estimate the orbit of the observed object. The orbit determination component includes multiple methods capable of handling both earth-orbiting and cislunar observations. The methods used include batch-least squares and unscented Kalman filtering for earth-orbiting objects. For cislunar objects, a novel application of a particle swarm optimizer (PSO) is used to estimate the observed satellite orbit. The PSO algorithm ingests a set of measurements and attempts to match a set of virtual particle measurements to the truth measurements. The PSO orbit determination method is tested using both MATLAB and Python implementations. The second main component of this research develops a novel linear dynamics model of relative motion for satellites in cislunar space. A set of novel linear relative equations of motion are developed with a semi-analytical matrix exponential method. The motion models are tested on various cislunar orbit geometries for both the elliptical restricted three-body problem (ER3BP) and the circular restricted three-body problem (CR3BP) through MATLAB simulations. The linear solution method\u27s accuracy is compared to the non-linear equations of relative motion and are seen to hold to meter level accuracy for deputy position for a variety of orbits and time-spans. Two applications of the linearized motion models are then developed. The first application defines a differential corrector to compute closed relative motion trajectories in a relative three-body frame. The second application uses the exponential matrix solution for the linearized equations of relative motion to develop a method of initial relative orbit determination (IROD) for the CR3BP

On the use of chaotic dynamics for mobile network design and analysis: towards a trace data generator

With the constant increase of the number of autonomous vehicles and connected objects, tools to understand and reproduce their mobility models are required. We focus on chaotic dynamics and review their applications in the design of mobility models. We also provide a review of the nonlinear tools used to characterize mobility models, as it can be found in the literature. Finally, we propose a method to generate traces for a given scenario involving moving people, using tools from the nonlinear analysis domain usually dedicated to topological analysis of chaotic attractors.Comment: 22 pages, 7 figures, to be published in Journal of Difference Equations and Application

Monte Carlo Method with Heuristic Adjustment for Irregularly Shaped Food Product Volume Measurement

Volume measurement plays an important role in the production and processing of food products. Various methods have been proposed to measure the volume of food products with irregular shapes based on 3D reconstruction. However, 3D reconstruction comes with a high-priced computational cost. Furthermore, some of the volume measurement methods based on 3D reconstruction have a low accuracy. Another method for measuring volume of objects uses Monte Carlo method. Monte Carlo method performs volume measurements using random points. Monte Carlo method only requires information regarding whether random points fall inside or outside an object and does not require a 3D reconstruction. This paper proposes volume measurement using a computer vision system for irregularly shaped food products without 3D reconstruction based on Monte Carlo method with heuristic adjustment. Five images of food product were captured using five cameras and processed to produce binary images. Monte Carlo integration with heuristic adjustment was performed to measure the volume based on the information extracted from binary images. The experimental results show that the proposed method provided high accuracy and precision compared to the water displacement method. In addition, the proposed method is more accurate and faster than the space carving method

Soft computing applied to optimization, computer vision and medicine

Artificial intelligence has permeated almost every area of life in modern society, and its significance continues to grow. As a result, in recent years, Soft Computing has emerged as a powerful set of methodologies that propose innovative and robust solutions to a variety of complex problems. Soft Computing methods, because of their broad range of application, have the potential to significantly improve human living conditions. The motivation for the present research emerged from this background and possibility. This research aims to accomplish two main objectives: On the one hand, it endeavors to bridge the gap between Soft Computing techniques and their application to intricate problems. On the other hand, it explores the hypothetical benefits of Soft Computing methodologies as novel effective tools for such problems. This thesis synthesizes the results of extensive research on Soft Computing methods and their applications to optimization, Computer Vision, and medicine. This work is composed of several individual projects, which employ classical and new optimization algorithms. The manuscript presented here intends to provide an overview of the different aspects of Soft Computing methods in order to enable the reader to reach a global understanding of the field. Therefore, this document is assembled as a monograph that summarizes the outcomes of these projects across 12 chapters. The chapters are structured so that they can be read independently. The key focus of this work is the application and design of Soft Computing approaches for solving problems in the following: Block Matching, Pattern Detection, Thresholding, Corner Detection, Template Matching, Circle Detection, Color Segmentation, Leukocyte Detection, and Breast Thermogram Analysis. One of the outcomes presented in this thesis involves the development of two evolutionary approaches for global optimization. These were tested over complex benchmark datasets and showed promising results, thus opening the debate for future applications. Moreover, the applications for Computer Vision and medicine presented in this work have highlighted the utility of different Soft Computing methodologies in the solution of problems in such subjects. A milestone in this area is the translation of the Computer Vision and medical issues into optimization problems. Additionally, this work also strives to provide tools for combating public health issues by expanding the concepts to automated detection and diagnosis aid for pathologies such as Leukemia and breast cancer. The application of Soft Computing techniques in this field has attracted great interest worldwide due to the exponential growth of these diseases. Lastly, the use of Fuzzy Logic, Artificial Neural Networks, and Expert Systems in many everyday domestic appliances, such as washing machines, cookers, and refrigerators is now a reality. Many other industrial and commercial applications of Soft Computing have also been integrated into everyday use, and this is expected to increase within the next decade. Therefore, the research conducted here contributes an important piece for expanding these developments. The applications presented in this work are intended to serve as technological tools that can then be used in the development of new devices