文件列表:

Daugman (0, 2017-07-30)
Daugman\ContourIntegralCircular.m (915, 2017-07-30)
Daugman\EER_duagman.m (791, 2017-07-30)
Daugman\SearchInnerBoundary.m (3166, 2017-07-30)
Daugman\SearchOuterBoundary.m (1539, 2017-07-30)
Daugman\addcircle.m (1472, 2017-07-30)
Daugman\adjgamma.m (844, 2017-07-30)
Daugman\canny.m (2219, 2017-07-30)
Daugman\circlecoords.m (1622, 2017-07-30)
Daugman\createiristemplate.m (2857, 2017-07-30)
Daugman\encode.m (1928, 2017-07-30)
Daugman\findline.m (1038, 2017-07-30)
Daugman\gaborconvolve.m (2557, 2017-07-30)
Daugman\gethammingdistance.m (1661, 2017-07-30)
Daugman\hysthresh.m (3304, 2017-07-30)
Daugman\linecoords.m (812, 2017-07-30)
Daugman\loadimages.m (1464, 2017-07-30)
Daugman\matching.m (1351, 2017-07-30)
Daugman\nonmaxsup.m (3683, 2017-07-30)
Daugman\normaliseiris.m (4910, 2017-07-30)
Daugman\read_all_images.m (1488, 2017-07-30)
Daugman\segmentiris.m (3465, 2017-07-30)
Daugman\shiftbits.m (1495, 2017-07-30)
Hough (0, 2017-07-30)
Hough\EER_hough.m (795, 2017-07-30)
Hough\addcircle.m (1472, 2017-07-30)
Hough\adjgamma.m (844, 2017-07-30)
Hough\canny.m (2219, 2017-07-30)
Hough\circlecoords.m (1622, 2017-07-30)
Hough\createiristemplate.m (2857, 2017-07-30)
Hough\encode.m (1928, 2017-07-30)
Hough\findcircle.m (2246, 2017-07-30)
Hough\findline.m (1038, 2017-07-30)
Hough\gaborconvolve.m (2557, 2017-07-30)
Hough\gethammingdistance.m (1661, 2017-07-30)
Hough\houghcircle.m (917, 2017-07-30)
Hough\hysthresh.m (3304, 2017-07-30)
Hough\linecoords.m (812, 2017-07-30)
Hough\loadimages.m (1488, 2017-07-30)
... ...

iris ==== Iris Recognition Algorithms Comparison between Daugman algorithm and Hough transform on Matlab. ###DESCRIPTION: Iris is one of the most important biometric approaches that can perform high confidence recognition. Iris contains rich and random Information. Most of commercial iris recognition systems are using the Daugman algorithm. The algorithms are using in this case from open sourse with modification, if you want to use the source code, please check the LICENSE. ###Daugman algorithm:  where I(x,y) is the eye image, r is the radius to searches over the image (x,y), G(r) is a Gaussian smoothing function. The algorithm starts to search from the pupil, in order to detect the changing of maximum pixel values (partial derivative).   ###Hough transform:  The Hough transform is a feature extraction technique used in image analysis, computer vision, and digital image processing. where (xi, yi) are central coordinates, and r is the radius. Generally, and eye would be modeled by two circles, pupil and limbus (iris region), and two parabolas, upper and lower eyelids Starts to detect the eyelids form the horizontal direction, then detects the pupil and iris boundary by the vertical direction.   ###NORMALIZATION AND FEATURE ENCODING: From circles to oblong block By using the 1D Log-Gabor filter. In order to extract 9600 bits iris code, the upper and lower eyelids will be processed as a 9600 bits mask during the encoding.    ###MATCHING: Hamming distance (HD):  where Q and R are subjects to compare, which contains 20x480=9600 template bits and 20x480=9600 mask bits, respectively, in order to calculate by using XOR and AND boolean operators. ###Results: CASIA Iris Image Database(version 1.0) (http://biometrics.idealtest.org/dbDetailForUser.do?id=1): 756 iris images form 108 different subjects. High quality of images by using NIR camera. Resolution of 320*280. Totally, 756*755/2=285390 pairs of comparison for each algorithm, 2268 for intra-class comparison and 283 122 for inter-class comparison. ###EER: Daugman algorithm: 0.0157 Hough transform: 0.0500 How to run the program ==== 1. Download the CASIA Iris Image Database(version 1.0) from (http://biometrics.idealtest.org/dbDetailForUser.do?id=1) (Signup requested) 2. Read all images and extract features using the read_all_images.m and createiristemplate.m. (Templates created) 3. The templates of each subject will be saved into template.mat and mask.m after you creating the templates. matching.m then calculating the Hamming distance (HD) for the same subject(intra-class) and different subjects (innner-class) and saving the results into HD_diff.mat(different subjucts) and HD_same.m (same subject), from them you can calculate the EER which is the final performance for each algorithm by using EER_*.m

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：