One of the most fitting biometric for identifying individuals is finger veins. In this paper, we study the human recognition via finger vein images that recognize persons at a high level of accuracy. First we use entropy based thresholding for segmentation and extractio More
One of the most fitting biometric for identifying individuals is finger veins. In this paper, we study the human recognition via finger vein images that recognize persons at a high level of accuracy. First we use entropy based thresholding for segmentation and extraction veins from finger vein images. The method extract veins as well, but the images are very noisy. That means in addition to the veins that appeared as dark lines, they have some Intersecting lines. Then we applied radon transformation to segmented images. The radon transform is not sensitive to the noise in the images due to its integral nature, so in comparison with other methods is more resistant to noise. This transform does not require the extraction of vein lines accurately, that can help to increase accuracy and speed. Then for extracting features from finger vein images, common spatial patterns are applied to the blocks of Radon Transform. In identification step two methods are used: Nearest Neighbor (1-NN) and Artificial Neural Network (MLP). Experiments conducted on sets of finger vein image database of Peking University show 99.6753 percent success rate in identifying individuals.
Manuscript profile
One of the challenges of high dimensional outlier detection problem is the curse of dimensionality which irrelevant dimensions (features) lead to hidden outliers. To solve this problem, some dimensions that contain valuable information to detect outliers are searched to More
One of the challenges of high dimensional outlier detection problem is the curse of dimensionality which irrelevant dimensions (features) lead to hidden outliers. To solve this problem, some dimensions that contain valuable information to detect outliers are searched to make outliers more prominent and detectable by mapping the dataset into the subspace which is constituted of these relevant dimensions/features. This paper proposes an outlier detection method in high dimensional data by introducing a new locally relevant subspace selection and developing a local density-based outlier scoring. First, we present a locally relevant subspace selection method based on local entropy to select a relevant subspace for each data point due to its neighbors. Then, each data point is scored in its relevant subspace using a density-based local outlier scoring method. Our adaptive-bandwidth kernel density estimation method eliminates the slight difference between the density of a normal data point and its neighbors. Thus, normal data are not wrongly detected as outliers. At the same time, our method underestimates the actual density of outlier data points to make them more prominent. The experimental results on several real datasets show that our local entropy-based subspace selection algorithm and the proposed outlier scoring can achieve a high accuracy detection rate for the outlier data.
Manuscript profile
