Connectivity-preserving parallel operators in 2D and 3D images

Richard W. Hall

doi:10.1117/12.142167

9 April 1993 Connectivity-preserving parallel operators in 2D and 3D images

Richard W. Hall

Proceedings Volume 1832, Vision Geometry; (1993) https://doi.org/10.1117/12.142167
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States

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.

Citation Download Citation

Richard W. Hall "Connectivity-preserving parallel operators in 2D and 3D images", Proc. SPIE 1832, Vision Geometry, (9 April 1993); https://doi.org/10.1117/12.142167

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