K-Means Graph Database Clustering and Matching for Fingerprint Recognition

Journals Menu

Follow SCIRP

ISSN Print: 2160-5912
ISSN Online: 2160-5920
www.scirp.org/journal/iim
E-mail: iim@scirp.org

Citations

"K-Means Graph Database Clustering and Matching for Fingerprint Recognition"
written by Vaishali Pawar, Mukesh Zaveri,
published by Intelligent Information Management, Vol.7 No.4, 2015

has been cited by the following article(s):

[1]	Inked fingerprint recognition system: A review
	AIP Conference Proceedings, 2024

[2]	Метрика для сравнения графов с упорядоченными вершинами на основе максимального общего подграфа
	2021

[3]	Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices
	International Conference Dedicated to the Memory of …, 2020

[4]	Inexact graph matching: application to 2D and 3D Pattern Recognition
	Thèse, 2016

[1]	Smart Trends in Computing and Communications Lecture Notes in Networks and Systems, 2026 DOI:10.1007/978-981-96-7502-9_5

[2]	High-Performance CNN-Based Facial Recognition on the Yale Face Database 2025 Seventh International Conference on Computational Intelligence andCommunication Technologies (CCICT), 2025 DOI:10.1109/CCICT65753.2025.00067

[3]	Inked fingerprint recognition system: A review THE FOURTH AL-NOOR INTERNATIONAL CONFERENCE FOR SCIENCE AND TECHNOLOGY (4NICST2022), 2024 DOI:10.1063/5.0202450

[4]	Renormalized density matrix downfolding: A rigorous framework in learning emergent models from ab initio many-body calculations Physical Review B, 2024 DOI:10.1103/PhysRevB.110.195103

Follow SCIRP