Division of Informatics
Forrest Hill & 80 South Bridge
Research Paper #647 | |
|---|---|
| Title: | Non-Wildcard Matching Beats the Interpretation Tree |
| Authors: | Fisher,RB |
| Date: | 1992 |
| Presented: | In the Proceedings 1992 British Machine Vision Conference, Leeds. |
| Keywords: | |
| Abstract: | Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when being applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation on this algorithm that has an improvement of about 4-10 in performance over the standard Interpretation Tree algorithm. |
| 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}