MMCRCVJan 16, 2017

A Watermarking Technique Using Discrete Curvelet Transform for Security of Multiple Biometric Features

arXiv:1701.04185v11 citations
Originality Synthesis-oriented
AI Analysis

This work addresses security for biometric systems by improving robustness against spoofing, though it appears incremental as it builds on existing watermarking and feature extraction methods.

The paper tackles the problem of securing biometric data by proposing a multiple watermarking technique that embeds fingerprint, face, iris, and signature features into an image using discrete curvelet transform, resulting in a fragile method that prevents extraction by imposters and enables cross-verification and copyright protection.

The robustness and security of the biometric watermarking approach can be improved by using a multiple watermarking. This multiple watermarking proposed for improving security of biometric features and data. When the imposter tries to create the spoofed biometric feature, the invisible biometric watermark features can provide appropriate protection to multimedia data. In this paper, a biometric watermarking technique with multiple biometric watermarks are proposed in which biometric features of fingerprint, face, iris and signature is embedded in the image. Before embedding, fingerprint, iris, face and signature features are extracted using Shen-Castan edge detection and Principal Component Analysis. These all biometric watermark features are embedded into various mid band frequency curvelet coefficients of host image. All four fingerprint features, iris features, facial features and signature features are the biometric characteristics of the individual and they are used for cross verification and copyright protection if any manipulation occurs. The proposed technique is fragile enough; features cannot be extracted from the watermarked image when an imposter tries to remove watermark features illegally. It can use for multiple copyright authentication and verification.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes