A hybrid approach of gravitational search algorithm and ant miner plus for fingerprint recognition

Mahesh Kumar and Devender Kumar ()
Additional contact information
Mahesh Kumar: Department of Computer Science and Engineering, Baba Mastnath University, Asthal Bohar, Sector-29, Rohtak, India
Devender Kumar: Department of Computer Science and Engineering, Baba Mastnath University, Asthal Bohar, Sector-29, Rohtak, India

International Journal of Modern Physics C (IJMPC), 2023, vol. 34, issue 04, 1-16

Abstract: The gravitational search algorithm (GSA) is an eminent heuristic algorithm inspired by the laws of gravity and motion. It possesses an independent physical model in which the mass agents are guided by gravitational force to quickly achieve the convergence. Although the GSA is proven to be efficient for science and engineering problems, the mass agents can be trapped in premature convergence due to the heaviness of masses in the later iterations. The occurrence of premature convergence impedes the agents’ further exploration of the search space for a better solution. Here, the ant miner plus (AMP) variant of the ant colony optimization (ACO) algorithm is utilized to avoid the trapping of agents in local optima. The AMP algorithm extends the exploration ability of the GSA algorithm by using the attributes of pheromone updating rules generated by best ants and a problem-dependent heuristic function. The AMP variant adheres to the attributes of the ACO algorithm and is also a decision-making variant which determines the problem solution more efficiently by constructing a directed acyclic graph, considering class-specific heuristic values, and including weight parameters for the pheromone and heuristic values. In this research, this hybridization of GSA and AMP (GSAMP) algorithms is presented, and it is utilized for the decision-making application of fingerprint recognition. Here, fingerprint recognition is conducted for complete as well as latent fingerprints, which are poor quality partial fingerprints, mostly acquired from crime scenes by law enforcement agencies. The experiments are performed for the complete fingerprint dataset of FVC2004 and the latent fingerprint dataset of NIST SD27, using the proposed GSAMP approach and the individual algorithms of Ant Miner (AM) and AMP. The experimental evaluation indicates the superiority of the proposed approach compared to other methods.

Keywords: Gravitational search algorithm; ant colony optimization; ant miner; ant miner plus; heuristic algorithm; fingerprint recognition; latent fingerprints (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183123500444
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:34:y:2023:i:04:n:s0129183123500444

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183123500444

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().