Tuesday, May 26, 2015

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Mathematical Morphology Approach for Genuine Fingerprint Feature Extraction

1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario
    registrado en Universia


  Descargar recurso

Detalles del recurso

Pertenece a: CiteSeerX Scientific Literature Digital Library and Search Engine  

Descripción: Recognition systems based on biometrics (faces, hand shapes and fingerprints etc.) are finally taking off although it has taken a long way to come. Fingerprints have been a precious tool for law enforcement, forensics and recently in commercial use for over a century. Evaluate the performance of these emerging technologies is tricky problem. Most fingerprint verification algorithms rely on minutiae features, and these algorithms can only be as robust as the underlying minutiae features. Therefore, reliable minutiae extraction is vital to a system’s performance. Most of the feature extraction techniques extract features from thinned images but while dealing with binarization and skeletization of image it introduces noise or superfluous information, which creates troubles for genuine feature extraction. In this paper we have used the mathematical morphology to remove the superfluous information for genuine feature extraction and measure the feature extraction performance through sensitivity and specificity.

Autor(es): Vikas Humbe -  S. S. Gornale -  Ramesh Manza -  K. V. Kale - 

Id.: 45682839

Idioma: English  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Palabras claveFeature Extraction - 

Tipo de recurso: Texto Narrativo  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [IsBasedOn] http://ijcss.org/Volume1/Issue2/V1_I2_053.pdf
[References] 10.1.1.119.7009
[References] 10.1.1.6.7497
[References] 10.1.1.19.6417
[References] 10.1.1.104.690
[References] 10.1.1.19.6687

Fecha de contribución: 28-jul-2011

Contacto:

Localización:


Otros recursos del mismo autor(es)

  1. An Approach-Effect of an Exponential Distribution on different medical images Medical imaging refers to technique and process used to create images of human body (or part thereof...
  2. Linguistic Divergence Patterns in English to Marathi Translation In machine translation system, the text is translated from one language known as source language int...
  3. Classification of Crops from remotely sensed Images:AnOverview Crops identification from remotely sensed images is essential due to use of remote sensing images as...
  4. Using Genetic Algorithm for Automated Efficient Software Test Case Generation for Path Testing This paper discusses genetic algorithms that can automatically generate test cases to test selected ...
  5. Fingerprint Image Compression using Retain Energy (RE) and Number of Zeros (NZ) through Wavelet Packet (WP) Fingerprint analysis plays crucial role in crucial legal matters such as investigation of crime. But...

Otros recursos de la misma colección

  1. h-Monotonically Computable Real Numbers Let h: N → Q be a computable function. A real number x is called h-monotonically computable (h-mc, f...
  2. Effective Jordan Decomposition The Jordan decomposition Theorem says that any real function of bounded variation can be expressed a...
  3. h-Monotonically Computable Real Numbers
  4. Finite-State Dimension and Real Arithmetic We use entropy rates and Schur concavity to prove that, for every integer k ≥ 2, every nonzero ratio...
  5. On the Turing degrees of weakly computable real numbers The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This d...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso