Skip Navigation

The Computer Journal 1993 36(3):246-253; doi:10.1093/comjnl/36.3.246
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Horng, S. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Constant Time Algorithm for Template Matching on a Reconfigurable Array of Processors

S. J. Horng *

Department of Electrical Engineering, National Taiwan Institute of Technology, 43, Section 4, Kee-Lung Road, Taipei, Taiwan, China

A reconfigurable array of processors (RAP) is defined to be an array of processors connected to a reconfigurable bus system whose configurations can be dynamically changed. For an nxn image and mxmtemplate, a constant time algorithm for template matching is proposed on a RAP with mxmxnxnxn processors when the domain of the image and the template is Boolean. Even if the domain is integer and each integer is bounded and represented by a q-bits binary sequence, a constant or O(log* m) time algorithm is still obtained. The number of processors needed is increased to 2qm2x2qm2xmax {m,n}xnxn and m2xm2xmax {m2,n}xnxn, respectively. An O(log m) times algorithm also derived for the domain is integer or real but the number of processors is reduced to mxmxnxnxn.

Received August 1991. revised Feburary 1992.

* Department of Electrical Engineering, National Taiwan Institute of Technology, 43, Section 4, Kee-Lung Road, Taipei, Taiwan, ROC


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.