A robust alignment-free fingerprint hashing algorithm based on minimum distance graphs

Das, Priyanka; Karthik, Kannan; Garai, Boul Chandra

doi:10.1016/j.patcog.2012.02.022

Cited by 73 publications

(40 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For minutia pairs, this can be the distance between the points ( Boult et al, 2007), (Das et al, 2012), (Jin et al, 2010) use a pair representation. (Chen et al, 2006), (Jin et al, 2013), (Jin et al, 2009), (Li et al, 2012), (Parziale and Niel, 2004), , (Zheng et al, 2009) use generic triangles.…”

Section: Invariant Representationmentioning

confidence: 99%

Remote authentication using vaulted fingerprint verification

Alzahrani

Boult

2014

SPIE Proceedings

View full text Add to dashboard Cite

Fingerprint biometrics are increasingly used for identity verification. However, these require a careful balance of accuracy and privacy that is missing in many implementations.This dissertation describes a new biometric matching system, the protection of an existing datatype, and a model for matching security with error correction codes.My research develops the Vaulted Verification (VV) system into Vaulted Fingerprint Verification (VFV) by implementing VV on a fingerprint minutia triangle representation.VFV is fully compatible with protected biometric datatypes. This is demonstrated by including PMCC, as well as a protected modification of PMCC. VFV allows for key exchange using the protected biometric template.Due to the importance of error correcting codes (ECC) in VFV, a model of security with ECC is developed. It is used to identify non-trivial potential attacker uses of ECC bits.To my parents and my family.

show abstract

Section: Invariant Representationmentioning

confidence: 99%

Remote authentication using vaulted fingerprint verification

Alzahrani

Boult

2014

SPIE Proceedings

View full text Add to dashboard Cite

show abstract

“…By and large, the proposed approach exhibits satisfactoty performance although the EER of [27] for FVC2002 DB3 is slightly better than that of the new method. [22] 6.94% -Ahmad et al [25] 6% 27% Wang and Hu [27] 5% 7.5% Das et al [28] 3.79% -Proposed method 3% 9.12%…”

Section: ) Lost Key Scenariomentioning

confidence: 99%

“…There has been a growing interest in the analysis and design of alignment-free cancelable biometrics, see e.g., [12]- [28]. Lee et al [12] developed alignment-free cancelable templates by obtaining invariant quantities, which are calculated using the orientations of neighboring regions around each minutia.…”

Section: Introductionmentioning

confidence: 99%

“…Protection of quantized minutiae vectors is accomplished by hiding the true solution among infinitely many alternative solutions. Das et al [28] presented an alignment-free fingerprint hashing algorithm based on minimum distance graphs (MDG). The MDG is composed of a set of connected nodes formed by computing the distance between the core and the next nearest minutia and then the distance between the next closest minutia and its predecessor and so on.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Hadamard transform-based method for the design of cancellable fingerprint templates

Wang

2013

2013 6th International Congress on Image and Signal Processing (CISP)

View full text Add to dashboard Cite

Cancelable biometrics is an important biometric template protection scheme and can effectively address privacy and security concerns in the case of stored biometric templates being compromised. This paper presents a Hadamard transformbased approach to the design of cancelable fingerprint templates. The proposed cancelable templates are alignment-free and hence do not suffer from inaccurate fingerprint registration. The proposed method aims to protect the binary string's frequencydomain samples because they include essential information about original fingerprint minutiae. The protection of the binary string's frequency-domain samples is achieved by the proposed partial Hadamard transform. The non-invertible transformation involved in our approach features a partial Hadamard matrix, which can be readily formed by a randomly generated index vector. A compromised template can be canceled and a new one be produced by generating a different index vector. The proposed approach is evaluated over the publicly available databases FVC2002 DB2 and DB3. The experimental results demonstrate that the performance of the new method is satisfactory compared to those of the existing alignment-free cancelable fingerprint templates.

show abstract

“…7,8 Therefore, it is essential to accurately estimate SP location within a small bounding box. However, the design of such a detection algorithm encounters many challenging problems such as:…”

Section: Introductionmentioning

confidence: 99%

Efficient fingerprint singular points detection algorithm using orientation-deviation features

Belhadj

Akrouf

Harous

et al. 2015

J. Electron. Imaging

View full text Add to dashboard Cite

Accurate singular point (SP) detection is an important factor in fingerprint (FP) recognition systems. We propose an algorithm to detect SPs in FP images. Our idea is based on the observation that the orientation field (OF) at the regions containing SPs has high variation, whereas in the other regions, it is smooth. Thus, a pixel-wise descriptor that comprises orientation-deviation (OD)-based features is proposed to measure the OF variation in the local neighborhood of a pixel which we call OF energy. Candidate SPs are characterized by locations where the OF energy function has local gradual maxima. Furthermore, the OD-based descriptor exhibits some advanced topological properties, in particular the descriptor profile tendency, which are highly correlated with the SP type. These properties are used to filter out some spurious SPs. A second refining step based on an extended Poincaré index is then applied to keep only genuine SPs with their information. The proposed algorithm has the ability to accurately detect the classical singularities as well as the arch-type SP. Experiments conducted over the public databases FVC2002 db1 and db2 confirm its accuracy and reliability with a reduced false alarm rate in comparison to other proposed methods.

show abstract

A robust alignment-free fingerprint hashing algorithm based on minimum distance graphs

Cited by 73 publications

References 16 publications

Remote authentication using vaulted fingerprint verification

Remote authentication using vaulted fingerprint verification

A Hadamard transform-based method for the design of cancellable fingerprint templates

Efficient fingerprint singular points detection algorithm using orientation-deviation features

Contact Info

Product

Resources

About