By Topic

RPCT algorithm and its VLSI implementation

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
$33 $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)
Y. Y. Tang ; Centre for Pattern Recognition & Machine Intelligence, Concordia Univ., Montreal, Que., Canada ; C. Y. Suen

This paper presents the regional projection contour transformation (RPCT) which transforms a compound pattern or multicontour pattern into a unique outer contour. Two RPCT's, (1) diagonal-diagonal regional projection contour transformation and (2) horizontal-vertical regional projection contour transformation, are presented. They are applicable to a wide range of areas such as image analysis, pattern recognition, etc. A very large scale integration (VLSI) architecture to implement the RPCT has also been designed based on a canonical methodology which maps homogeneous dependence graphs into processor arrays. In this paper, a linear array has been designed, where an N/2-element vector is used to process a pattern with a size of N×N. It can speed up the recognition process considerably with a time complexity of O(N) compared with O(N2) when a uniprocessor is used

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:24 ,  Issue: 1 )