2009
DOI: 10.1109/tifs.2009.2032012
|View full text |Cite
|
Sign up to set email alerts
|

Parallelizing Iris Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(18 citation statements)
references
References 20 publications
0
18
0
Order By: Relevance
“…The Fig .3 shows the Sclera identical process. Blood barge patterns are unique to each individual, as are other biometric dope such as the patterns of the iris [23]. Unlike some biometric schemes, blood barge templates are almost impossible to counterfeit because they are located beneath the sheath's exterior.…”
Section: Proposed Work and Simulation Resultsmentioning
confidence: 99%
“…The Fig .3 shows the Sclera identical process. Blood barge patterns are unique to each individual, as are other biometric dope such as the patterns of the iris [23]. Unlike some biometric schemes, blood barge templates are almost impossible to counterfeit because they are located beneath the sheath's exterior.…”
Section: Proposed Work and Simulation Resultsmentioning
confidence: 99%
“…Let ij I be the set of information source values and let 1 ij µ and 2 ij µ be the two membership functions that look at ij I differently. Then the divergent information is expressed as (29) We can use this measure in quantifying the quality of evaluation of any information source.…”
Section: Divergencementioning
confidence: 99%
“…Practical implementation of iris based biometrics requires faster and more efficient data storage and a possible solution to this problem is suggested using FPGA [29]. Spoofing of iris from iris codes is a sure bet and to circumvent this, counterfeiting measures are developed in [30].…”
Section: Literature Surveymentioning
confidence: 99%
“…Calculate the bin where pixel j belongs to, m2 j ; 11: Store m1 j and m2 j into lookup table T ; 12: end for 13: end for 14: for Each direction i in 512 various directions do 15: for Each pixel j in ith direction do 16: Get the weight vote of j from table T , named w i;j ; 17: Get the vote of cell, ce i C D w i;j ; 18: end for 19 Human detection algorithms usually consist of four steps, which are gradient and direction computation, histograms generations, normalization, and classifying. However, this manner does not efficiently support the direct hardware implementations because many complex calculations are within the process.…”
Section: Algorithmsmentioning
confidence: 99%