In this paper, we develop a simple Digital Elevation Models processing scheme that focuses on the improvement of urban high resolution DEM basic properties such as density, reliability, accuracy, capacity to render 3-D landscape shapes and breaks to improve 3D-building models production but also urban orthophoto production. Our basic single scale matching algorithm is based on a cross-correlati...

This paper describes the development of a Bayesian framework for multiple graph matching. The study is motivated by the plethora of multi-sensor fusion problems which can be abstracted as multiple graph matching tasks. The study uses as its starting point the Bayesian consistency measure recently developed by Wilson and Hancock. Hitherto, the consistency measure has been used exclusively in the...

      Many large oil and gas fields in the most productive world regions happen to be fractured. The exploration and development of these reservoirs is a true challenge for many operators. These difficulties are due to uncertainties in geological fracture properties such as aperture, length, connectivity and intensity distribution. To successfully address these challenges, it is paramount to im...

Mappings between complex metadata structures are needed in a number of domains such as data integration, ontology alignment or web service composition. A mapping describes how elements of one metadata structure correspond to elements of another metadata structure. Defining such mappings is a complex and time-consuming process. It is often done manually, with the help of point and click interfac...

Suppose we are given a multi-dimensional Itô process, which can be regarded as a model for an underlying asset price together with related stochastic processes, e.g., volatility. The drift and diffusion terms for this Itô process are permitted to be arbitrary adapted processes. We construct a weak solution to a diffusion-type equation that matches the distribution of the Itô process at each fix...

IoT sensors use the publish/subscribe model for communication to benefit from its decoupled nature with respect to space, time, and synchronization. Because of the heterogeneity of communicating parties, semantic decoupling is added as a fourth dimension. The added semantic decoupling complicates the matching process and reduces its efficiency. Our proposed algorithm clusters subscriptions and ...

Of the problem areas, the domain of matching complex objects has received, by far, the most attention. This research work is concerned with the specific class of complicated objects, i.e. logo. The progress, particularly in this field, is still at extensive research work level, due to infinite varieties of shapes and classes which are used. Essentially, the algorithm proposed is based on Princi...

Ontology matching is a complex and largely user-driven process of finding correspondences between entities belonging to different ontologies. Many algorithms have been proposed to automate the matching generation. However, they can’t be fully automated since the user input is required to accept, reject, or create new alignments or matchings. This paper extends on active learning framework for o...

Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance of such shape matching algorithms. Firstly, it is important that ligaturesensitive information be incorporated into the part decomposition and shape matching processes. Secondly, part decomposition should be treated as...

Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D → ∞ as N → ∞ and that co-degrees of pairs of vertices in H are at most L where L = o(D/ log N). We consider the random greedy algorithm for forming a matching in H. We choose a matching at random by iteratively choosing edges uniformly at random to be in the matching and deleting all e...