No description available.

Orientador: Aledir Silveira Pereira / Banca: Aparecido Nilceu Marana / Banca: Evandro Luís Linhari Rodrigues / Resumo: Nos últimos anos, a segurança tornou-se uma preocupação constante da grande maioria das pessoas. Os sistemas biométricos vem ganhando destaque em soluções ligadas à segurança, uma vez que tratam de características físicas e comportamentais para reconhecimento dos indivíduos e permissões de acesso. Este trabalho objetivou a proposição e implementação de um método para reconhecimento de indivíduos por meio de características contidas na região interna da íris com um alto percentual de exatidão no reconhecimento e uma grande diminuição no tempo de processamento, se comparado aos demais métodos encontrados na literatura. No método proposto foram utilizados operadores de morfologia matemática para localização da íris, wavelet de log-Gabor para extração das características e a distância de Hamming para o reconhecimento. Os resultados experimentais obtidos utilizando a base de dados CASIA mostraram que o método é confiável e seguro, além de se destacar com relação ao baixo custo computacional / Abstract: In the recent years, the security became a constant concern of most people. Biometric systems have been highlighted in solutions related to security, since they deal with physical and behavioral characteristics for individuals recognition and access permissions. This work aims at the implementation of a method for individuals recognition based on the characteristics of the inner region of the iris, seeking a high percentage of accuracy in the recognition and a great reduction in the processing time, as compared to other methods published so far. We use mathematical morphology to search the iris in the image, the log-Gabor wavelet for feature extraction and the Hamming distance for recognition. The experimental results obtained from CASIA database show that the method is safe and reliable, and stand out with regard to the low computational cost / Mestre

The hardware as well as software communities have recently experienced a shift towards mitigating bit flips issues in software, rather than completely mitigating only in hardware. For this software error mitigation, arithmetic error coding schemes like AN coding are increasingly applied because arithmetic operations can be directly executed without decoding and bit flip detection is provided in an end-to-end fashion. In this case, each encoded data word is computed by multiplying the original data word with a constant integer value A. To reliably detect b bit flips in each code word, the value A has to be well-chosen, so that a minimum Hamming distance of b + 1 can be guaranteed. However, the value A depends on the data word length as well as on the desired minimum Hamming distance. Up to now, a very expensive brute force approach for computation of the value for A is applied. To tackle that in a more efficient way, we present a lower bound-oriented approach for this calculation in this paper.

<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d) non isométriques, des invariants ont été construits et leur efficacité étudiée. Tous les G(4,3) et les G(5,4) ont été engendrés à une isométrie près, il y en a respectivement 61 et 9445 (dont 139 sont maximaux et décrits explicitement). D’autres classes de G(n,d) sont étudiées.<p><p><p><p> <p><p><p><p>A permutation code G(n,d) is a subset C of Sym(n) such that the Hamming distance D between two elements of C is larger than or equal to d. In this thesis, we characterize the isometry group of the metric space (Sym(n),D) and we prove that these isometries are automorphisms of the association scheme induced on Sym(n) by the conjugacy classes. This leads, by linear programming, to new upper bounds for the maximal size of G(n,d) codes for n and d fixed and n between 11 and 13. We develop generating algorithms with rejection of isomorphic objects. In order to classify the G(n,d) codes up to isometry, we construct invariants and study their efficiency. We generate all G(4,3) and G(4,5)codes up to isometry; there are respectively 61 and 9445 of them. Precisely 139 out of the latter codes are maximal and explicitly described. We also study other classes of G(n,d)codes.<p><p><p><p> / Doctorat en sciences, Spécialisation mathématiques / info:eu-repo/semantics/nonPublished

Biometrics is a method of recognizing the identity of a person based on unique biological characteristics that are unique to each person. The methods of biometric identification is currently becoming increasingly widespread in various sectors. This work is focused on the identification of a person by iris images. The introductory section describes the principles of the well-known methods for biometric applications and the next part describes the design method and its implementation in Matlab. In the practical part, fast radial symmetry method is used for detection of pupil, from which it derives further image processing. Two dimensional discrete welvet transform is used here. The proposed algorithm is tested on databases CASIA-Iris- Interval and database IITD.

Diese Dissertation beschäftigt sich mit regionaler Klimamodellierung über Südamerika, der Analyse von Modellsensitivitäten bezüglich Wolkenparametrisierungen und der Entwicklung neuer Methoden zur Modellevaluierung mithilfe von Klimanetzwerken. Im ersten Teil untersuchen wir Simulationen mit dem COnsortium for Small scale MOdeling model in CLimate Mode (COSMO-CLM) und stellen die erste umfassende Evaluierung dieses dynamischen regionalen Klimamodells über Südamerika vor. Dabei untersuchen wir insbesondere die Abhängigkeit simulierter tropischer Niederschläge von Parametrisierungen subgitterskaliger cumuliformer und stratiformer Wolken und finden starke Sensitivitäten bezüglich beider Wolkenparametrisierungen über Land. Durch einen simultanen Austausch der entsprechenden Schemata gelingt uns eine beträchtliche Reduzierung von Fehlern in klimatologischen Niederschlags- und Strahlungsmitteln, die das COSMO-CLM über tropischen Regionen für lange Zeit charakterisierten. Im zweiten Teil führen wir neue Metriken für die Evaluierung von Klimamodellen bezüglich räumlicher Kovariabilitäten ein. Im Kern bestehen diese Metriken aus Unähnlichkeitsmaßen für den Vergleich von simulierten mit beobachteten Klimanetzwerken. Wir entwickeln lokale und globale Unähnlichkeitsmaße zum Zwecke der Darstellung lokaler Unähnlichkeiten in Form von Fehlerkarten sowie der Rangordnung von Modellen durch Zusammenfassung lokaler zu globalen Unähnlichkeiten. Die neuen Maße werden dann für eine vergleichende Evaluierung regionaler Klimasimulationen mit COSMO-CLM und dem Statistical Analogue Resampling Scheme über Südamerika verwendet. Dabei vergleichen wir die sich ergebenden Modellrangfolgen mit solchen basierend auf mittleren quadratischen Abweichungen klimatologischer Mittelwerte und Varianzen und untersuchen die Abhängigkeit dieser Rangfolgen von der betrachteten Jahreszeit, Variable, dem verwendeten Referenzdatensatz und Klimanetzwerktyp. / This dissertation is about regional climate modeling over South America, the analysis of model sensitivities to cloud parameterizations, and the development of novel model evaluation techniques based on climate networks. In the first part we examine simulations with the COnsortium for Small scale MOdeling weather prediction model in CLimate Mode (COSMO-CLM) and provide the first thorough evaluation of this dynamical regional climate model over South America. We focus our analysis on the sensitivity of simulated tropical precipitation to the parameterizations of subgrid-scale cumuliform and stratiform clouds. It is shown that COSMO-CLM is strongly sensitive to both cloud parameterizations over tropical land. Using nondefault cumulus and stratus parameterization schemes we are able to considerably reduce long-standing precipitation and radiation biases that have plagued COSMO-CLM across tropical domains. In the second part we introduce new performance metrics for climate model evaluation with respect to spatial covariabilities. In essence, these metrics consist of dissimilarity measures for climate networks constructed from simulations and observations. We develop both local and global dissimilarity measures to facilitate the depiction of local dissimilarities in the form of bias maps as well as the aggregation of those local to global dissimilarities for the purposes of climate model intercomparison and ranking. The new measures are then applied for a comparative evaluation of regional climate simulations with COSMO-CLM and the STatistical Analogue Resampling Scheme (STARS) over South America. We compare model rankings obtained with our new performance metrics to those obtained with conventional root-mean-square errors of climatological mean values and variances, and analyze how these rankings depend on season, variable, reference data set, and climate network type.

In my thesis, I focus on the task of recognizing human iris from an image.In the beginning, the work deals with a question of biometrics, its importance and basic concepts, which are necessary for use in following text. Subsequently process of human Iris detection is described together with theory of evolution algorithms. In the implementation part, is described the design of implemented solution, which uses evolution algorithms, where is emphasis on correct pupil and iris boundary detection.