Fingerprint Authenication Using Graph Theory

In this paper we have tried to implement the idea is to classify fingerprints through identifying the core of the fingerprint. The fingerprint is taken as an input via an image. The image is then transformed for necessary preprocessing. Then we make a graph with ridges’ ending and bifurcations all around the Centre, acting as vertices. Then we compare the graph constructed using the connection of vertices. The idea is to calculate distance between neighboring vertices for each vertex. Our aim is to increase the efficiency of fingerprint identification in different orientation.