STRUCTURAL DESCRIPTIONS AND INEXACT MATCHING

Shapiro, Linda G. and Haralick, Robert M. (1979) STRUCTURAL DESCRIPTIONS AND INEXACT MATCHING. Technical Report CS79011-R, Computer Science, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
CS79011-R.pdf (2657731)

Abstract

In this paper we formally define the structural description of an object and the concepts of exact and inexact matching of two structural descriptions. We discuss the problems associated with a brute-force backtracking tree search for inexact matching and develop several different algorithms to make the tree search more efficient. We develop the formula for the expected number of nodes in the tree for backtracking alone and vith a forward checking algorithm. Finally we present experimental results verifying the theory and showing that forward checking is the most efficient of the algorithms tested.

Item Type:	Departmental Technical Report
Keywords:	structural description, matching, inexact matching, relational homorphism, tree search, backtracking, forward checking, lookahead, relaxation
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	843
Deposited By:	Administrator, Eprints
Deposited On:	05 May 2006