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. The implementation on the EREW PRAM architecture is discussed, but it can be adapted to other parallel architectures. Illustrated examples and experimental results are presented.
| Original language | English |
|---|---|
| Pages (from-to) | 929-942 |
| Number of pages | 14 |
| Journal | Pattern Recognition |
| Volume | 24 |
| Issue number | 10 |
| DOIs | |
| State | Published - 1 Jan 1991 |
| Externally published | Yes |
Keywords
- Computer vision
- Parallel algorithms
- Shape recognition
- String matching
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence
Fingerprint
Dive into the research topics of 'Parallel (pram erew) algorithms for contour-based 2D shape recognition'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver