An Iris Recognition System Based on Angular Radial Partitioning and Statistical Texture Analysis with Sum & Difference Histogram
|
|
- Darcy Lynch
- 5 years ago
- Views:
Transcription
1 An Irs Recognton System Based on Angular Radal Parttonng and Statstcal Texture Analyss wth Sum & Dfference Hstogram Abbas Memş Department of Computer Engneerng Yıldız Techncal Unversty İstanbul, Turkey Songül Albayrak Department of Computer Engneerng Yıldız Techncal Unversty İstanbul, Turkey Elena Battn Sönmez Department of Computer Engneerng İstanbul Blg Unversty İstanbul, Turkey Abstract Irs based dentfcaton systems are consdered among the most promsng recognton systems due to the nner characterstcs of the rs, such as unqueness, stablty and tme nvarance. Ths paper proposes a new texture based rs recognton system based on Angular Radal Parttonng (ARP) and Sum & Dfference Hstogram (SDH). After the rs segmentaton step, ARP s used to dvde the rs s texture nto sectors, SDH allows for the producton of probablty vectors, whch are then used to extract statstcal features. Fnally, classfcaton s performed wth the K-Nearest Neghbour algorthm. Expermental results on the Ubrs and Upol databases testfy the superor performance of the proposed approach, whch can handle the presence of eyelds and eyelashes, as well as partally occluded rses and out of focus mages. In all experments the accuracy of the our system s around 97% also when the tranng set s made up of only two pctures per class, and the correspondng low percentage of FAR suggests that the proposed approach s a good prototype for bometrc recognton systems run n dentfcaton mode. Keywords Irs recognton, Angular Radal Parttonng (ARP), texture analyss, Sum & Dfference Hstogram (SDH). I. INTRODUCTION Recent call for better securty together wth the rapd progress n electronc and Internet use, have brought bometrcs based personal dentfcaton systems nto focus. Bometrcs s the scence to dentfy a person by hs/her nner characterstcs, whch nclude (but are not lmted to) a person s fngerprnt, palm prnt, face, rs, voce, gat or sgnature. Bometrcs based systems are consder more relable than the tradtonal ones, based on dentfcaton cards, personal numbers and passwords, because nner attrbutes cannot be lost, forgotten or shared. The human rs s the annular and colourful part of the eye between the black pupl and the whte sclera. The rs pattern contans many dstnctve features such as pgment spots, freckles, strpes, furrows, coronas etc., whch are located randomly at gestaton tme. Together wth ths unque aspect, the rs has the advantages () to be an nternal and well protected organ of the eye, (2) to be a planar obect, nsenstve to llumnaton effects, and (3) to be tme nvarant. However, current rs-based recognton systems are severely lmted by low robustness, accuracy and speed of the algorthms when dealng wth poor qualty mages, whch have been acqured n presence of moton, partal cooperaton and dstance from the camera. In ths paper we propose a new texture-based rs recognton system, whch as the advantage to be robust to a large varety of dsturbance elements, such as partal occluson of the rs, presence of eyelashes on the rs s texture, poor focus of the mage, and presence of reflecton of the camera. Moreover, we detaled our experments so as to make t reproducble and to allow for comparson wth other rs recognton systems. The frst rs-based recognton system was proposed by Daugman, [] [2] [3], who segmented the rs regon wth an ntegro-dfferental operator and encoded the rs feature by 2D Wavelets demodulaton, whch resulted n 2048 bts of phase nformaton. The percentage of msmatched bts s calculated wth an XOR operator and the Hammng dstance gves the dfference between any par of rs codes. Wldes system [4] generated rs code usng a Laplacan pyramd wth four dfferent resoluton levels; resultng features were down-sampled wth Fsher s lnear dscrmnant [5] and compared va normalzed correlaton. Boles and Bonashash [6] extracted the rs features from the zero-crossng representaton of a concentrc crcle of an rs mage usng one-dmensonal wavelet transform at varous resoluton levels; classfcaton s performed usng two dssmlarty functons. Ma et al. [7] decomposed the rs texture nto a set of one-dmensonal (D) ntensty sgnals; the obtaned rs features are downsampled wth Fsher lnear dscrmnant [5] and classfcaton s based on cosne smlarty. Bowyer et al. [8] presented a comprehensve survey on rs bometrcs, whch summarzes the state of art up to In 2009, Chen and Chu [9] extracted the rs feature usng a Sobel operator and -D wavelet transform and made classfcaton wth a mxture of probablstc neural network (PNN) and partcle swarm optmzaton (PSO). In 20, Sba et al. [0] performed rs recognton wth neural networks, whle Plla et al. [] used random proecton and sparse representaton. At current tme, rs based recognton systems are stll consdered as one of the most promsng bometrc dentfcaton technque, and there s bg research effort to ncrease robustness, accuracy and speed of these algorthms n case of problematc pctures. Among the others, S et al. [2] proposed () a new eyelashes detecton algorthm, (2) the use of a 2-D flter for feature extracton and (3) a corner based rs dentfcaton method to speed up the :N search n bg rses databases; whle Rahulkar and Holambe [3] presented a shft, scale and rotaton nvarant
2 technque for rs feature extracton. In the proposed rs recognton system () the rs regon s segmented usng a varaton of the Daugman s ntegrodfferental operator, (2) each solated rs pattern s then parttoned nto sectors wth the Angular Radal Parttonng (ARP) method [4], (3) the Sum & Dfference Hstogram (SDH) technque [5] s used to represent every sector wth a couple of fx szed vectors, (4) whch are then converted nto a set of statstcal features. Fnally, (5) classfcaton s performed va the K-Nearest Neghbour method usng the Manhattan dstance. We worked wth the Ubrs and Upol databases, whch are common used databases havng a wde varety of dsturbance elements, such as occluded rses, poor focus of the mages, llumnaton effects, and blurred edges. We compared our results wth the ones of smlar experments run by Celeb [6] and Erblek and Toygar [7]. To summarze, the man contrbuton of ths work are () the ntroducton of a new, promsng, texture-based rs recognton system and (2) the detaled descrpton of the experments, so as to make them reproducble and allow for comparson wth other methods. Secton II descrbes the segmentaton step, whch ncludes the solaton of the rs from the rest of the eye and the subdvson of the rs texture nto segments. Secton III llustrates the feature extracton process, wth the Sum & Dfference Hstograms technque followed by the extracton of statstcal features from texture. Secton IV detals the experments run on the Ubrs and Upol databases and compares our results aganst the ones present n the lterature. Conclusons are drawn n Secton V. A. Irs Segmentaton II. SEGMENTATION The frst step n all rs recognton algorthms s to fnd both the nsde (papllary) and the outsde (lmbus) boundares of the rs. Dfferent methods have been appled such as the Daugman s ntegro-dfferental operator, [], [2], [3], and the Canny s edge detecton wth crcular Hough Transform [8]. Equaton gves the formula of the ntegro-dfferental operator of Daugman: max(r, x 0, y 0 ) G σ(r) I(x, y) r 2πr ds () r,x 0,y 0 where I(x, y) s the nput mage contanng the eye, (x 0, y 0 ) s the centre of a crcular arc ds of radus r, and G σ (r) s a Gaussan smoothng functon. The operator defned n () s a crcular edge detector that must be appled two tmes to detect the papllary and the lmbus boundares, snce they are, generally, not concentrc; that s, t s necessary to search for the three parameters (x 0, y 0, r) of the two crcles separately. The fnal result of these operatons s the solaton of the rs from the rest of the eye. Most of the present rs-recognton algorthms are senstve to the outputs of the rs-segmentaton step, where the dsturbances caused by an naccurate detecton of nner and outer boundares are generally removed by gnorng the borders areas. Among the other, ths problem was faced by () Jang et al. n [9] who proposed a new soluton to detect and localze eyelds; (2) Tan et al. n [20] who focused on effcent and robust segmentaton of rs mages; but, n the recent work of S et al., [2], t s ponted out that stll there s not a feasble soluton for the presence of eyelashes. We appled two dfferent varatons of the Daugman s ntegro-dfferental operator, one for each of the two databases used. On the Ubrs [2] database, we decreased the effect of the presence of eyelds and eyelashes by restrctng the orgnal mage doman and consderng only some angles, (θ, θ 2 ), as llustrated n fgure : Fg.. Arc gradent model used n equaton (). Notce that the two angles, (θ, θ 2 ), can be dfferent from each other and ther values can be changed, at segmentaton step, to detect each pupl and rs boundares; we made automatc segmentaton by usng a sngle value for the Ubrs and another one for the Upol database. The rs segmentaton step n the Ubrs database s partcularly challengng due to the presence of partally occluded rses, as shown n fgure 2: Fg. 2. Partally occluded rs n the Ubrs database. That s, the Ubrs database stores eyes where the eyeld covers most of the rs; obvously, n such a case, the rs segmentaton step fals and the dentfcaton process ends n msclassfcaton. In our experments we dd not choose the mages to work wth, and, therefore, we used also these partally (totally) occluded rses, whch, obvously, contrbuted to the error rate. That s, when all mages of the Ubrs database are used, the mnmum error rate must be set to the number of close eyes over the total number of mages. The partcularty of the Upol [22] database s that the eye s photographed through a black hole, whch results n a black crcle outsde the sclera. To segment the Upol database we used the varaton of equaton () proposed by Hebashy, [23]: whle searchng for the lmbus by ncreasng the radus r, the detected outer crcle s the frst one havng an ntegro-dfferental value
3 bggest that the threshold. Fgure 3 shows some rses of the Upol database: the st row stores the orgnal pctures, the 2nd row zooms on the correspondng problematc areas. Moreover, whle all rses have the black frame outsde the sclera, some cases are more challengng because of () the presence of a whte crcle nsde the pupl (due to the reflecton of the camera) and/or (2) blurred boundares. Fg. 5. Angular Radal Parttonng(ARP) wth M radal parttons and N angular parttons. Very often the papllary and lmbus crcles are not concentrc, that s the pupl centre s dfferent from the rs one. ARP uses the pupl crcle centre coordnates to make segmentaton; f rs coordnates were used, parttons could slde brngng to worse classfcaton results. Fg. 3. st row: challengng rses n the Upol database, 2nd row: zoom on the correspondng problematc areas. To summarze, we pont out that the segmentaton of Upol mages was more challengng than the one of Ubrs database manly due to the crcular black mask around the captured rs mage. Fgure 4 shows segmented rs mages from the Ubrs and the Upol databases: The proposed system does not use frst and last radal parttons, because they could contan the data from the pupl s texture or the one form the sclera; ths expedent reduces the total complexty of the system and t has also the advantage to lmt the msclassfcaton effect, due to the presence of eyelashes and eyelds around the upper/lower lmbus s areas. As a result, the total number of acqured segment s (M 2) N. Fgure 6 shows the results of ARP segmentaton on Ubrs and Upol databases; the pcture has been produced by workng wth the rs mage I(ρ, θ) and ncreasng the values of ρ and θ so as to cover all rs; the outer and nner sectors wll not be consdered. Fg. 4. Segmented rs sample from the Ubrs (2 pctures on the left) and the Upol (2 eyes on the rght) databases. B. Angular Radal Parttonng The Angular Radal Parttonng (ARP) method [4] s a common used technque for edge detecton; the man obectve of ARP s to re-wrte the orgnal mage nto a new structure, whch must be s nvarant to scale and rotaton, whle beng capable of supportng measurement of smlarty between mages. In [6] Celeb used ARP for texture based rs recognton systems. We followed hs example and we used ARP to partton the segmented rs regon nto a number of sectors. More n detals:. The rs texture s converted from Cartesan to polar coordnate axes; that s Irs(x, y) becomes I(ρ, θ), and we adopted the conventon to ndcate wth I(ρ, θ) also the greylevel of the pxel n poston (ρ, θ); 2. The radus of the rs, R, s dvded nto M radal parttons and the crcle angle, θ = 360, s parttoned nto N angular sub-angles, whch resulted n a M N sectors. Fgure 5 llustrates ths concept n case of θ = 80 angle. After ARP segmentaton, the rs mage s dvded nto a set of sectors, {sector(k, )} for all k = 0,..., M and = 0,..., N. In equaton 2: (k+)r (+)2π M N Irs = {sector(k, )} = X X θ= 2π ρ= kr N M I(ρ, θ) (2) Fg. 6. Results of the Angular Radal Parttonng on Ubrs (a) and Upol (b) mage samples. III. F EATURE E XTRACTION A. Sum & Dfference Hstograms (SDH) The method used for texture analyss s the Sum and Dfference Hstogram (SDH) algorthm ntroduced by Unser n [5] and used for (marble) texture analyss by Alaardn et al. [24]. SDH s an alternatve to the Grey-level Co-occurrence Matrces (GLCM) method [25]; t has the bg advantage of decreasng both memory storage and computatonal tme whle keepng smlar performance. Representng a texture of a greyscale mage wth SDH technque requres the calculaton of the sum and dfference vectors, wth the correspondng normalzed sum and dfference hstograms. Let us consder a K L b-bt grey-level pcture havng NG = 2b quantzed grey-levels, e.g. n case of b = 8 NG = 256, and the range (R) of ntensty greylevel values Rgreylevel = [0,..., NG ]; fnally, let us defne as yk,l the grey-level of the pxel n poston (k, l), for k =,..., K and l =,..., L. Wth SDH, out of ts 8 neghbours, for every pxel, we are nterested only n the four pxels stuated n non-opposte drectons, that
4 s D = {(, ), (, 0), (, ), (0, )}. Fgure 7 shows the 8-Neghborhood of a texture pxel and names the four neghbour pxels used by the Sum and Dfference Hstogram (SDH): {V, V 2, V 3, V 4 }; adoptng the same conventon as before, the poston of the pxel gves also ts greylevel values; that s, V s the name of the top-left pxel of y k,l, the centre pxel ( ), and t s also ts greylevel value. Fg Neghborhood of a texture pxel and the four neghbourhood drectons used by SDH algorthm. Stll consderng the K L b-bt grey-level pcture, we calculate the sum and the dfference vectors usng equaton (3) and (4) by movng the centre pxel, y k,l, startng from the bottom-left corner of the mage and gnorng the top row and the most rght column of the pcture, that s, for all l =,..., L and k =,..., K : sum k,l = y k,l + (V + V 2 + V 3 + V 4 )/4 (3) dff k,l = y k,l (V + V 2 + V 3 + V 4 )/4 (4) In words, the sum (dfference) vector stores the sum (mnus) of the greylevel of pxel (k, l) wth the average greylevels of the fours neghbours of y k,l. The resultng sze of both vectors, sum k,l and dff k,l, s therefore (K ) (L ), and the range of ther ntensty grey-levels s, respectvely, R sum = [0,..., 2 (N G )] and R dff = [ (N G ),..., N G ]. In case of 8-bt pcture, R greylevel = [0,..., 255], the range of the sum vector s R sum = [0,..., 50] and the range of the dfference vector s R dff = [ 255,..., 255]. In ths work, we appled the SDH technque sector wse; that s, for every sector, we calculated the couple (sum k,l, dff k,l ) vector, startng from the smallest values of ρ and θ and ncreasng by, ether pxel or degree, at every step. Notce that for lttle crcle, ρ =, the ncrease of θ = can result n the same pxel n the Cartesan coordnate; when ths happens we ncreased agan the angle θ. That s, because the shape of a sector s not square, we searched for the next centre pxel y k,l and for ts neghbours {V, V 2, V 3, V 4 } usng polar coordnates and ncreasng ether ρ or θ; the resultng pxel s poston s then mapped nto Cartesan coordnate and duplcated pxels are gnored. The sze of both vectors, sum k,l and dff k,l, changes dependng to the sector s sze, but the range of ther ntensty grey-levels s fxed to R sum = [0,..., 2 (N G )] and R dff = [ (N G ),..., N G ]. The hstograms of the sum and the dfference vectors are calculated usng equatons (5) and (6), sector wse: h sum () = Card {(k, l) sector, sum k,l = } for all = 0,..., 2 (N G ) (5) h dff () = Card {(k, l) sector, dff k,l = } for all = N G,..., N G (6) where Card s the total number of pxel havng greylevel value n the consdered sector. Knowng SectP xel = h sum() = h dff (), the total number of pxels n the actual sector, the normalzed sum and dfference hstogram vectors are the correspondng probablty vectors: P sum () = h sum ()/SectP xel (7) P dff () = h dff ()/SectP xel (8) Notce that the sze of all hstograms and probablty vectors s fxed to 2 (N G ); that s, ther dmenson s ndependent to the sectors s sze. When the nput pcture s a colourful one SDH calculates three sum and three dfference vectors, one for each colour channels, and converts them nto three couples of probablty vectors, (P sum (), P dff ()). Interestng to pont out that, the memory requrement of SDH s always better that the one of the GLCM method; that s, n case of RGB mage, GLCM makes texture analyss consderng the 8-Neghbours of the centre pxel, y k,l, by buldng and processng 3 matrces of sze N G N G. For example, n case of a 8-bt RGB mage, the memory requrement of SDH s (N G ) = 3060 elements (3 for the palettes, R,G,B; 2 for the sum and dfference vectors; 2 (N G ) s the fx sze of every probablty vector), whle GLCM requres 3 N G N G = elements. B. Statstcal Features from Texture Seven statstcal features are calculated out of the two SDH vectors of every ARP sector, namely: mean, varance, energy, correlaton, entropy, contrast and homogenety features. Table I gves ther formulas. TABLE I. Parameter Mean Varance Energy Correlaton Entropy Contrast Homogenety FORMULAS TO CALCULATE THE STATISTICAL PARAMETERS Formulas 2 P s () = µ 2 ( ( 2µ) 2 P s () + 2 P d ()) P s () 2 P d () 2 2 ( ( 2µ) 2 P s () 2 P d ()) P s () log P s () P d () log P d () 2 P d () + P 2 d () Interestng to notce that ARP sectors wth dfferent radal dstance from the centre have a varable number of pxels; out of every sector the SDH algorthm calculates two fx sze vectors, (P sum, P dff ), whch are then converted nto seven features. In other words, sectors of dfferent szes contrbute wth fx sze feature vectors. The length of the extracted feature vectors depends to the type of the processed mage: rangng from (M 2) N 7 n case of greyscale pcture to (M 2) N 7 3 for RGB mages. In the specfc case of M = 6 and N = 8, wth
5 a 24-bts colour mage, the resultng feature vector has sze (6 2) = 52. As ARP partton counts were decreased, feature vector length became shorter. IV. EXPERIMENTS AND RESULTS We evaluated the performance of the proposed texturebased rs recognton system on two dfferent databases; we chose the Ubrs and the Upol databases snce they are both challengng databases and have dfferent dsturbance elements; that s, whle n the Ubrs database the man ssues are llumnaton and partal occluson, n the Upol database problematc pctures have a whte crcle nsde the pupl, due to reflecton of the camera, and/or blurred lmbus contour. The Ubrs [2] database ncludes 877 mages captured from 24 people n two sessons usng a Nkon E5700 model camera; pctures capture n frst sesson have less nose comparng wth the ones of the second sesson. Images have resoluton of pxels and are ether 24-bts RGB or greyscales. Ubrs s known as a challengng rs database due to poor focus of the mages and the presence of reflecton and partal occluson of the rs; some statstcs are shown n table II. TABLE II. UBIRIS DATABASE CHARACTERISTICS WITH CLASSIFICATION PARAMETERS [26]. Percantages Good Average Bad Focus % 7.53 % 8.63 % Reflectons % % 4.34 % Vsble Irs % % 5.44 % Out of every subect we selected the frst fve pctures, wth the only excepton of one person who has only four rs mages. That s, we dd not choose good rses nor dscard problematc mages, and we used both greyscale and RGB rses; ths selecton process results n 5 24 = 204 mages. We pre-processed the mages wth the MATLAB lbrary functon mfll to clear the orgnal samples from lght reflectons on rs and pupl regons, as shown n Fgure 8: In all experments we worked n a close envronment, where the nput test sample belongs to one of the tranng subect. To maxmze the amount of tranng and testng data, we made classfcaton usng the k-fold cross valdaton technque: at the frst round, the test set s made up of all frst nstances of every class, whch are classfed usng all remanng samples as tranng mages; the same process s repeated wth the second, thrd,..., and m th nstance. In case of the Upol database, havng 64 subects and 64 2 = 28 classes, n = 28 and m = 3, whle the Ubrs database has n = 24 classes and m = 5 samples per class; t follows that the k-fold cross valdaton technque has k = 3, when workng wth the Upol database, and k = 5, when workng wth the Ubrs database. We run our experments n the dentfcaton mode (oneto-many matchng) and we evaluated the performance of our system usng the Correct Recognton Rate (CRR), whch s the percentage of correct classfed rses out the total number of test sample. We compared classfcaton performances of K- NN. Followng the study of Celeb, [6], we fxed N = 8 and we run dfferent experments rangng M n [6, 8, 0, 2, 20]; classfcaton results are stored n the followng tables: TABLE III. CRR (%) ON UBIRIS GREY IMAGES FOR DIFFERENT VALUES OF M (PARAMETER OF ARP) AND DISTANCES. MxN:ARP Parameters 6x8 8x8 0x8 2x8 20x8 K-NN (Eucldean) K-NN (Manhattan) TABLE IV. CRR (%) ON UBIRIS COLOR IMAGES FOR DIFFERENT VALUES OF M (PARAMETER OF ARP) AND DISTANCES. MxN:ARP Parameters 6x8 8x8 0x8 2x8 20x8 K-NN (Eucldean) K-NN (Manhattan) ,68 TABLE V. CRR (%) ON UPOL GREY IMAGES FOR DIFFERENT VALUES OF M (PARAMETER OF ARP) AND DISTANCES. MxN:ARP Parameters 6x8 8x8 0x8 2x8 20x8 K-NN (Eucldean) K-NN (Manhattan) TABLE VI. CRR (%) ON UPOL COLOR IMAGES FOR DIFFERENT VALUES OF M (PARAMETER OF ARP) AND DISTANCES. Fg. 8. row). Orgnal Ubrs mages (st row) versus pre-processed ones (2nd The Upol [22] rs database stores 28 3 = 384 mages captured from rght and left eyes of 64 people s. Images are 24 bts, have resoluton pxels and were taken wth SONY DXC-950P 3CCD camera. The man challenges of the Upol database are () the black frame surroundng the sclera, due to the partcular process used to take the mages, (2) the presence of a whte crcle nsde the pupl, due to the reflecton of the camera, and (3) a blurred lmbus, the outer crcle of the rs. We worked wth all mages. MxN:ARP Parameters 6x8 8x8 0x8 2x8 20x8 K-NN (Eucldean) K-NN (Manhattan) Results of Tables III-VI show that the best performance s reached wth M = 2 and K-NN usng the Manhattan dstance. Havng n classes, we created a Confuson Matrx, CM, of sze n n, where rows label the actual class and columns the predcted class. The ntal values of CM(, ) = 0, for all =,..., n and =,..., n, and CM(, ) s ncreased by whenever a sample of class s assgned to class ; deally, CM s a dagonal matrx wth all off-dagonal elements equal to 0 and C(, ) s equal to the total number of samples belongng to class. When classfcaton errors occur, C(, )
6 s equal to the number of samples belongng to class and assgned to class,. TABLE VII. PERFORMANCE MEASUREMENTS (%) OF THE PROPOSED TEXTURE BASED IRIS IDENTIFICATION SYSTEM. Database Color Format FAR FRR Ubrs grey color Upol grey color Fg. 9. The Class Confuson Matrx. recognzed; that s, consderng that 5.44% of the rses are not vsble, our average CRR of 96.5% s vrtually equvalent to the best possble performance. The followng equatons defne (9) the False Postve of class, F P ; whch s equal to the sum of off-dagonal elements of column(); (0) the False Acceptance Rate of class, F AR ; () the weght of class, W ; (2) the False Acceptance Rate, FAR; whch s equal to the weghted sum of F AR ; (3) the False Negatve of class, F N ; whch s equal to the sum of off-dagonal elements of row(); (4) the False Reecton Rate of class, F RR ; and (5) the False Reecton Rate; n all equatons Number Sample stands for the number of samples belongng to class : F P = Number of W rong Classfed Sample Assgned to Class (9) F AR = F P (T otal Num. Sample Num. Sample ) (0) Number Sample W = () T otal Number Sample n F AR = F AR W (2) = F N = Number of Sample W rongly Assgned to Class (3) F N F RR = (4) Number Sample n F RR = F RR W (5) = Notce that, n case of the Upol and Ubrs databases, all weghts are equal because all classes have the same number of samples. In the followng table we report the values of FAR and FRR n case of K-NN wth the Manhattan dstance and M N = 2 8 ARP sectors: Interestng to notce that the low value of FAR s due to the very good performance of the proposed system but also to the characterstcs of our experments, havng only one test sample per class and a hgh number of classes. Fgure 0 stores some of the msclassfed rses belongng to the Ubrs database. In ths study, we dd not choose the pctures to work wth, and fgure 0 shows that msclassfcaton occurs for occluded rses, practcally mpossble to be Fg. 0. Msclassfed rses n the Ubrs database. Wth the am to nvestgate on the correlaton between segmentaton and classfcaton steps, we report n table VIII the average segmentaton accuracy on both databases: TABLE VIII. AVERAGE SEGMENTATION ACCURACY ON THE UBIRIS AND UPOL DATABASES. Dataset Accuracy (%) Ubrs 97 Upol 83 Comparng these results wth the CRR of table VII, we may say that, n case of the Ubrs database, the maorty of the error s due to ms-segmentaton; that s, we segmented n a correct way 97% of the eyes, and we classfy n a proper way 96% of them; the % dfference s due to added classfcaton error. On the contrary, n case of the Upol database, only 83% of the mages are segmented n a correct way,.but stll the average CRR s 96%; that s, the sub-sequent classfcaton step can recover for lttle shfts n segmentaton boundary, and ths s due, manly, to the hgh resoluton of the rses. Fgure stores some of the ms-segmented rses belongng to the Upol database, only the last two were ms-classfed: Fg.. Ms-segmented rses n the Upol database. One of the man problems encountered durng ths work was to fnd a benchmark paper storng a clear descrpton of the experments run, so as to be able to reproduce them and compare the resultng performances. We chose the two papers of Celeb [6] and Erblek et al. [7] because we were attracted by ther algorthms and they have a partal descrpton of the experments. That s, lke Celeb and Erblek, we worked wth the Ubrs and Upol databases n dentfcaton mode (one-tomany matchng); unfortunately, n case of the Ubrs database, [6] does not gve any other nformaton, nether the secton of the used mages, whch remans undefned; whle [7] used
7 mages of secton, they selected 80 subects to work wth (but we do not know whch subects), and they manually cropped all rses. Table IX stores a comparson of the results of these three systems: TABLE IX. UBIRIS DATABASE: CRR (%) COMPARISON OF DIFFERENT IRIS BASED RECOGNITION SYSTEMS. Celeb [6] Erblek [7] Proposed Sesson Not known Sesson Sesson CRR In case of [6], not knowng the sesson of the used mages, t s possble to make only a mld comparson on the CRR. On the contrary, comparng the performance of the proposed system wth the one of Erblek et al., we pont out that we reached better results also by selectng the frst fve mages of all subects and by usng automatc segmentaton of the rses. That s, CRR values together wth the random selectons of the mages and the automatc segmentaton of the rses make our system superor to the one of [7]. Experments on the Upol database are too obscured to be compared. V. CONCLUSIONS In the proposed texture based rs recognton system, () we made automatc segmentaton of the rs usng a varaton of the Daugman s ntegro-dfferental operator followed by the ARP technque, whch s nvarant to scale and rotaton; (2) we dd not use the frst and last radal partton, because they could contan eyelds and eyelashes as well as data from the pupl s and sclera s texture; (3) we extracted seven dmensonal feature out of every sector by re-wrtng the sector s texture nto two probablty vectors. Our experments ndcate that ths new system has the advantage to be robust to a wde varety of dsturbance elements, such as partal occluson of the rs, poor focus of the mage, llumnaton effects and blurred contours. Moreover, the low percentage of FAR obtaned n out trals suggests that the proposed approach s a good prototype for bometrc recognton systems run n dentfcaton mode, where securty s a key ssue. Another mportant advantage of ths new approach s the lttle number of samples per class necessary to tran t; that s, whle n the Ubrs database we worked wth 24 classes and we used only 4 tranng samples per class, n the Upol database 2 tranng samples per class are enough to dentfy a person out of 28 classes, 97% of the tme. REFERENCES [] J. Daugman, Hgh confdence vsual recognton of persons by a test of statstcal ndependence, IEEE Transactons on Pattern Analyss and Machne Intellgence, vol. 5, no., pp. 48 6, Nov [2] J. Daugman, The mportance of beng random: statstcal prncples of rs recognton, Pattern Recognton, vol. 36, no. 2, pp , Feb [3] J. Daugman, How rs recognton works, IEEE Transactons on Crcuts and Systems for Vdeo Tech., vol. 4, no., pp. 2 30, Jan [4] R. Wldes, J. Asmuth, G. Green, S. Hsu, R. Kolczynsk, and S. McBrde, A system for automated rs recognton, n Proceedngs of the Second IEEE Workshop on Applcatons of Computer Vson, Sarasota, FL, Dec. 5 7, 994, pp [5] P. Belhumeur, J. Hespanha, and D. Kregman, Egenfaces vs fsherfaces: recognton usng class specfc lnear proecton, IEEE Transactons on Pattern analyss and Machne Intellgence, vol. 9, no. 7, pp , Jul [6] W. Boles and B. Boashash, A human dentfcaton technque usng mage of the rs and wavelet transform, IEEE Transactons on Sgnal Processng, vol. 46, no. 4, pp , Apr [7] L. Ma, T. Tan, Y. Wang, and D. Zhang, Local ntensty varaton analyss for rs recognton, Pattern Recognton, vol. 37, no. 6, pp , Jun [8] K. Bowyer, K. Hollngsworth, and P. Flynn, Image understandng for rs bometrcs: a survey, Computer Vson and Image Understandng, vol. 0, no. 2, pp , May [9] C. Chen and C. Chu, Hgh performance rs recognton based on -d crcular feature extracton and pso pnn classfer, Expert Systems wth Applcatons, vol. 36, no. 7, pp , Sep [0] F. Sba, H. Hosan, R. Naqb, S. Dhanhan, and S. Shehh, Irs recognton usng artfcal neural networks, Expert Systems wth Applcatons, vol. 38, no. 5, pp , May 20. [] J. Plla, V. Patel, R. Chellappa, and N. Ratha, Secure and robust rs recognton usng random proectons and sparse representatons, IEEE Transactons on Pattern Analyss and Machne Intellgence, vol. 33, no. 9, pp , Sep. 20. [2] Y. S, J. Me, and H. Gao, Novel approach to mprove robustness, accuracy and rapdty of rs recognton systems, IEEE Transactons on Industral Informatcs, vol. 8, no., pp. 0 7, Feb [3] A. Rahulkar and R. Holambe, Half-rs feature extracton and recognton usng a new class of borthogonal trplet half-band flter bank and flexble k-out-of n: a post-classfer, IEEE Transactons on Informaton Forenscs and Securty, vol. 7, no., pp , Feb [4] A. Chalachale, A. Mertns, and G. Naghdy, Edge mage descrpton usng angular radal parttonng, IEEE Proceedngs on Vson, Image and Sgnal Processng, vol. 5, no. 2, pp. 93 0, Apr [5] M. Unser, Sum and dfference hstograms for texture classfcaton, IEEE Transactons on Pattern Analyss and Machne Intellgence, vol. 8, no., pp. 8 25, Jan [6] A. Celeb, M. Gullu, and S. Erturk, Low complexty rs recognton usng one-bt transform and angular radal parttonng, n IEEE Sgnal Processng and Communcatons Applcatons Conference (SIU), Antalya, Apr. 2009, pp [7] M. Erblek and O. Toygar, Recognzng partally occluded rses usng sub-pattern-based approaches, n Internatonal Symposum on Computer and Informaton Scences (ISCIS), Guzelyurt, Sep. 2009, pp [8] J. Canny, A computatonal approach to edge detecton, IEEE Transactons on Pattern Analyss and Machne Intellgence, vol. 8, no. 6, pp , Nov [9] Y. Jang, B. Kang, and K. Park, A study on eyeld localzaton consderng mage focus for rs recognton, Pattern Recognton Letters, vol. 29, no., pp , Aug [20] T. Tan, Z. He, and Z. Sun, Effcent and robust segmentaton of nosy rs mages for non-cooperatve rs recognton, Image and Vson Computng, vol. 28, no. 2, pp , Feb [2] H. Proenca and L. Alexandre. Ubrs rs mage database: [22] M. Dobes and L. Machala. Upol rs mage database: [23] M. Hebashy. Poster: Optmzed daugman s algorthm for rs localzaton, full.pdf. [24] J. Alaarn, J. Lus-Delgado, and L. Tomas-Balbrea, Automatc system for qualty-based classfcaton of marble textures, IEEE Transactons on Systems, Man and Cybernetcs-Part C: Applcatons and Revews, vol. 35, no. 4, pp , Nov [25] R. Gonzales and R. Woods, Eds., Dgtal Image Processng. 3th Pearson Int. Edton, [26] Ubrs classfcaton statstcs, [27] C. Burges, A tutoral on support vector machnes for pattern recognton, Data Mnng and Knowledge Dscovery, vol. 2, no. 2, pp. 2 67, 998.
A Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationFeature Extractions for Iris Recognition
Feature Extractons for Irs Recognton Jnwook Go, Jan Jang, Yllbyung Lee, and Chulhee Lee Department of Electrcal and Electronc Engneerng, Yonse Unversty 134 Shnchon-Dong, Seodaemoon-Gu, Seoul, KOREA Emal:
More informationIris recognition algorithm based on point covering of high-dimensional space and neural network
Irs recognton algorthm based on pont coverng of hgh-dmensonal space and neural network Wenmng Cao,, Janhu Hu, Gang Xao, Shoujue Wang The College of Informaton Engneerng, ZheJang Unversty of Technology,
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationEYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS
P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationFace Recognition Based on SVM and 2DPCA
Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty
More informationPalmprint Feature Extraction Using 2-D Gabor Filters
Palmprnt Feature Extracton Usng 2-D Gabor Flters Wa Kn Kong Davd Zhang and Wenxn L Bometrcs Research Centre Department of Computng The Hong Kong Polytechnc Unversty Kowloon Hong Kong Correspondng author:
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationCombination of Color and Local Patterns as a Feature Vector for CBIR
Internatonal Journal of Computer Applcatons (975 8887) Volume 99 No.1, August 214 Combnaton of Color and Local Patterns as a Feature Vector for CBIR L.Koteswara Rao Asst.Professor, Dept of ECE Faculty
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationEfficient Segmentation and Classification of Remote Sensing Image Using Local Self Similarity
ISSN(Onlne): 2320-9801 ISSN (Prnt): 2320-9798 Internatonal Journal of Innovatve Research n Computer and Communcaton Engneerng (An ISO 3297: 2007 Certfed Organzaton) Vol.2, Specal Issue 1, March 2014 Proceedngs
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More informationApplying EM Algorithm for Segmentation of Textured Images
Proceedngs of the World Congress on Engneerng 2007 Vol I Applyng EM Algorthm for Segmentaton of Textured Images Dr. K Revathy, Dept. of Computer Scence, Unversty of Kerala, Inda Roshn V. S., ER&DCI Insttute
More informationA Novel Fingerprint Matching Method Combining Geometric and Texture Features
A Novel ngerprnt Matchng Method Combnng Geometrc and Texture eatures Me Xe, Chengpu Yu and Jn Q Unversty of Electronc Scence and Technology of Chna. Chengdu,P.R.Chna xeme@ee.uestc.edu.cn Post Code:6154
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationNovel Fuzzy logic Based Edge Detection Technique
Novel Fuzzy logc Based Edge Detecton Technque Aborsade, D.O Department of Electroncs Engneerng, adoke Akntola Unversty of Tech., Ogbomoso. Oyo-state. doaborsade@yahoo.com Abstract Ths paper s based on
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationNovel Pattern-based Fingerprint Recognition Technique Using 2D Wavelet Decomposition
Mathematcal Methods for Informaton Scence and Economcs Novel Pattern-based Fngerprnt Recognton Technque Usng D Wavelet Decomposton TUDOR BARBU Insttute of Computer Scence of the Romanan Academy T. Codrescu,,
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationFace Recognition by Fusing Binary Edge Feature and Second-order Mutual Information
Face Recognton by Fusng Bnary Edge Feature and Second-order Mutual Informaton Jatao Song, Bejng Chen, We Wang, Xaobo Ren School of Electronc and Informaton Engneerng, Nngbo Unversty of Technology Nngbo,
More informationImproved SIFT-Features Matching for Object Recognition
Improved SIFT-Features Matchng for Obect Recognton Fara Alhwarn, Chao Wang, Danela Rstć-Durrant, Axel Gräser Insttute of Automaton, Unversty of Bremen, FB / NW Otto-Hahn-Allee D-8359 Bremen Emals: {alhwarn,wang,rstc,ag}@at.un-bremen.de
More informationFace Recognition using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationBrushlet Features for Texture Image Retrieval
DICTA00: Dgtal Image Computng Technques and Applcatons, 1 January 00, Melbourne, Australa 1 Brushlet Features for Texture Image Retreval Chbao Chen and Kap Luk Chan Informaton System Research Lab, School
More informationSRBIR: Semantic Region Based Image Retrieval by Extracting the Dominant Region and Semantic Learning
Journal of Computer Scence 7 (3): 400-408, 2011 ISSN 1549-3636 2011 Scence Publcatons SRBIR: Semantc Regon Based Image Retreval by Extractng the Domnant Regon and Semantc Learnng 1 I. Felc Raam and 2 S.
More informationGender Classification using Interlaced Derivative Patterns
Gender Classfcaton usng Interlaced Dervatve Patterns Author Shobernejad, Ameneh, Gao, Yongsheng Publshed 2 Conference Ttle Proceedngs of the 2th Internatonal Conference on Pattern Recognton (ICPR 2) DOI
More informationHistogram of Template for Pedestrian Detection
PAPER IEICE TRANS. FUNDAMENTALS/COMMUN./ELECTRON./INF. & SYST., VOL. E85-A/B/C/D, No. xx JANUARY 20xx Hstogram of Template for Pedestran Detecton Shaopeng Tang, Non Member, Satosh Goto Fellow Summary In
More informationFace Detection with Deep Learning
Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationLecture 13: High-dimensional Images
Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationA COMBINED APPROACH USING TEXTURAL AND GEOMETRICAL FEATURES FOR FACE RECOGNITION
ISSN: 0976-910(ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, MAY 013, VOLUME: 03, ISSUE: 04 A COMBINED APPROACH USING TEXTURAL AND GEOMETRICAL FEATURES FOR FACE RECOGNITION A. Suruland 1, R. Reena
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More informationImage Matching Algorithm based on Feature-point and DAISY Descriptor
JOURNAL OF MULTIMEDIA, VOL. 9, NO. 6, JUNE 2014 829 Image Matchng Algorthm based on Feature-pont and DAISY Descrptor L L School of Busness, Schuan Agrcultural Unversty, Schuan Dujanyan 611830, Chna Abstract
More informationTone-Aware Sparse Representation for Face Recognition
Tone-Aware Sparse Representaton for Face Recognton Lngfeng Wang, Huayu Wu and Chunhong Pan Abstract It s stll a very challengng task to recognze a face n a real world scenaro, snce the face may be corrupted
More informationClassifier Swarms for Human Detection in Infrared Imagery
Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
More informationPictures at an Exhibition
1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationPERFORMANCE EVALUATION FOR SCENE MATCHING ALGORITHMS BY SVM
PERFORMACE EVALUAIO FOR SCEE MACHIG ALGORIHMS BY SVM Zhaohu Yang a, b, *, Yngyng Chen a, Shaomng Zhang a a he Research Center of Remote Sensng and Geomatc, ongj Unversty, Shangha 200092, Chna - yzhac@63.com
More informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationCOMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL
COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationIMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH
IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH Jyot Joglekar a, *, Shrsh S. Gedam b a CSRE, IIT Bombay, Doctoral Student, Mumba, Inda jyotj@tb.ac.n b Centre of Studes n Resources Engneerng,
More informationDEFECT INSPECTION OF PATTERNED TFT-LCD PANELS USING A FAST SUB-IMAGE BASED SVD. Chi-Jie Lu* and Du-Ming Tsai**
Proceedngs of the Ffth Asa Pacfc Industral Engneerng and Management Systems Conference 2004 DEFECT INSPECTION OF PATTERNED TFT-LCD PANELS USING A FAST SUB-IMAGE BASED SVD Ch-Je Lu* and Du-Mng Tsa** *Department
More informationOn Modeling Variations For Face Authentication
On Modelng Varatons For Face Authentcaton Xaomng Lu Tsuhan Chen B.V.K. Vjaya Kumar Department of Electrcal and Computer Engneerng, Carnege Mellon Unversty Abstract In ths paper, we present a scheme for
More informationInvariant Shape Object Recognition Using B-Spline, Cardinal Spline, and Genetic Algorithm
Proceedngs of the 5th WSEAS Int. Conf. on Sgnal Processng, Robotcs and Automaton, Madrd, Span, February 5-7, 6 (pp4-45) Invarant Shape Obect Recognton Usng B-Splne, Cardnal Splne, and Genetc Algorthm PISIT
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationClassification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM
Classfcaton of Face Images Based on Gender usng Dmensonalty Reducton Technques and SVM Fahm Mannan 260 266 294 School of Computer Scence McGll Unversty Abstract Ths report presents gender classfcaton based
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More information