department of automation engineering national formosa university attendance administrative system...

Department of Automation Engineering National Formosa University

Attendance Administrative System Using Dactyloscopy

Kuang-Chyi Lee, Gavin Thomson and Yong-Jia Huang

Outline

Introduction Attendance administrative system Identification of fingerprints Discussions Conclusions

Department of Automation Engineering, National Formosa University

Introduction

Biometry, safety, uniqueness. Attendance administrative system, database

consistency.



1. Basic staff data

2. Check the recording of fingerprint data

3. Collecting check in/out times

4. Check out

Attendance administrative system

Flowchart

Record the check In/ out time Into the

database

Log-out system

Check in/ outID verification

Add the new user

Get the user name

Check the recording fingerprint data and log in window system

Fingerprint reader

Registration?

Y

N


Functions

Check fingerprint Personnel ID verification Login/logout Add/Delete staff Modify personnel database Report list Administrator



DatabaseStaff S. Serial

NumberName Individual

dataP. Serial Number

D. Serial Number

Position P. Serial Number

Position Salary

D. Serial Number:

D. Serial Number

Department Name Department Location

Attendance Form:

S. Serial Number

Inscroll Date Inscroll Time

Check in Time

Fingerprint image

Fingerprint registration

Registered finger

Staff name

Select mode


Fingerprint identification


Check mode

Message

New staff


ID verification


Login system


Login

Exit

Logout

Data modification

Records of attendance


Administrator


Identification of fingerprints

fingerprint scanner



Low-pass filter, Binarize, Thinning.


Fingerprint classification (Henry [1])

Plain Arch type Tented Arch type Left-loop type Right-loop type

Central Pocket whorl type

Plain Whorl type Double Loop Whorl type accidental

do not belong any one


Fingerprint tracing

Spherical algorithm

Ci+1 is node for the first round window and ridge line


Ten ridge patterns (Chang [6])

Plain ridge: Left End belong to left area, right End belong to right area, |H|< fifty pixel..

Simplified R-D Model

style rulePlainTentedRightLeftCentralPlainDouble

p+aα ＊ t+a+

P+α+tr+a+

α ＊ s+ α+ (c + w)+ α+a+

p+α+ b +α+ a+

α ＊ s+α+dd+α+α+

p+α+tl+a+p+α+tl+a+p+α+tl+a+p+α+tl+a+p+α+tl+a+p+α+tl+a+p+α+tl+a+p+α+tl+a+


Fingerprint test


Discussions

The FRR for the fingerprint system is 1.45%,and the FAR is 0.8%.

If we add person date, it can cancellation FRR and reduce FAR.

In this system, average time to identification is about 1.6 seconds.


Conclusions The paper develop high exactly, low error,

operation fast relation database by logic database.

Finish a fingerprint and person ID to do attendance administrative system, it can make user to use easily.

Finish the fingerprint classification by the R-D Mode after catch the fingerprint.


Thanks for your attention


Database normalization In first normalization can reduce the value for

recover roll. And have three reasons are sample, easy, and can use an operation to success.

In second normalization can reduce the depend on

each other for data, and use division table can make it the same main key.

In third normalization can reduce the depend on each other for data, it can make the data structure for delete or insert.

Return

Low-pass filter

It can use mask to process the value in one time.

We can give the middle value for the average value in 3x3 space mask.

1/9 1/9 1/91/9 1/9 1/91/9 1/9 1/9

Binarize

If f(x,y)>m, then f(x,y) is 255 If f(x,y)< m, then f(x,y) is 0

（ m is threshold value, f is input vision ）

Thinning

Tinning algorithm can be division into two steps, and we will implement it until no delete point.

Step1 delete condition ： (a) 2 N(P1) 6≦ ≦(b) S(P1)=1(c1) P2 ·P4 ·P6 = 0(d1) P4 ·P6 ·P8 = 0

Step2 delete condition ：(a) 2 N(P1) 6≦ ≦(b) S(P1)=1(c2) P2 ·P4 ·P8 = 0(d2) P2 ·P6 ·P8 = 0

Return

Smile ridge and Triangle ridge

Smile ridge: Left Ending belong left area, Right Ending belong right area, and H<-HT.

Triangle: Left Ending belong left area, Right Ending belong right area, the max is > .

Tmax

( define 50°)T

Left-loop ridge and Right-loop ridge

Right-Loop : all ending in right area.

Left-Loop: Left Ending and Right Ending in left area.

Explain : main point are two point

Circle ridge and Balloon ridge

Circle ridge: Left End =Right End

Balloon ridge: Left end or Right End have node with ridge line.

Whorl ridge:

Whorl ridge and Double-loop ridge

M

i i1 >360°

M

i i1Double-Loop ridge : <360°

Return

Ridge line trace

Finish trace result

spherical algorithm

Ci+1 is node for the first round window and ridge line

Fragment point and Ending point

Fragment elimination by additional tracing steps

Ending point

Return

department of automation engineering national formosa university attendance administrative system...

Documents