By Topic

Parallel algorithms for determining k-width- connectivity in binary images

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)
Dehne, F. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; Hambrusch, S.E.

The authors consider a new form of connectivity in binary images, called k-width-connectivity. Two pixels a and b of value `1' are in the same k-width-component if and only if there exists a path of width k such that a is one of the k start pixels and b is one of the k end pixels of this path. The authors present characterisations of the k-width-components and show how to determine the k-width-components of an n× n image in O(n) and O(log2 n) time on a mesh of processors and hypercube, respectively, when the image is stored with one pixel per processor. The methods use a reduction of the k-width-connectivity problem to the 1-width-connectivity problem. A distributed, space-efficient encoding of the k-width-components of small size allows the solution to be represented using O(l) registers per processor. The hypercube algorithm also implies an algorithm for the shuffle-exchange network

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990