Amir Nakib

Image histogram thresholding based on multiobjective optimization

The thresholding process based on the optimization of one criterion only does not work well for a lot of images. In many cases, even when equipped with the optimal value of the threshold of its single criterion, the thresholding program does not produce a satisfactory result. In this paper, we propose to use the multiobjective optimization approach to find the optimal thresholds of three criteria: the within-class criterion, the entropy and the overall probability of error criterion. In addition we develop a new variant of simulated annealing adapted to continuous problems to solve the Gaussian curve-fitting problem. Some examples of test images are presented to compare our segmentation method, based on the multiobjective optimization approach, with that of four competing methods: Otsu method, Gaussian curve fitting-based method, valley-emphasis-based method and two-dimensional Tsallis entropy-based method. From the viewpoints of visualization, object size and image contrast, our experimental results show that the thresholding method based on multiobjective optimization performs better than the competing methods.

Image thresholding based on Pareto multiobjective optimization

A new image thresholding method based on multiobjective optimization following the Pareto approach is presented. This method allows to optimize several segmentation criteria simultaneously, in order to improve the quality of the segmentation. To obtain the Pareto front and then the optimal Pareto solution, we adapted the evolutionary algorithm NSGA-II (Deb et al., 2002). The final solution or Pareto solution corresponds to that allowing a compromise between the different segmentation criteria, without favouring any one. The proposed method was evaluated on various types of images. The obtained results show the robustness of the method, and its non dependence towards the kind of the image to be segmented.

Non-supervised image segmentation based on multiobjective optimization

The segmentation process based on the optimization of one criterion only does not work well for a lot of images. In many cases, even when equipped with the optimal value of the threshold of its single criterion, the segmentation program does not produce a satisfactory result. In this paper, we propose to use the multiobjective optimization approach to find the optimal thresholds of two criteria: the within-class criterion and the overall probability of error criterion. In addition we develop a new variant of Simulated Annealing adapted to continuous problems to solve the histogram Gaussian curve fitting problem. Six examples of test images are presented to compare the efficiency of our segmentation method, called Combination of Segmentation Objectives (CSO), based on the multiobjective optimization approach, with that of two classical competing methods: Otsu method and Gaussian curve fitting method. From the viewpoints of visualization, object size and image contrast, our experimental results show that the segmentation method based on multiobjective optimization performs better than the Otsu method and the method based on Gaussian curve fitting.

An improved biogeography based optimization approach for segmentation of human head CT-scan images employing fuzzy entropy

The present paper proposes the development of a three-level thresholding based image segmentation technique for real images obtained from CT scanning of a human head. The proposed method utilizes maximization of fuzzy entropy to determine the optimal thresholds. The optimization problem is solved by employing a very recently proposed population-based optimization technique, called biogeography based optimization (BBO) technique. In this work we have proposed some improvements over the basic BBO technique to implement nonlinear variation of immigration rate and emigration rate with number of species in a habitat. The proposed improved BBO based algorithm and the basic BBO algorithm are implemented for segmentation of fifteen real CT image slices. The results show that the proposed improved BBO variants could perform better than the basic BBO technique as well as genetic algorithm (GA) and particle swarm optimization (PSO) based segmentation of the same images using the principle of maximization of fuzzy entropy.

An in vitro study of silk stent morphology

IntroductionMorphology of the Silk stent (Balt, Montmorency, France) after deployment is not fully understood, especially in tortuous vessels. An in vitro study was conducted to study morphology and flow-diverting parameters of this stent.MethodsTwo sets of different-sized and curved polytetrafluoroethylene tubes were studied. To simulate the aneurysm neck, a small hole was created in a tube. A stent was placed in each of the different tubes. Angiographic computerized tomography and macroscopic photography were then obtained. The images were analyzed to calculate a Percentage of Area Coverage (PAC).ResultsGood stent conformability was observed. The PAC was 21% in the straight model with matched stent and vessel diameter. In the straight model with an oversized stent, the PAC was increased. In the curved models, dynamic wire repositioning occurred. The repositioning was affected by the size of the stent and the angle of the vessel curve. Compared to the straight model, this increased the PAC in two instances: on the convexity (oversized stent), and on the concavity (matched stent and vessel diameter). The PAC did not significantly change at the sides of the curve.ConclusionsBy design, the wires of the silk stent move relative to each other. In a curved model, the PAC is different at the convexity, concavity, and lateral walls. The stent diameter affects the PAC. These results are clinically relevant because it is desirable to maximize and minimize the PAC across the aneurysm neck and branch vessel orifice, respectively.

Fractional differentiation and non-Pareto multiobjective optimization for image thresholding

Various techniques have previously been proposed for single-stage thresholding of images to separate objects from the background. Although these global or local thresholding techniques have proven effective on particular types of images, none of them is able to produce consistently good results on a wide range of existing images. Here, a new image histogram thresholding method, called TDFD, based on digital fractional differentiation is presented for gray-level image thresholding. The proposed method exploits the properties of the digital fractional differentiation and is based on the assumption that the pixel appearance probabilities in the image are related. To select the best fractional differentiation order that corresponds to the best threshold, a new algorithm based on non-Pareto multiobjective optimization is presented. A new geometric regularity criterion is also proposed to select the best thresholded image. In order to illustrate the efficiency of our method, a comparison was performed with five competing methods: the Otsu method, the Kapur method, EM algorithm based method, valley emphasis method, and two-dimensional Tsallis entropy based method. With respect to the mode of visualization, object size and image contrast, the experimental results show that the segmentation method based on fractional differentiation is more robust than the other methods.

A New Multiagent Algorithm for Dynamic Continuous Optimization

Many real-world problems are dynamic and require an optimization algorithm that is able to continuously track a changing optimum over time. In this paper, a new multiagent algorithm is proposed to solve dynamic problems. This algorithm is based on multiple trajectory searches and saving the optima found to use them when a change is detected in the environment. The proposed algorithm is analyzed using the Moving Peaks Benchmark, and its performances are compared to competing dynamic optimization algorithms on several instances of this benchmark. The obtained results show the efficiency of the proposed algorithm, even in multimodal environments.

Metaheuristics for Dynamic Optimization

This book is an updated effort in summarizing the trending topics and new hot research lines in solving dynamic problems using metaheuristics. An analysis of the present state in solving complex problems quickly draws a clear picture: problems that change in time, having noise and uncertainties in their definition are becoming very important. The tools to face these problems are still to be built, since existing techniques are either slow or inefficient in tracking the many global optima that those problems are presenting to the solver technique. Thus, this book is devoted to include several of the most important advances in solving dynamic problems. Metaheuristics are the more popular tools to this end, and then we can find in the book how to best use genetic algorithms, particle swarm, ant colonies, immune systems, variable neighborhood search, and many other bioinspired techniques. Also, neural network solutions are considered in this book. Both, theory and practice have been addressed in the chapters of the book. Mathematical background and methodological tools in solving this new class of problems and applications are included. From the applications point of view, not just academic benchmarks are dealt with, but also real world applications in logistics and bioinformatics are discussed here. The book then covers theory and practice, as well as discrete versus continuous dynamic optimization, in the aim of creating a fresh and comprehensive volume. This book is targeted to either beginners and experienced practitioners in dynamic optimization, since we took care of devising the chapters in a way that a wide audience could profit from its contents. We hope to offer a single source for up-to-date information in dynamic optimization, an inspiring and attractive new research domain that appeared in these last years and is here to stay.

Indoor localization method based on RTT and AOA using coordinates clustering

This paper presents a new hybrid indoor localization method using a coordinate clustering technique. This method exploits two parameters, round-trip time (RTT) and angle of arrival (AOA). The advantage of using RTT measurement is to avoid time synchronization between base stations while the coordinate clustering technique helps restrict the localization process by reducing the number of observations at each coordinate level. On the other hand, no prior mitigation technique is applied if an error occurs in a multipath environment as a result of Non Line Of Sight (NLOS). Based on the results of several experiments, indoor location estimation has been proved to be more accurate in two dimensional (2D) as well as in three dimensional (3D) simulated environments.

A multiple local search algorithm for continuous dynamic optimization

Many real-world optimization problems are dynamic (time dependent) and require an algorithm that is able to track continuously a changing optimum over time. In this paper, we propose a new algorithm for dynamic continuous optimization. The proposed algorithm is based on several coordinated local searches and on the archiving of the optima found by these local searches. This archive is used when the environment changes. The performance of the algorithm is analyzed on the Moving Peaks Benchmark and the Generalized Dynamic Benchmark Generator. Then, a comparison of its performance to the performance of competing dynamic optimization algorithms available in the literature is done. The obtained results show the efficiency of the proposed algorithm.