Fingerprint Direct-Access Strategy Using Local-Star-Structure-based Discriminator Features: A Comparison Study

This paper describes a comparison study of the proposed fingerprint direct-access strategy using local-star-topology-based discriminator features, including internal comparison among different concerned configurations, and external comparison to the other strategies. Through careful minutiae-based feature extraction, hashing-based indexing-retrieval mechanism, variable-threshold-on-score-ratio-based candidate-list reduction technique, and hill-climbing learning process, this strategy was considered promising, as confirmed by the experiment results. For particular aspect of external accuracy comparison, this strategy outperformed the others over three public data sets, i.e. up to Penetration Rate (PR) 5%, it consistently gave lower Error Rate (ER). By taking sample at PR 5%, this strategy produced ER 4%, 10%, and 1% on FVC2000 DB2A, FVC2000 DB3A, and FVC2002 DB1A, respectively. Another perspective if accuracy performance was based on area under curve of graph ER and PR, this strategy neither is the best nor the worst strategy on FVC2000 DB2A and FVC2000 DB3A, while on FVC2002 DB1A it outperfomed the others and even it gave impressive results for index created by three impressions per finger (with or without NT) by ideal step down curve where PR equal to 1% can always be maintained for smaller ER.DOI:http://dx.doi.org/10.11591/ijece.v4i5.658

Comparative Study of Fingerprint Database Indexing Methods

International audienceNowadays, there are large country-sized fingerprint databases for identification purposes, for border access controls and also for Visa issuance procedures around the world. Fingerprint indexing techniques aim to speed up the research process in automatic fingerprint identification systems. Therefore, several preselection, classification and indexing techniques have been proposed in the literature. However, the proposed systems have been evaluated with different experimental protocols, that makes it difficult to assess their performances. The main objective of this paper is to provide a comparative study of fingerprint indexing methods using a common experimental protocol. Four fingerprint indexing methods, using naive, cascade, matcher and Minutiae Cylinder Code (MCC) approaches are evaluated on FVC databases from the Fingerprint Verification Competition (FVC) using the Cumulative Matches Curve (CMC) and for the first time using also the computing time required. Our study shows that MCC gives the best compromise between identification accuracy and computation time

Improving k-nn search and subspace clustering based on local intrinsic dimensionality

In several novel applications such as multimedia and recommender systems, data is often represented as object feature vectors in high-dimensional spaces. The high-dimensional data is always a challenge for state-of-the-art algorithms, because of the so-called curse of dimensionality . As the dimensionality increases, the discriminative ability of similarity measures diminishes to the point where many data analysis algorithms, such as similarity search and clustering, that depend on them lose their effectiveness. One way to handle this challenge is by selecting the most important features, which is essential for providing compact object representations as well as improving the overall search and clustering performance. Having compact feature vectors can further reduce the storage space and the computational complexity of search and learning tasks. Support-Weighted Intrinsic Dimensionality (support-weighted ID) is a new promising feature selection criterion that estimates the contribution of each feature to the overall intrinsic dimensionality. Support-weighted ID identifies relevant features locally for each object, and penalizes those features that have locally lower discriminative power as well as higher density. In fact, support-weighted ID measures the ability of each feature to locally discriminate between objects in the dataset. Based on support-weighted ID, this dissertation introduces three main research contributions: First, this dissertation proposes NNWID-Descent, a similarity graph construction method that utilizes the support-weighted ID criterion to identify and retain relevant features locally for each object and enhance the overall graph quality. Second, with the aim to improve the accuracy and performance of cluster analysis, this dissertation introduces k-LIDoids, a subspace clustering algorithm that extends the utility of support-weighted ID within a clustering framework in order to gradually select the subset of informative and important features per cluster. k-LIDoids is able to construct clusters together with finding a low dimensional subspace for each cluster. Finally, using the compact object and cluster representations from NNWID-Descent and k-LIDoids, this dissertation defines LID-Fingerprint, a new binary fingerprinting and multi-level indexing framework for the high-dimensional data. LID-Fingerprint can be used for hiding the information as a way of preventing passive adversaries as well as providing an efficient and secure similarity search and retrieval for the data stored on the cloud. When compared to other state-of-the-art algorithms, the good practical performance provides an evidence for the effectiveness of the proposed algorithms for the data in high-dimensional spaces

Identifying individuals from average quality fingerprint reference templates, when the best do not provide the best results !

International audienceThe fingerprint is one of the most used biometric modalities because of its persistence, uniqueness characteristics and ease of acquisition. Nowadays, there are large country-sized fingerprint databases for identification purposes, for border access controls and also for Visa issuance procedures around the world. The objective usually is to identify an input fingerprint among a large fingerprint database. In order to achieve this goal, different fingerprint pre-selection, classification or indexing techniques have been developed to speed up the research process to avoid comparison of the input fingerprint template against each fingerprint in the database. Although these methods are fairly accurate for identification process, we think that all of them assume the hypothesis to have a good quality of the fingerprint template for the first step of enrollment. In this paper, we show how the quality of reference templates can impact the performance of identification algorithms. We collect information and implement differents methods from the state of the art of fingerprint identification. Then, for these differents methods, we vary the quality of reference templates by using NFIQ2 metric quality. This allowed us to build a benchmark in order to evaluate the impact of these different enrollment scenarios on identification

From Frequency to Meaning: Vector Space Models of Semantics

Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics are beginning to address these limits. This paper surveys the use of VSMs for semantic processing of text. We organize the literature on VSMs according to the structure of the matrix in a VSM. There are currently three broad classes of VSMs, based on term-document, word-context, and pair-pattern matrices, yielding three classes of applications. We survey a broad range of applications in these three categories and we take a detailed look at a specific open source project in each category. Our goal in this survey is to show the breadth of applications of VSMs for semantics, to provide a new perspective on VSMs for those who are already familiar with the area, and to provide pointers into the literature for those who are less familiar with the field

Leveraging Metadata for Extracting Robust Multi-Variate Temporal Features

abstract: In recent years, there are increasing numbers of applications that use multi-variate time series data where multiple uni-variate time series coexist. However, there is a lack of systematic of multi-variate time series. This thesis focuses on (a) defining a simplified inter-related multi-variate time series (IMTS) model and (b) developing robust multi-variate temporal (RMT) feature extraction algorithm that can be used for locating, filtering, and describing salient features in multi-variate time series data sets. The proposed RMT feature can also be used for supporting multiple analysis tasks, such as visualization, segmentation, and searching / retrieving based on multi-variate time series similarities. Experiments confirm that the proposed feature extraction algorithm is highly efficient and effective in identifying robust multi-scale temporal features of multi-variate time series.Dissertation/ThesisM.S. Computer Science 201

Modeling Errors in Biometric Surveillance and De-duplication Systems

In biometrics-based surveillance and de-duplication applications, the system commonly determines if a given individual has been encountered before. In this dissertation, these applications are viewed as specific instances of a broader class of problems known as Anonymous Identification. Here, the system does not necessarily determine the identity of a person; rather, it merely establishes if the given input biometric data was encountered previously. This dissertation demonstrates that traditional biometric evaluation measures cannot adequately estimate the error rate of an anonymous identification system in general and a de-duplication system in particular. In this regard, the first contribution is the design of an error prediction model for an anonymous identification system. The model shows that the order in which individuals are encountered impacts the error rate of the system. The second contribution - in the context of an identification system in general - is an explanatory model that explains the relationship between the Receiver Operating Characteristic (ROC) curve and the Cumulative Match Characteristic (CMC) curve of a closed-set biometric system. The phenomenon of biometrics menagerie is used to explain the possibility of deducing multiple CMC curves from the same ROC curve. Consequently, it is shown that a good\u27\u27 verification system can be a poor\u27\u27 identification system and vice-versa.;Besides the aforementioned contributions, the dissertation also explores the use of gait as a biometric modality in surveillance systems operating in the thermal or shortwave infrared (SWIR) spectrum. In this regard, a new gait representation scheme known as Gait Curves is developed and evaluated on thermal and SWIR data. Finally, a clustering scheme is used to demonstrate that gait patterns can be clustered into multiple categories; further, specific physical traits related to gender and body area are observed to impact cluster generation.;In sum, the dissertation provides some new insights into modeling anonymous identification systems and gait patterns for biometrics-based surveillance systems