In this paper we investigate the use of facial skin mark information for biometric person verification. We performed statistical analysis of the facial skin mark information. The position, size and color intensity of the skin marks are considered as features for skin mark based face matching. Developed facial skin mark matcher has good performance, but can not be applied to faces with no detect...

Ontology matching produces correspondences between entities of two ontologies. The OMReasoner is unique in that it creates an extensible framework for combination of multiple individual matchers, and reasons about ontology matching by using description logic reasoner. It handles ontology matching in semantic level and makes full use of the semantic part of OWL-DL instead of structure. This pape...

Falcon-AO is an automatic tool for aligning ontologies. There are two matchers integrated in Falcon-AO: one is a matcher based on linguistic matching for ontologies, called LMO; the other is a matcher based on graph matching for ontologies, called GMO. In Falcon-AO, GMO takes the alignments generated by LMO as external input and outputs additional alignments. Reliable alignments are gained thro...

Latent fingerprint has the practical value to identify the suspects who have unintentionally left a trace of fingerprint in the crime scenes. However, designing a fully automated latent fingerprint matcher is a very challenging task as it needs to address many challenging issues including the separation of overlapping structured patterns over the partial and poor quality latent fingerprint imag...

The utilization of biometric products is an expanding landscape; from general consumers employing it for authenticating into their devices to governments deploying at the forefront crime and border control. One sizeable organization required expansion in offering within industryThis study aims develop a facial matching solution that offers high performance meets requirements organization’s Subj...

Matching Pennies is a well-known example of a two player, zero-sum game. In this game, each of the players, the matcher and the mismatcher, flips a coin, and the payoffs are determined as follows. If the coins come up matching (i.e., both heads or both tails), then the matcher wins, so the mismatcher pays the matcher the sum of $1. If the coins do not match (i.e., one head and one tail), then t...

In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correct proof of the relationship between subsumption and the existence of cliques in a total matcher graph. Next, we introduce the concept of width of a clique in a total matcher graph. As a corollary of the above relations...

This paper describes the design of a pattern matcher for a knowledge representation system called LOOM. The pattern matcher has a very rich pattern-forming language, and is logic-based, with a deductive mechanism which includes a truth-maintenance component as an integral part of the pattern-matching logic. The technology behind the LOOM matcher uses an inference engine called a classiier to pe...

HotMatch is a multi-strategy matcher developed by a group of students at Technische Universität Darmstadt in the course of a hands-on training. It implements various matching strategies. The tool version submitted to OAEI 2012 combines different basic matching strategies, both element-based and structure-based, and a set of filters for removing faulty mappings. 1 Presentation of the system 1.1 ...