1 / 22

SECURED AUTHENTICATION USING FINGER PRINT BIOMETRY -- IT Acumens. COM

SECURED AUTHENTICATION USING FINGER PRINT BIOMETRY -- IT Acumens. COM. STANDALONE PC. USER. CHECK AUTHEN- TICATION. AUTHEN- TICATED. REJECTED. SYSTEM -DESIGN. FINGERPRINT DATABASE (BMP FILES). VC++ APPLICATION. MODIFIED SYSTEM DESIGN. MODULES.

liza
Télécharger la présentation

SECURED AUTHENTICATION USING FINGER PRINT BIOMETRY -- IT Acumens. COM

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SECURED AUTHENTICATIONUSINGFINGER PRINT BIOMETRY-- IT Acumens. COM

  2. STANDALONE PC USER CHECK AUTHEN- TICATION AUTHEN- TICATED REJECTED SYSTEM -DESIGN

  3. FINGERPRINT DATABASE (BMP FILES) VC++ APPLICATION MODIFIED SYSTEM DESIGN

  4. MODULES Our project has been modularized in to three phases 1.Image Diagnostics Binarization 2. Minutiae Extraction 3. Enrollment & Authentication

  5. BMPFILE BINARI-SED MINUTIAE EXTRACTION DIAGNOSTICS AND BINARISATION 256 GRAY SCALE MINUTIAE TEMPLATE TEMPLATE DATABASE DATA ARRAY AUTHENTICATION & ENROLLMENT BLOCK DIAGRAM

  6. DIAGNOSTICS AND BINARISATION This is the first module in the project. The input to this module will be a 256 gray scale BMP file. The output of this module will be a binarised data of the image.

  7. BITMAP FILE TYPES • Bitmap files are of two types: • DDB-Device Dependent Bitmap • DIB-Device Independent Bitmap BITMAPS DDB DIB

  8. DIB - CHARACTERS • Bitmaps that contain a color table are device-independent • Acolor table describes how pixel values correspond to RGB color values. • A DIB contains color and dimension information: • The color and dimension information is stored in a BITMAPINFO structure.

  9. FILEHEADER FILEINFORMATION HEADER RGBQUAD DATA STORED IN INVERTED FASHION BMP STRUCTURE

  10. HANDLING DIB IN VC++ • The following structures are maintained in any DIB file • BITMAPHEADER • BITMAPINFO • 1) BITMAPINFOHEADER • 2) RGBQUAD • DATA ARRAY

  11. BITMAPFILEHEADER • The BITMAPFILEHEADER structure contains the following members, • 1. bfType • 2. bfSize • 3. bfReserved1 • 4. bfReserved2 • 5. bfOffBits

  12. BITMAPINFOHEADER 1. BISIZE 2. BIWIDTH 3. BIHEIGHT 4. BIBITCOUNT 5. biPlanes 6. biCompression 7. biSizeImage 8. biXPelsPerMeter 9. biYPelsPerMeter 10 .biClrUsed 11. biClrImportant

  13. START A C OPEN FILE MOVE TO DATA F END OF DATA B F PADDING B READ A PIXEL A T CLOSE FILE T COMPUTE NO OF PADS PAD BIT T C STOP F SET PAD FLAG STORE READ PIXEL IN ARRAY A C DATA EXTRACTION

  14. BINARISATION START READ PIXEL C T VAL > 127 SET PIXEL AS 0 F D SET PIXEL AS 1 F END OF PIXEL C D T STOP

  15. MODULE-TWO Extracting the minutiae points from the fingerprint image is the second module The input will be the binarised data pixels obtained from the first module. The output of this module will be the image template containing the minutiae details.

  16. Minutiae Points valley bifurcation ridge bifurcation

  17. Minutiae Extraction • Input: binarised image as a 256*256 array from the previous module • Output: set of minutiae points with ( x , y ) and their relative displacement

  18. Algorithm Step1: Consider the inner 236*236 array Step 2: Scan the image from top to bottom ,left to right order by following only ridges Step 3: Find the 0-1 transition , calculate the width of the ridge by noting the 1-0 transition Step 4: Move to the next row and follow the same ridge Note the width

  19. 11100000111111000000000111100000111 11000001111111000000001111010000111 10000011111100000100001111000001111 10000011111000001110001111000001111 00000011110000111110011111000001111 00001111110001111000011110000001111 00011111000001111000011110000111111 00011111000111110000011100000111111 00011111000111110000011100000111111 00111000001111100001111000001111110 00111000001111100001111000001111110 11111100001111000001110000001111000

  20. Step 5: If the width >=width in previous row there may be a top to bottom bifurcation .Call the bifurcation function to check if it is a minutiae point else If the width =< width in previous row there may be a bottom to top ridge bifurcation.Call the bifurcation function to check if it is a minutiae point • Step 6: continue with the next row and repeat this for all the ridges in the given image or until 90 minutiae points have been obtained.

  21. Template Storage • If a point is determined as a minutiae point then the straight line distance from the top and left is determined and is copied into the displacement array • count is incremented • Finally after getting a maximum of 90 minutiae points the template is stored.

  22. Application • New user entry: This can be done by only an administrator.The template is extracted using the above algorithm and it is stored into the template database stored as a file • Authentication: Template is extracted and checked if any 43 minutiae points are same if so he is authenticated

More Related