“…The most common method to find the similarity between the input feature vector and the stored template is to use a classical distance measure such as Euclidean distance, Mahalanobis distance, Canberra Distance, Euclidean Distance, City Block distance and Hamming Distance. Some of the algorithms that used features-based approaches can be found in [4,9,12,22,28,33,49,52,65,93,94,107,139,161,162,179,193,195,199,200,205,208,209,210,215]. L. Lee et al [12] discussed a number of techniques for feature selection from a set of 42 features and 49 normalized features.…”