Parallel computable contour based feature strings for 2-D shape recognition

Its'hak Dinstein, Gad M. Landau

Research output: Contribution to journalArticlepeer-review


This letter presents parallel computable contour based feature strings for two-dimensional shape recognition. Parallel techniques are used for contour extraction and for computation of normalized contour based features independent of scale and rotation. The EREW PRAM architecture is considered, but the technique can be adapted to other parallel architectures. Illustrated examples are presented.

Original languageEnglish
Pages (from-to)299-306
Number of pages8
JournalPattern Recognition Letters
Issue number5
StatePublished - May 1991
Externally publishedYes

Bibliographical note

Funding Information:
This work was supported in part by the New York State Science & Technology Foundation, Center for Advanced Technology in Telecommunications, Polytechnic University, Brooklyn, NY. * On leave from Ben-Gurion University, Beer Sheva, Israel. ** The research of this author was supported in part by NSF grant NSF-CCR-8908286.


  • Parallel processing
  • shape

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


Dive into the research topics of 'Parallel computable contour based feature strings for 2-D shape recognition'. Together they form a unique fingerprint.

Cite this