This paper proposes a hierarchical multi-label matcher for patch-based face recognition. In signature generation, a face image is iteratively divided into multi-level patches. Two different types of patch divisions and signatures are introduced for 2D facial image and texture-lifted image, respectively. The matcher training consists of three steps. First, local classifiers are built to learn th...

Schema matching is the task of automatically computing correspondences between schema elements. A multitude of schema matching approaches exists for various scenarios using syntactic, semantic, or instance information. The schema matching problem is aggravated by the fact that models to be matched are often represented in different modeling languages, e.g. OWL, XML Schema, or SQL DDL. Consequen...

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...

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 YAM++ system is a self configuration, flexible and extensible ontology matching system. YAM++ takes advantages of many techniques coming from different fields such as machine learning, information retrieval, graph matching, etc. in order to enhance the matching quality. In this paper, we briefly present the YAM++ approach and its results on OAEI 2012 campaign. 1 Presentation of the system Y...

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...