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

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.<
>