Research Paper #684
|
Title: | Performance Comparison of Ten Variations on the Interpretation-Tree Matching Algorithm
|
Authors: | Fisher,RB
|
Date: | Feb 1994
|
Presented: | For presentation at the 1994 Eur. Conference on Computer Vision, Stockholm, Sweden
|
Keywords: |
|
Abstract: | The best known algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines ten variations of this algorithm in a search for improved performance, and concludes that the non-wildcard and hierarchical algorithms have reduced theoretical complexity and run faster than the standard algorithm.
|
Download: | POSTSCRIPT COPY
|