Using parallel string matching algorithms for contour based 2-D shape recognition

Its'hak Dinstein, Gad M. Landau

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

A parallel computation approach to two-dimensional shape recognition is proposed and illustrated. The approach uses parallel techniques for contour extraction, parallel computation of normalized contour-based feature strings independent of scale and orientation, and parallel string-matching algorithms. The string matching can be applied in a manner independent of rotation. An implementation on the exclusive read, exclusive write parallel random access memory (EREW PRAM) architecture is discussed, but it can be adapted to other parallel architectures. An illustrated example is presented.

Original languageEnglish
Pages (from-to)451-455
Number of pages5
JournalProceedings - International Conference on Pattern Recognition
Volume2
StatePublished - 1 Dec 1990
Externally publishedYes
EventProceedings of the 10th International Conference on Pattern Recognition - Atlantic City, NJ, USA
Duration: 16 Jun 199021 Jun 1990

Fingerprint

Dive into the research topics of 'Using parallel string matching algorithms for contour based 2-D shape recognition'. Together they form a unique fingerprint.

Cite this