6783224
Fingerprint Deformation Models Using Minutiae Locations and Orientations
Nonlinear deformations in fingerprint images, arising from the elasticity of the skin as well as the pressure and movement of the finger during image acquisition, lead to difficulties in establishing a match between multiple impressions acquired from the same finger. One solution to this problem is to estimate and remove the relative deformations prior to the matching stage. In this paper, these relative deformations are represented as an average deformation model based on minutiae locations and orientations using 2-D thin plate splines (TPS). The estimated average deformation is used to pre-distort a template prior to matching it with a query image in a verification task. Experimental results show that the use of minutiae locations and orientations to estimate the deformation leads to a more representative deformation model than using minutiae locations only. An index of deformation based on the bending energy is also proposed to select templates with the least variability in the deformations. The EER goes down by ap 1.1% when we incorporate minutiae orientation information and use the template selection strategy.
7693083
Pores and Ridges: Fingerprint Matching Using Level 3 Features
Fingerprint friction ridge details are generally described in a hierarchical order at three levels, namely, Level 1 (pattern), Level 2 (minutiae points) and Level 3 (pores and ridge shape). Although high resolution sensors (~1000 dpi) have become commercially available and have made it possible to reliably extract Level 3 features, most automated fingerprint identification systems (AFIS) employ only Level 1 and Level 2 features. As a result, increasing the scan resolution does not provide any matching performance improvement (1998). We develop a matcher that utilizes Level 3 features, including pores and ridge contours, for 1000 dpi fingerprint matching. Level 3 features are automatically extracted using wavelet transform and Gabor filters and are locally matched using the ICP algorithm. Our experiments on a median-sized database show that Level 3 features carry significant discriminatory information. EER values are reduced (relatively ~20%) when Level 3 features are employed in combination with Level 1 and 2 features
672758
Fingerprint Quality Indices for Predicting Authentication Performance
The performance of an automatic fingerprint authentication system relies heavily on the quality of the captured fingerprint images. In this paper, two new quality indices for fingerprint images are developed. The first index measures the energy concentration in the frequency domain as a global feature. The second index measures the spatial coherence in local regions. We present a novel framework for evaluating and comparing quality indices in terms of their capability of predicting the system performance at three different stages, namely, image enhancement, feature extraction and matching. Experimental results on the IBM-HURSLEY and FVC2002 DB3 databases demonstrate that the global index is better than the local index in the enhancement stage (correlation of 0.70 vs. 0.50) and comparative in the feature extraction stage (correlation of 0.70 vs. 0.71). Both quality indices are effective in predicting the matching performance, and by applying a quality-based weighting scheme in the matching algorithm, the overall matching performance can be improved; a decrease of 1.94% in EER is observed on the FVC2002 DB3 database.
2310959
XKvalidator: a constraint validator for XML
The role of XML in data exchange is evolving from one of merely conveying the structure of data to one that also conveys its semantics. In particular, several proposals for key and foreign key constraints have recently appeared, and aspects of these proposals have been adopted within XMLSchema.In this paper, we examine the problem of checking keys and foreign keys in XML documents using a validator based on SAX. The algorithm relies on an indexing technique based on the paths found in key definitions, and can be used for checking the correctness of an entire document (bulk checking) as well as for checking updates as they are made to the document (incremental checking). The asymptotic performance of the algorithm is linear in the size of the document or update. Furthermore, experimental results demonstrate reasonable performance.
205904713
Fuzzy aggregated connectedness for image segmentation
Fuzzy methodology has been successfully applied to image analysis and pattern recognition since the theory of fuzzy set was 0rst introduced by Zadeh [1]. It is believed that the fuzzy set theory models the inherent imprecision in images. Fuzzy geometrical approaches focus on the spatial measures and have attracted considerable research interest in handling the spatial uncertainty in images [2]. Fuzzy connectedness is an important topological property of images. The classical de0nition was given by Rosenfeld [3]. A modi0cation to the traditional concept of fuzzy connectedness was further proposed [4]. Based on the notion of fuzzy connectedness of image elements, fuzzy objects for n-dimensional digital spaces was exploited for image segmentation [5]. Fuzzy connectedness is a natural extension to the crisp connectedness and re:ects the imprecise topological structures of images. The algorithms in the literature usually compute the fuzzy connectedness with regard to the best path between a pair of points. This approach su;ers from high sensitivity to noise. Noise in corrupted images may misguide the detection of the best path and further in:uence the determination of fuzzy connectedness. We believe that this has mainly been due to the binarization in determining the best path. The information of a path is either fully preserved or discarded and this contradicts the concept of fuzzy sets. In this paper,
8852685
Generic Composition
Abstract. This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, different kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic composition and its weak inverse. A number of algebraic laws that support reasoning are derived.
14712495
One-class SVM for learning in image retrieval
Relevance feedback schemes using linear/quadratic estimators have been applied in content-based image retrieval to improve retrieval performance significantly. One major difficulty in relevance feedback is to estimate the support of target images in high dimensional feature space with a relatively small number of training samples. We develop a novel scheme based on one-class SVM, which fits a tight hyper-sphere in the nonlinearly transformed feature space to include most of the target images based on positive examples. The use of a kernel provides us an elegant way to deal with nonlinearity in the distribution of the target images, while the regularization term in SVM provides good generalization ability. To validate the efficacy of the proposed approach, we test it on both synthesized data and real-world images. Promising results are achieved in both cases.
12775848
Analyzing Inconsistency Toward Enhancing Integration of Biological Molecular Databases
The rapid growth of biological databases not only provides biologists with abundant data but also presents a big challenge in relation to the analysis of data. Many data analysis approaches such as data mining, information retrieval and machine learning have been used to extract frequent patterns from diverse biological databases. However, the discrepancies, due to the differences in the structure of databases and their terminologies, result in a significant lack of interoperability. Although ontology-based approaches have been used to integrate biological databases, the inconsistent analysis of biological databases has been greatly disregarded. This paper presents a method by which to measure the degree of inconsistency between biological databases. It not only presents a guideline for correct and efficient database integration, but also exposes high quality data for data mining and knowledge discovery.