<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<identifier>8JMKD3MGPBW34M/3886QRE</identifier>
		<repository>sid.inpe.br/sibgrapi/2010/09.09.11.53</repository>
		<lastupdate>2010:09.09.11.53.58 sid.inpe.br/banon/2001/03.30.15.38 juan.climent@upc.edu</lastupdate>
		<metadatarepository>sid.inpe.br/sibgrapi/2010/09.09.11.53.59</metadatarepository>
		<metadatalastupdate>2010:10.01.04.19.39 sid.inpe.br/banon/2001/03.30.15.38 juan.climent@upc.edu {D 2010}</metadatalastupdate>
		<citationkey>ClimentBlanHexs:2010:ApStMa</citationkey>
		<title>Approximate string matching for iris recognition by means of boosted Gabor wavelets</title>
		<format>Printed, On-line.</format>
		<year>2010</year>
		<date>Aug. 30 - Sep. 3, 2010</date>
		<numberoffiles>1</numberoffiles>
		<size>436 Kbytes</size>
		<author>Climent, Joan,</author>
		<author>Blanco, Juan Diego,</author>
		<author>Hexsel, Roberto,</author>
		<affiliation>Universitat Politècnica de Catalunya</affiliation>
		<affiliation>Universitat Politècnica de Catalunya</affiliation>
		<affiliation>Universidade Federal do Paraná</affiliation>
		<editor>Bellon, Olga,</editor>
		<editor>Esperança, Claudio,</editor>
		<e-mailaddress>juan.climent@upc.edu</e-mailaddress>
		<conferencename>Conference on Graphics, Patterns and Images, 23 (SIBGRAPI)</conferencename>
		<conferencelocation>Gramado</conferencelocation>
		<booktitle>Proceedings</booktitle>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<transferableflag>1</transferableflag>
		<contenttype>External Contribution</contenttype>
		<tertiarytype>Full Paper</tertiarytype>
		<keywords>iris recognition, AdaBoost, biometrics, Levenshtein distance, string matching.</keywords>
		<abstract>This paper presents an efficient IrisCode classifier, built from phase features which uses AdaBoost for the selection of Gabor wavelets bandwidths. The final iris classifier consists of a weighted contribution of weak classifiers. As weak classifiers we use 3-split decision trees that identify a candidate based on the Levenshtein distance between phase vectors of the respective iris images. Our experiments show that the Levenshtein distance has better discrimination in comparing IrisCodes than the Hamming distance. Our process also differs from existing methods because the wavelengths of the Gabor filters used, and their final weights in the decision function, are chosen from the robust final classifier, instead of being fixed and/or limited by the programmer, thus yielding higher iris recognition rates. A pyramidal strategy for cascading filters with increasing complexity makes the system suitable for realtime operation.</abstract>
		<language>en</language>
		<targetfile>Climent.pdf</targetfile>
		<usergroup>juan.climent@upc.edu</usergroup>
		<visibility>shown</visibility>
		<mirrorrepository>dpi.inpe.br/banon-pc2@80/2006/08.30.19.27</mirrorrepository>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi/2010/09.09.11.53</url>
	</metadata>
</metadatalist>