Spelling suggestions: "subject:"biometry."" "subject:"audiometry.""
251 |
Latent pattern mixture models for binary outcomes /Saba, Laura M. January 2007 (has links)
Thesis (Ph.D. in Biostatistics) -- University of Colorado Denver, 2007. / Typescript. Includes bibliographical references (leaves 70-71). Free to UCD affiliates. Online version available via ProQuest Digital Dissertations;
|
252 |
Contribution to the analysis of complex survey data and cluster-correlated biological data using inverse sampling /Benhin, Emmanuel, January 1900 (has links)
Thesis (Ph. D.)--Carleton University, 2004. / Includes bibliographical references (p. 175-179). Also available in electronic format on the Internet.
|
253 |
Semiparametric regression with random effects /Lee, Sungwook, January 1997 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 114-117). Also available on the Internet.
|
254 |
Examination of novel statistical designs for phase II and phase III clinical trialsAyanlowo, Ayanbola Olajumoke. January 2007 (has links) (PDF)
Thesis (Ph. D.)--University of Alabama at Birmingham, 2007. / Title from first page of PDF file (viewed Oct. 13, 2008). Includes bibliographical references.
|
255 |
Semiparametric regression with random effectsLee, Sungwook, January 1997 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 114-117). Also available on the Internet.
|
256 |
Noninformative priors for some models useful in reliability and survival analysis /Lee, Gunhee, January 1996 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1996. / Typescript. Vita. Includes bibliographical references (leaves 105-108). Also available on the Internet.
|
257 |
Noninformative priors for some models useful in reliability and survival analysisLee, Gunhee, January 1996 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1996. / Typescript. Vita. Includes bibliographical references (leaves 105-108). Also available on the Internet.
|
258 |
Evalutation [i.e. Evaluation] of sediment-sensitive biological metrics as biomonitoring tools on varied spatial scalesOwens, Janna Yvonne Smithey. January 2006 (has links) (PDF)
Thesis (Ph. D.)--University of Alabama at Birmingham, 2006. / Description based on contents viewed Jan. 26, 2007; title from title screen. Includes bibliographical references (p. 98-105).
|
259 |
Abordagem baseada em morfologia matemática para a identificação biométrica através da irisMira Junior, Joaquim de 25 May 2012 (has links)
Este trabalho apresenta uma proposta para a identificação biométrica de indivíduos através da análise da íris, utilizando uma abordagem baseada em Morfologia Matemática. Algoritmos baseados em operadores morfológicos são utilizados nas diversas etapas de processamento, para segmentação, realçamento de padrões, extração e representação de características. Para avaliar os algoritmos, testes foram realizados utilizando imagens do Banco de Dados de Imagens de Íris da Universidade de Bath - UBIID, da base de dados do Instituto de Automação da Academia Chinesa de Ciências - CASIA, além de imagens adquiridas para compor o Banco de Dados Brasileiro de Pesquisa de Íris - BIRD. A fim de avaliar o desempenho de classificação, o método proposto foi comparado ao método de Daugman (referência). Os resultados obtidos indicam a viabilidade da abordagem proposta para o reconhecimento de íris. Para imagens do UBIID, o desempenho do método proposto foi superior ao do método de referência, alcançando 99,35% de acerto no ponto de erro igual (EER - Equal Error Rate), onde as taxas de falsa aceitação (FAR) e de falsa rejeição (FRR) são iguais. / This paper presents a proposal for biometric identification of individuals by analyzing the iris, using an approach based on Mathematical Morphology. Algorithms based on morphological operators are used in several stages of processing, segmentation, enhancement of patterns, extraction and representation of features. To evaluate the algorithms, tests were performed using images of the University of Bath Iris Image Database - UBIID, of the Chinese Academy of Sciences Institute of Automation - CASIA, and acquired images to compose the Brazilian Iris Research Database - BIRD. In order to assess the performance of classification, the proposed method was compared to Daugman’s method (reference). The results indicate the viability of the proposed approach for iris recognition. For UBIID images, the performance of the proposed method was superior to the reference method, achieving 99.35% accuracy at the point of equal error (EER - Equal Error Rate), where the false acceptance rate (FAR) and false rejection rate (FRR) are equal.
|
260 |
Paralelização em CUDA/GLSL do algoritmo SIFT para reconhecimento de íris / A CUDA/GLSL parallelization of SIFT algorithm for iris recognitionLuiz Fernando Rosalba Telles de Sousa 28 February 2012 (has links)
Conselho Nacional de Desenvolvimento Científico e Tecnológico / Neste trabalho é estudada a viabilidade de uma implementação em paralelo do
algoritmo scale invariant feature transform (SIFT) para identificação de íris. Para a
implementação do código foi utilizada a arquitetura para computação paralela compute unified
device architecture (CUDA) e a linguagem OpenGL shading language (GLSL). O algoritmo
foi testado utilizando três bases de dados de olhos e íris, o noisy visible wavelength iris image
Database (UBIRIS), Michal-Libor e CASIA. Testes foram feitos para determinar o tempo de
processamento para verificação da presença ou não de um indivíduo em um banco de dados,
determinar a eficiência dos algoritmos de busca implementados em GLSL e CUDA e buscar
valores de calibração que melhoram o posicionamento e a distribuição dos pontos-chave na
região de interesse (íris) e a robustez do programa final. / Present work studies the feasibility of a parallel implementation of the scene
recognition algorithm SIFT for iris recognition. The code was built using the
Compute Unified Device Architecture (CUDA) and the shading language GLSL. The
algorithm was tested using three databases containing eyes and iris, the UBIRIS, Michal-
Libor and CASIA. Tests were made for: analyzing the requested time for checking if an
subject is or is not present on current database, the efficiency of the search algorithms written
in CUDA and GLSL, the search for calibration values that improve keypoints position and
distribution through the region of interest (iris), analyzing the reliability of the final code.
|
Page generated in 0.0482 seconds