In this paper an efficient and adaptive biometric sclera recognition and verification system is proposed. Sclera segmentation was performed by Fuzzy C-means clustering. Since the sclera vessels are not prominent, in o...
详细信息
In this paper an efficient and adaptive biometric sclera recognition and verification system is proposed. Sclera segmentation was performed by Fuzzy C-means clustering. Since the sclera vessels are not prominent, in order to make them clearly visible image enhancement was required. Adaptive histogram equalization, followed by a bank of Discrete Meyer Wavelet was used to enhance the sclera vessel patterns. Feature extraction was performed by, Dense Local Directional pattern (D-LDP). D-LDP patch descriptors of each training image are used to form a bag of features; further Spatial Pyramid Matching was used to produce the final training model. Support Vector Machines (SVMs) are used for classification. The UBIRIS version 1 dataset was used here for experimentation of the proposed system. To investigate regarding sclera patterns adaptively with respect to change in environmental condition, population, data accruing technique and time span two different session of the mention dataset are utilized. The images in two sessions are different in acquiring technique, representation, number of individual and they were captured in a gap of two weeks. An encouraging Equal Error Rate (EER) of 3.95% was achieved in the above mention investigation.
The Contextual Suggestion Problem focuses on search techniques for complex information needs that are highly dependent on context and user interest. In this paper, we present our approach to providing user and context...
Signature identification and verification are of great importance in authentication systems. The purpose of this paper is to introduce an experimental contribution in the direction of multi-script off-line signature i...
详细信息
Signature identification and verification are of great importance in authentication systems. The purpose of this paper is to introduce an experimental contribution in the direction of multi-script off-line signature identification and verification using a novel technique involving off-line English, Hindi (Devnagari) and Bangla (Bengali) signatures. In the first evaluation stage of the proposed signature verification technique, the performance of a multi-script off-line signature verification system, considering a joint dataset of English, Hindi and Bangla signatures, was investigated. In the second stage of experimentation, multi-script signatures were identified based on the script type, and subsequently the verification task was explored separately for English, Hindi and Bangla signatures based on the identified script result. The gradient and chain code features were employed, and Support Vector Machines (SVMs) along with the Modified Quadratic Discriminate Function (MQDF) were considered in this scheme. From the experimental results achieved, it is noted that the verification accuracy obtained in the second stage of experiments (where a signature script identification method was introduced) is better than the verification accuracy produced following the first stage of experiments. Experimental results indicated that an average error rate of 20.80% and 16.40% were obtained for two different types of verification experiments.
Existing linear projection based hashing methods have witnessed many progresses in finding the approximate nearest neighbor(s) of a given query. They perform well when using a short code. But their code length depends...
详细信息
ISBN:
(纸本)9781479952106
Existing linear projection based hashing methods have witnessed many progresses in finding the approximate nearest neighbor(s) of a given query. They perform well when using a short code. But their code length depends on the original data dimension, thus their performance can not be further improved with higher number of bits for low dimensional data. In addition, in the case of high dimensional data, it is not a good choice to produce each bit by a sign function. In this paper, we propose a novel random forest based approach to cope with the above shortcomings. The bits are obtained by recording the paths when a point traversing each tree in the forest. Then we propose a new metric to calculate the similarity between any two codes. Experimental results on two large benchmark datasets show that our approach outperforms its counterparts and demonstrate its superiority over the existing state-of-the-art hashing methods for descriptor retrieval.
Automatic vehicle Make and Model recognition (MMR) system offers a competent way to vehicle classification and recognition systems. This paper proposes a real time while robust vehicle make and model recognition syste...
详细信息
Automatic vehicle Make and Model recognition (MMR) system offers a competent way to vehicle classification and recognition systems. This paper proposes a real time while robust vehicle make and model recognition system extracting the vehicle sub-image from the background and studies some sparse feature coding methods such as Orthogonal Matching Pursuit (OMP), some variation of Sparse Coding (SC) methods and compares them to choose the best one. Our method employs the sparse feature coding methods on dense Scale-Invariant Feature Transform (SIFT) features and Support Vector Machine (SVM) for classification. The proposed system is examined by an Iranian on road vehicles dataset, which its samples are in different point of views, various weather conditions and illuminations.
In this paper we present how Bag-of-Features Hidden Markov Models can be applied to printed Bangla word spotting. These statistical models allow for an easy adaption to different problem domains. This is possible due ...
详细信息
Human action recognition is the process of labeling videos contain human motion with action classes. The run time complexity is one of the most important challenges in action recognition. In this paper, we address thi...
详细信息
Human action recognition is the process of labeling videos contain human motion with action classes. The run time complexity is one of the most important challenges in action recognition. In this paper, we address this problem using video abstraction techniques including key-frame extraction and video skimming. At first we extract key-frames and then skim the video clip by concatenating excerpts around the selected key-frames. This shorter sequence is used as input for classifier. Our proposed approach not only reduces the space complexity but also reduces the run time in both train and test steps. The experimental results provided on KTH action datasets show that the proposed method achieves good performance without losing considerable classification accuracy.
This paper proposes a new sclera vessel recognition technique. The vessel patterns of sclera are unique for each individual and this can be utilized to identify a person uniquely. In this research we have used a time ...
详细信息
Among all of the biometric authentication systems, handwritten signatures are considered as the most legally and socially accepted attributes for personal verification. The objective of this paper is to present an emp...
详细信息
Extraction and recognition of Bangla text from video frame images is challenging due to fonts type and style variation, complex color background, low-resolution, low contrast etc. In this paper, we propose an algorith...
详细信息
暂无评论