منابع مشابه
Relational Matching by Discrete Relaxation
This paper describes a symbolic approach to relational matching. The novelty of the method lies in its Bayesian modelling of relational consistency through the use of an explicit constraint corruption process. Unlike many alternatives in the literature, the method is not limited to the use of binary constraints; it can accommodate N-ary relations of varying order. In consequence of this assumed...
متن کاملStructural Matching by Discrete Relaxation
This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we focus on the issue of how relational inexactness may be quantified. We illustra...
متن کاملSoftening Discrete Relaxation
This paper describes a new framework for relational graph matching. The starting point is a recently reported Bayesian consistency measure which gauges structural differences using Hamming distance. The main contributions of the work are threefold. Firstly, we demonstrate how the discrete components of the cost function can be softened. The second contribution is to show how the softened cost f...
متن کاملGraph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt for this study is provided by iterative discrete relaxation. Here the aim is to assign the discrete matches so as to optimise a global cost function that draws information concerning the consistency of match from dieren...
متن کاملTemporal Matching: Recognizing Dynamic Situations from Discrete Measurements
The converse problem of measurement interpretation is event recognition. In situations which are characterized by a specific order of events, a single snapshot is not sufficient to recognize an event. Instead one has to plan a measurement sequence that consists of observations at more than one time point. In this paper we present an algorithm for planning such an observation sequence based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1997
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.117.12_1887