In this paper, we deal with the problem of how to apply the Hough Transform to the Stereo & Motion matching process . The purpose here is two-fold: The first objective is to see how the Hough Transform can improve the robustness of a matching process . The second goal is to see whether it is possible to relax any local constraints used by the matching process . In such a way, a general matching...

The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes on matchings is reviewed. New conjectures concerning nest distribution functions are presented as well as a bijection between certain classes of alternating sign matrices and lozenge tilings of hexagons with cut off corners.

The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes onmatchings is reviewed.New conjectures concerning nest distribution functions are presented as well as a bijection between certain classes of alternating sign matrices and lozenge tilings of hexagons with cut off corners. © 2005 Elsevier B.V. All rights reserved.

In this paper, we present a dense matching algorithm which utilizes the corner and edge features of images to increase the reliability and to speed up the process of dense matching of two uncalibrated images. The major problem of classical area-based dense matching algorithms is the high computational time resulting from intensive correlation calculations for match candidates. Although some met...

The appearance of numbers enumerating alternating sign matrices in stationary states of certain stochastic processes on matchings is reviewed. New conjectures concerning nest distribution functions are presented as well as a bijection between certain classes of alternating sign matrices and lozenge tilings of hexagons with cut off corners.

This paper proposes an automatic and fast algorithm for registering aerial image sequences to vector map data using linear features as control information. Our method is based on the extraction of linear features using active contour models (also known as, snakes), followed by the construction of a polygonal template upon which a matching process is applied. To accommodate more robust matching,...

It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms. An algebraic framework for schema matching is developed in this paper. First, based on universal algebra, we propose a meta-meta structure for schema, which is named multi-labeled schema. This definition has a distin...

Many computer vision applications require computing structure and feature correspondence across a large, unorganized image collection. This is a computationally expensive process, because the graph of matching image pairs is unknown in advance, and so methods for quickly and accurately predicting which of the O(n) pairs of images match are critical. Image comparison methods such as bag-of-words...

This paper examines the effects of education on intermarriage, and specifically whether the mechanisms through which education affects intermarriage differ by immigrant generation, age at arrival, and race. We consider three main paths through which education affects marriage choice. First, educated people may be better able to adapt to different cultures making them more likely to marry outsid...

In this paper we present the ontology matching system LogMap 2, a much improved version of its predecessor LogMap. LogMap 2 supports user interaction during the matching process, which is essential for use cases requiring very accurate mappings. Interactivity, however, imposes very strict scalability requirements; we are able to satisfy these requirements by providing real-time user response ev...