This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Structural Descriptions and Inexact Matching
May 1981 (vol. 3 no. 5)
pp. 504-519
Linda G. Shapiro, SENIOR MEMBER, IEEE, Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061.
Robert M. Haralick, SENIOR MEMBER, IEEE, Departments of Electrical Engineering and Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061.
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 with a forward checking algorithm. Finally, we present experimental results showing that forward checking is the most efficient of the algorithms tested.
Citation:
Linda G. Shapiro, Robert M. Haralick, "Structural Descriptions and Inexact Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 5, pp. 504-519, May 1981, doi:10.1109/TPAMI.1981.4767144
Usage of this product signifies your acceptance of the Terms of Use.