scholarly journals A hyprid technique for human footprint recognition

2019 ◽  
Vol 9 (5) ◽  
pp. 4060 ◽  
Author(s):  
Yahya Ismail Ibrahim ◽  
Israa Mohammed Alhamdani
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Biometric System ◽  
Ant Colony Optimization Algorithm ◽  
Scientific Application ◽  
Set Size ◽  
Human Footprint ◽  
Intelligent Technique ◽  
Artificial Intelligent Technique

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.

scholarly journals Swarm intelligent hyperdization biometric

2020 ◽  
Vol 18 (1) ◽  
pp. 385
Author(s):  
Israa Mohammed Alhamdani ◽  
Yahya Ismail Ibrahim
Keyword(s):  
Chain Code ◽  
Set Size ◽  
Human Footprint ◽  
Intelligent Technique ◽  
Visual Database ◽  
Bird Swarm Algorithm ◽  
Artificial Intelligent Technique ◽  
Optimal Feature ◽  
Combined Technique

At the last decade the importance of biometrics has been clearly configured due to its important in the daily life that starts from civil applications with security and recently terrorizing. A Footprint recognition is one of the effective personal identifications based on biometric measures. The aim of this research is to design a proper and reliable left human footprint biometrics system addressed (LFBS). In addition, to create a human footprint database which it is very helpful for numerous use such as during authentication. The existing footprint databases were very rare and limited. This paper presents a sturdy combined technique which merges between Image Processing with Artificial Intelligent technique via Bird Swarm Optimization Algorithm (BSA) to recognize the human footprint. The use of (BSA) enhance the performance and the quality of the results in the biometric system through feature selection. The selected features was treated as the optimal feature set in standings of feature set size. The visual database was constructed by capturing life RGB footprint images from nine person with ten images per person. The visual dataset images was pre-processed by successive operations. Chain Code is used with footprint binary image, then statistical features which represent the footprint features. These features were extracted from each image and stored in Excel file to be entered into the Bird Swarm Algorithm. The experimental results show that the proposed algorithm estimates, excellent results with a smaller feature set in comparison with other algorithms. Experimental outcomes show that our algorithm achieves well-organized and accurate result about 100% accuracy in relation with other papers on the same field.

Parallel Ant Colony Optimization Algorithm Based on Multiplicate Pheromon Declining

2012 ◽  
Vol 433-440 ◽  
pp. 3577-3583
Author(s):  
Yan Zhang ◽  
Hao Wang ◽  
Yong Hua Zhang ◽  
Yun Chen ◽  
Xu Li
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Computing Power ◽  
Slow Convergence ◽  
The Impact

To overcome the defect of the classical ant colony algorithm’s slow convergence speed, and its vulnerability to local optimization, the authors propose Parallel Ant Colony Optimization Algorithm Based on Multiplicate Pheromon Declining to solve Traveling Salesman Problem according to the characteristics of natural ant colony multi-group and pheromone updating features of ant colony algorithm, combined with OpenMP parallel programming idea. The new algorithm combines three different pheromone updating methods to make a new declining pheromone updating method. It effectively reduces the impact of pheromone on the non-optimal path in the ants parade loop to subsequent ants and improves the parade quality of subsequent ants. It makes full use of multi-core CPU's computing power and improves the efficiency significantly. The new algorithm is compared with ACO through experiments. The results show that the new algorithm has faster convergence rate and better ability of global optimization than ACO.

A Novel Approach of Load Balancing and Task Scheduling Using Ant Colony Optimization Algorithm

2019 ◽  
Vol 7 (2) ◽  
pp. 9-20 ◽  
Author(s):  
Selvakumar A. ◽  
Gunasekaran G.
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Ant Colony Optimization ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Novel Approach ◽  
Productive Asset ◽  
Reduce Energy Consumption ◽  
Set Up

Cloud computing is a model for conveying data innovation benefits in which assets are recovered from the web through online devices and applications, instead of an immediate association with a server. Clients can set up and boot the required assets and they need to pay just for the required assets. Subsequently, later on giving a component to a productive asset administration and the task will be a vital target of Cloud computing. Load balancing is one of the major concerns in cloud computing, and the main purpose of it is to satisfy the requirements of users by distributing the load evenly among all servers in the cloud to maximize the utilization of resources, to increase throughput, provide good response time and to reduce energy consumption. To optimize resource allocation and ensure the quality of service, this article proposes a novel approach for load-balancing based on the enhanced ant colony optimization.

Computing Resource Allocation for Enterprise Information Management Based on Cloud Platform Ant Colony Optimization Algorithm

2013 ◽  
Vol 791-793 ◽  
pp. 1232-1237 ◽  
Author(s):  
Ying Liang ◽  
Qiu Peng Rui ◽  
Jie Xu
Keyword(s):  
Cloud Computing ◽  
Response Time ◽  
Ant Colony Optimization ◽  
Information Management ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Enterprise Information ◽  
Cloud Computing Environment ◽  
Set Up

The paper allocated a method to optimize the management pattern under cloud computing environment according to the current situation of Enterprise Information Management. The method used Ant Colony Optimization (ACO) as basic foundation to satisfy the property of Cloud Computing. CloudSim was also set up as the simulation to imitate the cloud environment and the test of computing. The algorithm prognosticated the capability of the potential available resource node when being allocated and analyzed the usage of bandwidth, the quality of networks and the response time. This algorithm met the needs of limitation of resource with better performance and has shorter response time.

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Population Decline ◽  
Innovation System ◽  
Federal District ◽  
Original Model ◽  
Ant Colony ◽  
Industrial Agglomeration ◽  
Ant Colony Optimization Algorithm

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.

Penerapan Algoritma ACO untuk Penjadwalan Kuliah Pengganti pada Perguruan Tinggi (Studi Kasus: Program Studi Informatika, Universitas Multimedia Nusantara)

2019 ◽  
Vol 9 (2) ◽  
pp. 79-85
Author(s):  
Indah Noviasari ◽  
Andre Rusli ◽  
Seng Hansun
Keyword(s):  
Ant Colony Optimization ◽  
Educational Institution ◽  
Ease Of Use ◽  
Perceived Usefulness ◽  
Ant Colony ◽  
Scheduling Problems ◽  
Perceived Ease Of Use ◽  
Ant Colony Optimization Algorithm ◽  
Scheduling System ◽  
Course Scheduling

Students and scheduling are both essential parts in a higher educational institution. However, after schedules are arranged and students has agreed to them, there are some occasions that can occur beyond the control of the university or lecturer which require the courses to be cancelled and arranged for replacement course schedules. At Universitas Multimedia Nusantara, an agreement between lecturers and students manually every time to establish a replacement course. The agreement consists of a replacement date and time that will be registered to the division of BAAK UMN which then enter the new schedule to the system. In this study, Ant Colony Optimization algorithm is implemented for scheduling replacement courses to make it easier and less time consuming. The Ant Colony Optimization (ACO) algorithm is chosen because it is proven to be effective when implemented to many scheduling problems. Result shows that ACO could enhance the scheduling system in Universitas Multimedia Nusantara, which specifically tested on the Department of Informatics replacement course scheduling system. Furthermore, the newly built system has also been tested by several lecturers of Informatics UMN with a good level of perceived usefulness and perceived ease of use. Keywords—scheduling system, replacement course, Universitas Multimedia Nusantara, Ant Colony Optimization

Sign in / Sign up

Export Citation Format

Share Document