Share Email Print

Proceedings Paper

Connectivity-preserving parallel operators in 2D and 3D images
Author(s): Richard W. Hall
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Connectivity preservation is a concern in the design of parallel reduction processes for 2D and 3D image processing algorithms. Algorithm designers need efficient and available connectivity preservation tasks to prove algorithm correctness. Although efficient 2D tests are known, efficient 3D tests still need to be developed. We review earlier results for 2D connectivity preservation tests and demonstrate several 'design spaces' for classes of parallel reduction operators including subiteration and subfields approaches. We then extend certain 'path based' tests from the 2D to the 3D case and show efficient realizations for all but one test for fully parallel reduction operators. Very efficient tests are determined for 3D subfields reduction operators.

Paper Details

Date Published: 9 April 1993
PDF: 12 pages
Proc. SPIE 1832, Vision Geometry, (9 April 1993); doi: 10.1117/12.142167
Show Author Affiliations
Richard W. Hall, Univ. of Pittsburgh (United States)

Published in SPIE Proceedings Vol. 1832:
Vision Geometry
Robert A. Melter; Angela Y. Wu, 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?