By Topic

A width-independent parallel thinning algorithm

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)
P. B. Gibbons ; AT&T Bell Labs., Murray Hill, NJ, USA ; W. Niblack

The paper presents the first parallel skeletonization algorithm whose running time is not dependent on the width of the objects in the image. The algorithm runs in O (log n) time on an EREW PRAM using n/log n processors; previous methods require Ω(√n) time

Published in:

Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,

Date of Conference:

30 Aug-3 Sep 1992