Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a massively parallel approach to pattern recognition with a large template set. A class of image recognition problems inherently needs large template sets, such as 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, using 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.

Massively Parallel Approach to Pattern Recognition.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．