Share Email Print

Proceedings Paper

Parallel shrinking to residues with low worst case iteration counts
Author(s): Richard W. Hall
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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. [(nc + nr)/2] iterations where the foreground of the image is contained within a rectangular region of size nc X nr 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.

Paper Details

Date Published: 19 September 1997
PDF: 14 pages
Proc. SPIE 3166, Parallel and Distributed Methods for Image Processing, (19 September 1997); doi: 10.1117/12.279609
Show Author Affiliations
Richard W. Hall, Univ. of Pittsburgh (United States)

Published in SPIE Proceedings Vol. 3166:
Parallel and Distributed Methods for Image Processing
Hongchi Shi; Patrick C. Coffield, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?