Massively parallel approach to pattern recognition

Document Type

Conference Proceeding

Publication Date

1-1-1990

Abstract

Template matching is concerned with measuring the similarity between patterns of two objects. A massively parallel approach to pattern recognition with a large template set is proposed. A class of image recognition problems inherently needs large template sets, for example, the recognition of Chinese characters, which needs thousands of templates. The proposed algorithm is based on the SIMD-SM-R machine or the SIMD machine with broadcasting abilities, which is the most popular parallel machine to date, and uses a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given image it scans the template pyramid searching for the match. Implementation of the proposed scheme is described.

Publication Source (Journal or Book title)

Conference Proceedings - Annual Phoenix Conference

First Page

61

Last Page

67

This document is currently not available here.

Share

COinS