Parallel approximate string matching applied to occluded object recognition
This thesis develops an algorithm for approximate string matching and applies it to the problem of partially occluded object recognition. The algorithm measures the similarity of differing strings by scanning for matching substrings between strings. The length and number of matching substrings deter...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
PDXScholar
1987
|
| Subjects: | |
| Online Access: | https://pdxscholar.library.pdx.edu/open_access_etds/3724 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=4733&context=open_access_etds |