Particle swarm optimization based on information diffusion and clonal selection

A novel PSO algorithm called InformPSO is introduced in this paper. The premature convergence problem is a deficiency of PSOs. First, we analyze the causes of premature convergence for conventional PSO. Second, the principles of information diffusion and clonal selection are incorporated into the proposed PSO algorithm to achieve a better diversity and break away from local optima. Finally, when compared with several other PSO variants, it yields better performance on optimization of unimodal and multimodal benchmark functions

On the Predictive Uncertainty of a Distributed Hydrologic Model

We use models to simulate the real world mainly for prediction purposes. However, since any model is a simplification of reality, there remains a great deal of uncertainty even after the calibration of model parameters. The model’s identifiability of realistic model parameters becomes questionable when the watershed of interest is small, and its time of concentration is shorter than the computational time step of the model. To improve the discovery of more reliable and more realistic sets of model parameters instead of mathematical solutions, a new algorithm is needed. This algorithm should be able to identify mathematically inferior but more robust solutions as well as to take samples uniformly from high-dimensional search spaces for the purpose of uncertainty analysis. Various watershed configurations were considered to test the Soil and Water Assessment Tool (SWAT) model’s identifiability of the realistic spatial distribution of land use, soil type, and precipitation data. The spatial variability in small watersheds did not significantly affect the hydrographs at the watershed outlet, and the SWAT model was not able to identify more realistic sets of spatial data. A new populationbased heuristic called the Isolated Speciation-based Particle Swarm Optimization (ISPSO) was developed to enhance the explorability and the uniformity of samples in high-dimensional problems. The algorithm was tested on seven mathematical functions and outperformed other similar algorithms in terms of computational cost, consistency, and scalability. One of the test functions was the Griewank function, whose number of minima is not well defined although the function serves as the basis for evaluating multi-modal optimization algorithms. Numerical and analytical methods were proposed to count the exact number of minima of the Griewank function within a hyperrectangle. The ISPSO algorithm was applied to the SWAT model to evaluate the performance consistency of optimal solutions and perform uncertainty analysis in the Generalized Likelihood Uncertainty Estimation (GLUE) framework without assuming a statistical structure of modeling errors. The algorithm successfully found hundreds of acceptable sets of model parameters, which were used to estimate their prediction limits. The uncertainty bounds of this approach were comparable to those of the typical GLUE approach

Metaheuristic Optimization Techniques for Articulated Human Tracking

Four adaptive metaheuristic optimization algorithms are proposed and demonstrated: Adaptive Parameter Particle Swarm Optimization (AP-PSO), Modified Artificial Bat (MAB), Differential Mutated Artificial Immune System (DM-AIS) and hybrid Particle Swarm Accelerated Artificial Immune System (PSO-AIS). The algorithms adapt their search parameters on the basis of the fitness of obtained solutions such that a good fitness value favors local search, while a poor fitness value favors global search. This efficient feedback of the solution quality, imparts excellent global and local search characteristic to the proposed algorithms. The algorithms are tested on the challenging Articulated Human Tracking (AHT) problem whose objective is to infer human pose, expressed in terms of joint angles, from a continuous video stream. The Particle Filter (PF) algorithms, widely applied in generative model based AHT, suffer from the 'curse of dimensionality' and 'degeneracy' challenges. The four proposed algorithms show stable performance throughout the course of numerical experiments. DM-AIS performs best among the proposed algorithms followed in order by PSO-AIS, AP-PSO, and MBA in terms of Most Appropriate Pose (MAP) tracking error. The MAP tracking error of the proposed algorithms is compared with four heuristic approaches: generic PF, Annealed Particle Filter (APF), Partitioned Sampled Annealed Particle Filter (PSAPF) and Hierarchical Particle Swarm Optimization (HPSO). They are found to outperform generic PF with a confidence level of 95%, PSAPF and HPSO with a confidence level of 85%. While DM-AIS and PSO-AIS outperform APF with a confidence level of 80%. Further, it is noted that the proposed algorithms outperform PSAPF and HPSO using a significantly lower number of function evaluations, 2500 versus 7200. The proposed algorithms demonstrate reduced particle requirements, hence improving computational efficiency and helping to alleviate the 'curse of dimensionality'. The adaptive nature of the algorithms is found to guide the whole swarm towards the optimal solution by sharing information and exploring a wider solution space which resolves the 'degeneracy' challenge. Furthermore, the decentralized structure of the algorithms renders them insensitive to accumulation of error and allows them to recover from catastrophic failures due to loss of image data, sudden change in motion pattern or discrete instances of algorithmic failure. The performance enhancements demonstrated by the proposed algorithms, attributed to their balanced local and global search capabilities, makes real-time AHT applications feasible. Finally, the utility of the proposed algorithms in low-dimensional system identification problems as well as high-dimensional AHT problems demonstrates their applicability in various problem domains