Traditional image matching approaches often fail in processing Mars Global Surveyor stereo images because of low contrast and insufficient number of features. Reliable and precision matching tool is needed for precise Mars digital elevation model generation. This paper presents a hierarchical image matching approach. First, a number of well identified points are manually measured in a stereo pa...

Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics), originally to help discard unimportant aspects of large concepts appearing in industrial-strength knowledge bases. This paper proposes a new approach to performing matching, based on a \concept-centered" normal form, ...

Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics), originally to help discard unimportant aspects of large concepts appearing in industrial-strength knowledge bases. This paper proposes a new approach to performing matching, based on a \concept-centered" normal form, ...

The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted matching in a bipartite graph is equivalent to recognition a acyclic digraph. Based on these results, it proves that determine the bipartite graphs with all maxim...

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

This paper handles the aspect of metric information extraction from SPOT images and focuses mainly on sensor modelling and the geometric accuracy potential of polynomial mapping functions, and secondly on the use of these functions for automated derivation of DTMs and generation of digital orthophotos. The sensor modelling is based on V. Kratky’s strict geometrical model. First, an accuracy ana...

The weighted matroid parity problems for the matching matroid and gammoids are among the very few cases for which the weighted matroid parity problem is polynomial time solvable. In this work we extend these problems to a general revenue function for each pair, and show that the resulting problem is still solvable in polynomial time via a standard weighted matching algorithm. We show that in ma...

A natural way to deal with multiple, partially conflicting objectives is turning all the objectives but one into budget constraints. Some classical polynomial-time optimization problems, such as spanning tree and forest, shortest path, (perfect) matching, independent set (basis) in a matroid or in the intersection of two matroids, become NP-hard even with one budget constraint. Still, for most ...

Matching concepts against patterns (concepts with variables) is a relatively new operation that has been introduced in the context of concept description languages (description logics). The original goal was to help filter out unimportant aspects of complicated concepts appearing in large industrial knowledge bases. We propose a new approach to performing matching, based on a ‘concept-centred’ ...

Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one...