Optimal multi-objective discrete decision making using a multidirectional modified Physarum solver

This paper will address a bio-inspired algorithm able to incrementally grow decision graphs in multiple directions for discrete multi-objective optimization. The algorithm takes inspiration from the slime mould Physarum Polycephalum, an amoeboid organism that in its plasmodium state extends and optimizes a net of veins looking for food. The algorithm is here used to solve multi-objective Traveling Salesman and Vehicle Routing Problems selected as representative examples of multi-objective discrete decision making problems. Simulations on selected test case showed that building decision sequences in two directions and adding a matching ability (multidirectional approach) is an advantageous choice if compared with the choice of building decision sequences in only one direction (unidirectional approach). The ability to evaluate decisions from multiple directions enhances the performance of the solver in the construction and selection of optimal decision sequences

Contour matching using ant colony optimization and curve evolution

Shape retrieval is a very important topic in computer vision. Image retrieval consists of selecting images that fulfil specific criteria from a collection of images. This thesis concentrates on contour-based image retrieval, in which we only explore the information located on the shape contour. There are many different kinds of shape retrieval methods. Most of the research in this field has till now concentrated on matching methods and how to achieve a meaningful correspondence. The matching process consist of finding correspondence between the points located on the designed contours. However, the huge number of incorporated points in the correspondence makes the matching process more complex. Furthermore, this scheme does not support computation of the correspondence intuitively without considering noise effect and distortions. Hence, heuristics methods are convoked to find acceptable solution. Moreover, some researches focus on improving polygonal modelling methods of a contour in such a way that the resulted contour is a good approximation of the original contour, which can be used to reduce the number of incorporated points in the matching. In this thesis, a novel approach for Ant Colony Optimization (ACO) contour matching that can be used to find an acceptable matching between contour shapes is developed. A polygonal evolution method proposed previously is selected to simplify the extracted contour. The main reason behind selecting this method is due to the use of a stopping criterion which must be predetermined. The match process is formulated as a Quadratic Assignment Problem (QAP) and resolved by using ACO. An approximated similarity is computed using original shape context descriptor and the Euclidean metric. The experimental results justify that the proposed approach is invariant to noise and distortions, and it is more robust to noise and distortion compared to the previously introduced Dominant Point (DP) Approach. This work serves as the fundamental study for assessing the Bender Test to diagnose dyslexic and non-dyslexic symptom in children

FARS: Fuzzy Ant based Recommender System for Web Users

Recommender systems are useful tools which provide an adaptive web environment for web users. Nowadays, having a user friendly website is a big challenge in e-commerce technology. In this paper, applying the benefits of both collaborative and content based filtering techniques is proposed by presenting a fuzzy recommender system based on collaborative behavior of ants (FARS). FARS works in two phases: modeling and recommendation. First, user’s behaviors are modeled offline and the results are used in second phase for online recommendation. Fuzzy techniques provide the possibility of capturing uncertainty among user interests and ant based algorithms provides us with optimal solutions. The performance of FARS is evaluated using log files of “Information and Communication Technology Center” of Isfahan municipality in Iran and compared with ant based recommender system (ARS). The results shown are promising and proved that integrating fuzzy Ant approach provides us with more functional and robust recommendations

A hyprid technique for human footprint recognition

Biometrics has concerned a great care recently due to its important in the life that starts from civil applications to security and recently terrorism. A Footprint recognition is one of the personal identifications based on biometric measurements.  The aim of this research is to design a proper and reliable biometric system for human footprint recognition named (FRBS) that stands for Footprint Recognition Biometric System. In addition, to construct a human footprint database which it is very helpful for various use in scientific application e.g. for authentication. There exist many biometrics databases for other identity but very rare for footprint. As well as the existing one are very limited. This paper presents a robust hyprid techniques which merges between Image Processing with Artificial Intelligent technique via Ant Colony Optimization (ACO) to recognize human footprint.  (ACO) plays the essential role that rise the performance and the quality of the results in the biometric system via feature selection. The set of the selected features was treated as exploratory information, and selects the optimum feature set in standings of feature set size. Life RGB footprint images from nine persons with ten images per person constructed from life visual dataset. At first, the visual dataset was pre-processed operations. Each resultant image detects footprint that is cropped to portions represented by three blocks. The first block is for fingers, the second block refers to the center of the foot and the last one determines the heel. Then features were extracted from each image and stored in Excel file to be entered to Ant Colony Optimization Algorithm. The experimental outcomes of the system show that the proposed algorithm evaluates optimal results with smaller feature set comparing with other algorithms. Experimental outcomes show that our algorithm obtains an efficient and accurate result about 100% accuracy in comparison with other researches on the same field

Applications of Improved Ant Colony Optimization Clustering Algorithm in Image Segmentation

When expressing the data feature extraction of the interesting objectives, image segmentation is to transform the data set of the features of the original image into more tight and general data set. This paper explores the image segmentation technology based on ant colony optimization clustering algorithm and proposes an improved ant colony clustering algorithm (ACCA). It improves and analyzes the computational formula of the similarity function and improves parameter selection and setting by setting ant clustering rules. Through this algorithm, it can not only accelerate the clustering speed, but it can also have a better clustering partitioning result. The experimental result shows that the method of this paper is better than the original OTSU image segmentation method in accuracy, rapidity and stability

Combinatorial optimization and metaheuristics

Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods

A Hand-Based Biometric Verification System Using Ant Colony Optimization

This paper presents a novel personal authentication system using hand-based biometrics, which utilizes internal (beneath the skin) structure of veins on the dorsal part of the hand and the outer shape of the hand. The hand-vein and the hand-shape images can be simultaneously acquired by using infrared thermal and digital camera respectively. A claimed identity is authenticated by integrating these two traits based on the score-level fusion in which four fusion rules are used for the integration. Before their fusion, each modality is evaluated individually in terms of error rates and weights are assigned according to their performance. In order to achieve an adaptive security in the proposed bimodal system, an optimal selection of fusion parameters is required. Hence, Ant Colony Optimization (ACO) is employed in the bimodal system to select the weights and also one out of the four fusion rules optimally for the adaptive fusion of the two modalities to meet the user defined security levels. The databases of hand-veins and the hand-shapes consisting of 150 users are acquired using the peg-free imaging setup. The experimental results show genuine acceptance rate (GAR) of 98% at false acceptance rate (FAR) of 0.001% and the system has the potential for any online personal authentication based application.