Ontologies are a useful model to express semantics in a machinereadable way. A matching of heterogeneous ontologies is often required for many different applications like query answering or ontology integration. Many systems coping with the matching problem have been developed in the past, most of them using meta information like concept names as a basis for their calculations. This approach wo...

In this paper we propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals, which is a similar data structure as in Fox (2010). Our estimator is based on stability conditions in the matching models; we consider both transferable (TU) and non-transferable utility (NTU) models. In b...

scribble matching, handwriting recognition, pattern recognition Scribble matching is a form of partial handwriting recognition that allows like scribbles to be identified. Three complimentary matching algorithms have been developed that provide in combination a matching rate of 97%. In this paper, we describe the scribble matching problem and the matching algorithms, report experimental results...

A novel method for global rigid matching of partialview images is presented in the paper. The method utilizes a genetic algorithm (GA) to search the transformation parameter space and a distance transform (DT) to compute a goodness-ofmatch measure. The problem of partial image registration has been solved by tresholding the transformed images around the edge and in this way emphasizing matching...

We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b′ of a target time series b that best matches a query series a. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a DAG (directed acyclic graph). Our experimental results demonstrate that the proposed algo...

Partial matching is a fundamental problem in shape analysis, a field that is recently gaining an increasing importance in computer graphics. This paper proposes a novel approach to performing partial matching of surfaces. Given two surfaces MA and MB, our goal is to find the best match to MA within MB. The key idea of our approach is to integrate feature-point similarity and segment similarity....

Each hue is believed to be made up of the four component hues (yellow, blue, red, and green). A hue consisting of just one component hue is called unitary (or unique). A new technique--partial hue-matching--has been used to reveal the component and unitary hues for a sample of 32 Munsell papers, which were illuminated by neutral, yellow, blue, green, and red lights and assessed by four normal t...

We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach allows us to compute the optimal scal...

In this paper, a methodology for 3D object partial matching and retrieval based on range image queries is presented. The proposed methodology addresses the retrieval of complete 3D objects based on artificially created range image queries which represent partial views. The core methodology relies upon Dense SIFT descriptors computed on panoramic views. Performance evaluation builds upon the sta...

The ability to perform not only global matching but also partial matching is investigated in computer vision and computer graphics in order to evaluate the performance of shape descriptors. In my talk I will consider the persistent homology shape descriptor, and I will illustrate some results about persistence diagrams of occluded shapes and partial shapes. The main tool is a Mayer-Vietoris for...