1 / 9

Stable Biometric Features

Stable Biometric Features. Description (not definition): Biometric features whose value change very infrequently among multiple prints of a finger

mali
Download Presentation

Stable Biometric Features

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Stable Biometric Features Description (not definition): Biometric features whose value change very infrequently among multiple prints of a finger Deformation Invariant Features V/S Stable Features: Since biometrics are prone to burst errors in addition to noise and other deformations due to unavoidable conditions so only deformation (linear and non-linear) invariant features won’t suffice to implement total invariance.

  2. Fingerprints from same finger Deformation invariant features Stable Features

  3. Stable Feature Extraction • Element by element quantization • Using the error correcting codes to counter burst errors.

  4. Element by element quantization • n(~10-15) sample features from prints of same finger are taken at the registration step • Mean and variance of each feature element is calculated over the samples • Lower and upper bounds on the variance is set to take care of extreme situations • Clustering of the samples could also be done to handle the burst errors as error-free samples would cluster out

  5. The possible range of feature values i.e.0-255 is divided into blocks of width 6σ such that the mean is at the center of the block. • Any value of a particular feature element is quantized to the center of the block in which it lies. • The block-length of each division of the range(0-255) for each element and the offset of the first block from 0 is made public for quantization.

  6. Feature Elements For each element n samples μ 0 255 6σ Mean (μ) SD (σ)

  7. Using Error-correcting codes for stability • A new scheme has been designed to utilize the error correcting codes for stability • The mean vector of the sample features is taken as the quantized feature vector. • This vector is assumed to be a RS error correcting code of certain desired error correcting capability. • The vector is decoded to get the message • The message is again coded to get the error free message.

  8. Mean (μ) RS decode Decoded message RS encode Error free code Mean (μ) Cyclic shift map Error free code • Since the range of values is fixed(0-255) a cyclic shift map is found from the quantized feature vector (mean) to the error free code. • The cyclic shift map is made public

  9. Feature Vector Quantization Quantized Feature Vector Cyclic shift map Shifted Vector RS decode Stable Feature Extracting the stable feature • First the feature vector is quantized using the block-length and the offset • The quantized feature vector is transformed using the cyclic shift map and decoded to get the stable feature.

More Related