Parallel shrinking to residues with low worst case iteration counts

Richard W. Hall

doi:10.1117/12.279609

19 September 1997 Parallel shrinking to residues with low worst case iteration counts

Richard W. Hall

Proceedings Volume 3166, Parallel and Distributed Methods for Image Processing; (1997) https://doi.org/10.1117/12.279609
Event: Optical Science, Engineering and Instrumentation '97, 1997, San Diego, CA, United States

Abstract

The problem of shrinking the connected components of binary images to small residues is addressed. A new parallel algorithm is presented with the lowest known worst case time complexity as measured by iteration counts, i.e. [(n_c + n_r)/2] iterations where the foreground of the image is contained within a rectangular region of size n_c X n_r pixels. The new algorithm uses a parallel application of operators with small support. It reduces all connected components in any 2D binary image to certain small 1, 2 or 3 point residues. It is potentially useful as a fundamental step in connected component labeling algorithms implemented as fine grain realizations in 2D mesh computing architectures.

Citation Download Citation

Richard W. Hall "Parallel shrinking to residues with low worst case iteration counts", Proc. SPIE 3166, Parallel and Distributed Methods for Image Processing, (19 September 1997); https://doi.org/10.1117/12.279609

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available