Minietua Algorithm

What is Minietua Matching Algorithm?

It is algorithm to extracting minietua from the

Fingerprints and match them to show if both fingerprint belong to same person or not.

Fingerprint Description
The lines that flow in various pattern across

Fingerprint are called ridges and spaces between ridges are called valley. These ridges are compared between one fingerprint and other when matching. Comparison of all ridges is a lengthy task. Hence instead of ridges minietua are matched.

Ridge

What actually is minietua?

Minutiae are the special points of interest in a

Fingerprint such as ridge ending or ridge bifurcation.

Ridge Ending

Ridge Bifurcation/Intersection

Types of minietua
Ridge Ending.

Ridge Intersection.
Ridge Bifurcation. Lake

Steps in Minietua Matching

Step 1 : Binarization. Step 2 : Smoothening. Step 3 : Thinning (Skeletonization). Step 4 : Extract Minutiae. Step 5 : Match Minutiae from Database.

Binarization
Binarization is the process to convert a gray scale image

into a Binary Image to improve the contrast between ridges and valleys in the fingerprint image. How to Binarize image.

Calculate Gray level of each pixel by taking mean of RGB values at those pixel. Calculate the Global mean by taking mean of all above calculated values. Calculate the local mean of small regions of the image. If the local mean is greater than the global mean then local grey mean is calculated by formula
localmean = 0.75*global mean + 0.25*localmean

Now each pixel is compared with local mean if its value is greater than local mean then it is set to binary one else it is set to binary zero.

Original Fingerprint Image

Binary Fingerprint Image

Smoothen Image
Image is smoothened by processing the image with

the filter. Here, Mean Filter is used with properties filter ={0.0625 0.1250 0.0625 0.1250 0.2500 0.1250 0.0625 0.1250 0.0625 } Every pixel is calculated for weight of its neighbour by adding corresponding value of binary pixel. If weight is greater than 0.5 than change the pixel value to binary one.

Binary Fingerprint

Smoothen Fingerprint

Skeletonization (Thinning)

Sekletonization is done through Zhang-

Suen algorithm on binary image from last step. This algorithm is made by two sub iterations. In the first one, a pixel I(i,j) is deleted if the following condition are satisfied:

It has at least two black neighbors and not more than six. At least one of I(i,j+1), I(i-1,j), and I(i,j-1) are white. At least one of I(i-1,j), I(i+1,j), and I(i,j-1) are white.

 In the second Iteration.

It has at least two black neighbors and not more than six. At least one of I(i-1,j), I(i,j+1), and I(i+1,j) are white. At least one of I(i,j+1), I(i+1,j), and I(i,j-1) are white.

Minietua Extraction
To extract minietua we check for neighbor

of each pixel For end points

 For Bifurcation points

Minietua Matching
The various minietua from last step to the

minietua stored in the database are matched and checked for the matched percentage if more than 70% of these minietua are matched than fingerprint is matched.