Current algorithms cannot be used optimally in (semi)automatic ontology matching tasks as envisioned by the Semantic Web community, mainly because of the inherent dependency between algorithms and ontology properties. As one possible solution we suggest a metadata-based ontology matching framework that takes into account the difficulties of current matching algorithms. It uses additional data c...

3D city modelling from airborne imagery includes mainly two parts: (1) image processing procedures and (2) 3D modelling for manmade objects such as buildings, roads and other objects. Line extraction and stereo matching are usually utilized as an image processing procedures. However, there are some issues for automatic man-made object modelling. In particular, spatial data acquisition of buildi...

In this paper we discuss the importance of scene registration for several tasks in the automated interpretation of aerial imagery. These tasks are structure matching, stereo matching, and stereo visualization. While the processes of registration and matching have traditionally been treated as separate problems, particularly in the case of stereo matching, we describe techniques that may unify t...

With the increasing emphasis on the automatic personal identification applications, biometrics especially fingerprint identification is the most reliable and widely accepted technique. In this paper Fingerprint Verification based on fusion of Minutiae and Ridges using Strength Factors (FVMRSF) is presented. In the preprocessing stage the Fingerprint is Binarised and Thinned. The Minutiae Matchi...

An important step in automatic reassembly of 2D fragments is to find candidate matching pairs for adjacent fragments. In this paper, we propose a new partial curve matching method to find the candidate matches. In this method, the fragment contours are represented by their turning functions. The matching segments between two fragment contours are found by analyzing the difference curve between ...

Abstract – A new strategy of reaching efficient matched conditions at the maximum speed in RF power delivery systems for plasma processes is proposed and analyzed. Presented method incorporates unique properties of high speed, automatic discrete matching networks, allowing creation of shortest trajectories and bypassing inhibited states of network parameters. The special matching network model ...

We propose an automatic image-to-image registration of high-resolution satellite images using local properties and geometrical locations of matching points to improve the registration accuracy. First, coefficients of global affine transformation between images are extracted using a scale-invariant feature transform (SIFT)-based method, and features of the sensed image are transformed to the ref...

Ontologymatching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However, in many real-world applications, finding the alignment in a completely automatic way is highly infeasible. Ideally, an ontology matching system would have an interactive interface to allow users to provide feedbacks t...

Theories of visual attention suggest that working memory representations automatically guide attention toward memory-matching objects. Some empirical tests of this prediction have produced results consistent with working memory automatically guiding attention. However, others have shown that individuals can strategically control whether working memory representations guide visual attention. Pre...

The problem of schema or ontology matching is to define mappings among schema or ontology elements. Such mappings are typically defined between two schemas or two ontologies at a time. Ideally, using the defined mappings, one would be able to issue a single query that will be rewritten automatically to all the databases, instead of manually writing a query to each database. In a centrally media...