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 |
id |
ndltd-pdx.edu-oai-pdxscholar.library.pdx.edu-open_access_etds-4733 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-pdx.edu-oai-pdxscholar.library.pdx.edu-open_access_etds-47332019-10-20T04:51:11Z Parallel approximate string matching applied to occluded object recognition Smith, David 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 determines the amount of similarity. A classification algorithm is developed using the approximate string matching algorithm for the identification and classification of objects. A previously developed method of shape description is used for object representation. 1987-01-01T08:00:00Z text application/pdf https://pdxscholar.library.pdx.edu/open_access_etds/3724 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=4733&context=open_access_etds Dissertations and Theses PDXScholar Image processing -- Digital techniques Electrical and Computer Engineering |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
topic |
Image processing -- Digital techniques Electrical and Computer Engineering |
spellingShingle |
Image processing -- Digital techniques Electrical and Computer Engineering Smith, David Parallel approximate string matching applied to occluded object recognition |
description |
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 determines the amount of similarity. A classification algorithm is developed using the approximate string matching algorithm for the identification and classification of objects. A previously developed method of shape description is used for object representation. |
author |
Smith, David |
author_facet |
Smith, David |
author_sort |
Smith, David |
title |
Parallel approximate string matching applied to occluded object recognition |
title_short |
Parallel approximate string matching applied to occluded object recognition |
title_full |
Parallel approximate string matching applied to occluded object recognition |
title_fullStr |
Parallel approximate string matching applied to occluded object recognition |
title_full_unstemmed |
Parallel approximate string matching applied to occluded object recognition |
title_sort |
parallel approximate string matching applied to occluded object recognition |
publisher |
PDXScholar |
publishDate |
1987 |
url |
https://pdxscholar.library.pdx.edu/open_access_etds/3724 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=4733&context=open_access_etds |
work_keys_str_mv |
AT smithdavid parallelapproximatestringmatchingappliedtooccludedobjectrecognition |
_version_ |
1719271924591230976 |