By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dinstein, Its'Hak ; Polytech. Univ., Brooklyn, NY, USA ; Landau, G.M.

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

Published in:

Pattern Recognition, 1990. Proceedings., 10th International Conference on  (Volume:ii )

Date of Conference:

16-21 Jun 1990