Mulagala Sandhya

Mulagala Sandhya

Auto-generated profile, based on publicly available information

Mulagala Sandhya

National Institute of Technology Warangal

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2016 in IET Biometrics
Verified
Journal Article
Closed access
MSMulagala Sandhya
Mulagala Sandhya
MPMunaga V.N.K. Prasad
Munaga V.N.K. Prasad
RCRaghavendra Rao Chillarige
Raghavendra Rao Chillarige
In this study, the authors propose a novel fingerprint template protection scheme that is developed using Delaunay triangulation net constructed from the fingerprint minutiae. The authors propose two methods namely FS_INCIR and FS_AVGLO to construct a feature set from the Delaunay triangles. The feature set computed is quantised and mapped to a 3D array to produce fixed length 1D bit string. This bit string is applied with a DFT to generate a complex vector. Finally, the complex vector is multiplied by user's key to generate a cancellable template. The proposed computation of feature set maintained a good balance between security and performance. These methods are tested on FVC 2002 and FVC 2004 databases and the experimental results show satisfactory performance. Further, the authors analysed the four requirements namely diversity, revocability, irreversibility and accuracy for protecting biometric templates. Thus, the feasibility of proposed scheme is depicted.

24 December 2016
Verified
Book Chapter
Closed access
PDF file
MSMulagala Sandhya
Mulagala Sandhya
MPMunaga V. N. K. Prasad
Munaga V. N. K. Prasad

23 January 2017 in IET Biometrics
Verified
Journal Article
Open access
PDF file
MSMulagala Sandhya
Mulagala Sandhya
MPMunaga V.N.K. Prasad
Munaga V.N.K. Prasad
This study presents a protection method for fingerprint templates by using fused structures at the feature level. The authors compute two transformed features from minutiae points: namely, local structure and distant structure. These structures are represented as bit‐strings. A fusion on bit‐strings is done at the feature level to produce a cancelable template. An equal error rate (EER) of 2.19, 1.6 and 6.14% on Fingerprint Verification Competition (FVC) 2002 Database (DB)1 through DB3 databases and an EER of 11.89, 12.71, 17.6% on FVC 2004 DB1 through DB3 proves the tenability of the proposed method.

1 May 2015
Verified
Conference Paper
Closed access
MSMulagala Sandhya
Mulagala Sandhya
MPMunaga V.N.K Prasad
Munaga V.N.K Prasad
In this paper we focus on constructing k-Nearest Neighborhood Structure(k - NNS) for minutiae points in a fingerprint image. For each minutiae point in a fingerprint, a k - NNS is constructed taking the local and global features of minutiae points. This structure is quantized and mapped onto a 2D array to generate a fixed length 1D bit-string. Further this bit string is applied with a DFT to generate a complex vector. Finally the complex vector is multiplied by a user specific random matrix to generate the cancelable template. We tested our proposed method on database FV C2002 and experimental results depicts the validity of the proposed method in terms of requirements of cancelable biometrics namely diversity, accuracy, irreversibility and revocability.

22 February 2022 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
MSMulagala Sandhya
Mulagala Sandhya
MMMahesh Kumar Morampudi
Mahesh Kumar Morampudi
IPIndragante Pruthweraaj
Indragante Pruthweraaj
PGPranay Sai Garepally
Pranay Sai Garepally

2 February 2017 in International Journal of Pattern Recognition and Artificial Intelligence
Verified
Journal Article
Closed access
MSMulagala Sandhya
Mulagala Sandhya
MPMunaga V. N. K. Prasad
Munaga V. N. K. Prasad