With the web getting bigger and assimilating knowledge about different concepts and domains, it is becoming very difficult for simple database driven applications to capture the data for a domain. Thus developers have come out with ontology based systems which can store large amount of information and can apply reasoning and produce timely information. Thus facilitating effective knowledge mana...

Latent fingerprints are ubiquitously used as forensic evidence by law enforcement agencies in solving crimes. However, due to deformations and artifacts within latent fingerprint images, performance of the automated recognition systems far from desired levels. A basic matcher specifically designed for clean using a minutiae-based matching algorithm can have high speed accuracy sensor-to-sensor ...

Matching query interfaces is a critical step in data integration across multiple Web databases. The problem is closely related to schema matching that typically exploits different features of schemas. Relying on a particular feature of schemas is not sufficient. We propose an evidential approach to combining multiple matchers using Dempster-Shafer theory of evidence. First, our approach views t...

We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. The matching process is essentially divided into two steps: element level and structure level. Element level matchers consider only labels of nodes, while structure level matchers start from this information to consider the full graph. In this paper we present and ev...

Due to their high reliability, fingerprints have been extensively used as a biometric identifier. The performance of an automatic fingerprint authentication system relies heavily on the fingerprint image quality as seen in several studies. In this work, we present a new method to quantify fingerprint image quality which is relevant to matcher performance. The ultimate goal of this research is t...

We present a fingerprint matching scheme that utilizes a ridge feature map to match fingerprint images. The technique described here obviates the need for extracting minutiae points to match fingerprint images. The proposed scheme uses a set of 16 Gabor filters, whose spatial frequencies correspond to the average inter-ridge spacing in fingerprints, is used to capture the ridge strength at equa...

Hybrid fingerprint matchers are well known as a powerful tool for high security applications where the reliability of a single fingerprint characteristic is not high enough for the intended application. In this paper, we propose a novel method, which due to its compressibility can be applied in memory constrained environments. This is important for application in smart cards and independent ide...

Pattern matching is the method of searching a pattern in a text. There are several existing algorithms which successfully locate the presence of a pattern in a text. In particular, Bioinfomaticians often search for a Deoxy-Ribo Nucleic Acid (DNA) pattern in a very long DNA sequence. These algorithms search the entire text in order to locate the pattern. Genetic algorithms, on the other hand, de...

Duplicate identification is a critical step in deep web data integration, and generally, this task has to be performed over multiple web databases. However, a customized matcher for two web databases often does not work well for other two ones due to various presentations and different schemas. It is not practical to build and maintain matchers for n web databases. In this paper, we target at b...

While there have been some evaluations and surveys of these evaluations, the overall effectiveness of currently available automatic schema matching systems is largely unclear. This is mainly because either the evaluations were conducted in diverse ways making it difficult to assess the effectiveness of each single system, or they were based on previously published information rather than on act...