By Topic

Constant-time parallel algorithms for image labeling on a reconfigurable network of processors

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

1 Author(s)
H. M. Alnuweiri ; Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada

A constant-time algorithm for labeling the connected components of an N×N image on a reconfigurable network of N3 processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N2+(1d/), for any 1⩽d⩽log N, if O(d) time is allowed

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:5 ,  Issue: 3 )