Fingerprint Project
Fingerprint Project
CHAPTER -I INTRODUCTION
General Statement of the Problem
Background
Importance of problem
Each biometric has its strengths and weaknesses and the choice
typically depends on the application. No single biometric is expected to
effectively meet the requirements of all the applications. The match
between a biometric and an application is determined depending upon
the characteristics of the application and the properties of the
biometric.
Information
.
Figure 3: Image Preprocessing and Feature Extraction
Histogram Equalization
Extraction and Modification of Ridge Direction
Dynamic Threshold
Ridgeline Thinning
Histogram Equalization
The method used for the unwanted part of the image is made lighter so as to
emphasize the desired parts. Then the accumulation of histogram from 0 to I is given by
Dynamic Threshold
Mapping of all data points having gray level more than the average gray level in a
16 x 16 sampling square 255 ( white ) and all other to zero (black). The result of it shown
in fig.
Ridgeline Thinning
Features Extraction
CHAPTER –V DELIVERABLES
• MATLAB source code.
Function to enhance the fingerprint and then applying basic global
threshold image is differentiated from background
% G1 = 0 ;
% G2 = 0 ;
% img = thresholding(img1,T) ;
% u1 = G1/C1 ;
% u2 = G2/C2 ;
% T = (u1+u2)/2 ;
% C1 = 0 ;
% C2 = 0 ;
% G1 = 0 ;
% G2 = 0 ;
% img1 = thresholding(img,T) ;
% u1 = G1/C1 ;
% u2 = G2/C2 ;
% T = (u1+u2)/2 ;
% C1 = 0 ;
% C2 = 0 ;
% G1 = 0 ;
% G2 = 0 ;
image = thresholding(img1,T) ;
image
end
end
imag2
% X1 X2 X3
% X8 M X4
% X7 X6 X5
%
% M is the center pixel and it will decide whether the center pixel
% is a ridge ending ( M = 2 ), or it is ridge bifurcation ( M = 6 )
%
% Syntax:
% fingerprint = imread('fingerprint.tif');
% Features_extract(fingerprint);
function Features_extract(image)
K = M -2 ;
L = N -2 ;
x=1;
y=1;
m=1;
n=1;
global C
for i=2: K
for j=2: L
C=0;
if ( C == 2 )
ending1(x) = i ;
ending2(y)= j ;
x=x+1;
y=y+1;
end
if ( C == 6 )
bif1(m) = i ;
bif2(n) = j ;
m=m+1;
n=n+1;
end
end
end
save minut
GANTT CHART
Stages
REFERENCES
Journal Articles
3) Aho, A. V., Hopcroft, J.E., and Ullman J. D., 1983, “Data Structures and
Algorithms”, Addison-Wesley Publishing Company, Massachusetts, USA
Books
Web Pages
1) http://www.atvs.diac.upm.es/publicaciones/publicaciones_en.htm
2) http://fpserver.cse.cuhk.edu.hk/paper/fingertechpart2.pdf
3) http://www.research.ibm.com/ecvg/pubs/sharat-minver.pdf
4) http://www.cordis.lu/infosec/src/stud5fr.htm