Feature Level Fusion of Face and Palmprint Biometrics by Isomorphic Graph-based Improved K-Medoids Partitioning

04/12/2010
by   Dakshina Ranjan Kisku, et al.
0

This paper presents a feature level fusion approach which uses the improved K-medoids clustering algorithm and isomorphic graph for face and palmprint biometrics. Partitioning around medoids (PAM) algorithm is used to partition the set of n invariant feature points of the face and palmprint images into k clusters. By partitioning the face and palmprint images with scale invariant features SIFT points, a number of clusters is formed on both the images. Then on each cluster, an isomorphic graph is drawn. In the next step, the most probable pair of graphs is searched using iterative relaxation algorithm from all possible isomorphic graphs for a pair of corresponding face and palmprint images. Finally, graphs are fused by pairing the isomorphic graphs into augmented groups in terms of addition of invariant SIFT points and in terms of combining pair of keypoint descriptors by concatenation rule. Experimental results obtained from the extensive evaluation show that the proposed feature level fusion with the improved K-medoids partitioning algorithm increases the performance of the system with utmost level of accuracy.

READ FULL TEXT
research
02/02/2010

Feature Level Fusion of Biometrics Cues: Human Identification with Doddingtons Caricature

This paper presents a multimodal biometric system of fingerprint and ear...
research
12/05/2014

An iterative step-function estimator for graphons

Exchangeable graphs arise via a sampling procedure from measurable funct...
research
02/02/2010

Face Identification by SIFT-based Complete Graph Topology

This paper presents a new face identification system based on Graph Matc...
research
03/02/2020

Efficient algorithms for the Potts model on small-set expanders

We develop an approximation algorithm for the partition function of the ...
research
02/12/2010

Feature Level Fusion of Face and Fingerprint Biometrics

The aim of this paper is to study the fusion at feature extraction level...
research
11/17/2012

Data Clustering via Principal Direction Gap Partitioning

We explore the geometrical interpretation of the PCA based clustering al...
research
06/24/2023

Partitioning-Guided K-Means: Extreme Empty Cluster Resolution for Extreme Model Compression

Compactness in deep learning can be critical to a model's viability in l...

Please sign up or login with your details

Forgot password? Click here to reset