Résumé:
Fingerprint database clustering and localization using k-medoids and k-nearest neighbour (k-NN) algorithms respectively typically use distance-based fingerprint similarity metrics, with their performances dependent on the type of distance metric used. This paper proposes employing a pattern-based metric, the context similarity coefficient (CSC), for both algorithms instead of traditional distance-based metrics. The CSC accounts for fingerprint behaviour and the non-linear relationships among fingerprints during the similarity measurement. The performance of both algorithms with the CSC as the similarity metric is evaluated on four publicly available fingerprint databases, using position root mean square error (RMSE) and silhouette score as performance metrics. These results are compared to those of the same algorithms using five distance-based metrics: Euclidean, square Euclidean, Manhattan, cosine, and Chebyshev distances. The k-medoids algorithm with CSC shows moderate clustering performance compared to the five distance-based metrics considered. However, when combined with the k-NN algorithm also using CSC, it achieves the highest localization accuracy, with at least a 29% improvement in position RMSE across all four databases. The results indicate that while k-medoids with CSC may not create well-separated clusters, combining it with the k-NN algorithm with CSC as its similarity metric significantly enhances localization accuracy compared to distance-based metrics.
