Division of Informatics
Forrest Hill & 80 South Bridge
Research Paper #652 | |
|---|---|
| Title: | Hierarchical Matching Beets the Non-Wildcard and Interpretation Tree Model Matching Algorithms |
| Authors: | Fisher,RB |
| Date: | 1993 |
| Presented: | In the proceedings of the 1993 British Machine Vision Conference |
| Keywords: | |
| Abstract: | In Fisher [1] we introduce a non-wildcard model matching algorithm that has speed advantage over the standard Interpretation Tree model matching algorithm. This paper describes a hierarchical model-matching algorithm that has improved performance over both the standard and non-wildcard algorithms. |
| Download: | POSTSCRIPT COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}