Cancelable iris Biometrics based on data hiding schemes

Bismita Choudhury, Patrick Then, Valliappan Raman, Biju Issac, Manas Kumar Haldar

    Research output: Contribution to conferencePaperpeer-review

    355 Downloads (Pure)

    Abstract

    The Cancelable Biometrics is a template protection scheme that can replace a stolen or lost biometric template. Instead of the original biometric template, Cancelable biometrics stores a modified version of the biometric template. In this paper, we have proposed a Cancelable biometrics scheme for Iris based on the Steganographic technique. This paper presents a noninvertible transformation function by combining Huffman Encoding and Discrete Cosine Transformation (DCT). The combination of Huffman Encoding and DCT is basically used in steganography to conceal a secret image in a cover image. This combination is considered as one of the powerful non-invertible transformation where it is not possible to extract the exact secret image from the Stego-image. Therefore, retrieving the exact original image from the Stego-image is nearly impossible. The proposed non-invertible transformation function embeds the Huffman encoded bit-stream of a secret image in the DCT coefficients of the iris texture to generate the transformed template. This novel method provides very high security as it is not possible to regenerate the original iris template from the transformed (stego) iris template. In this paper, we have also improved the segmentation and normalization process.
    Original languageEnglish
    Number of pages6
    DOIs
    Publication statusPublished - Dec 2016
    Event2016 IEEE Student Conference on Research and Development (SCOReD) - Kuala Lumpur, Malaysia
    Duration: 13 Dec 201614 Dec 2016

    Conference

    Conference2016 IEEE Student Conference on Research and Development (SCOReD)
    Period13/12/1614/12/16

    Fingerprint

    Dive into the research topics of 'Cancelable iris Biometrics based on data hiding schemes'. Together they form a unique fingerprint.

    Cite this