Execution speed comparisons for binary morphology

Frederick M. Waltz; John W. V. Miller

doi:10.1117/12.360258

27 August 1999 Execution speed comparisons for binary morphology

Proceedings Volume 3836, Machine Vision Systems for Inspection and Metrology VIII; (1999) https://doi.org/10.1117/12.360258
Event: Photonics East '99, 1999, Boston, MA, United States

Abstract

The SKIPSM paradigm gives very fast execution of binary morphology operations with large arbitrary SEs. Hardware- based applications using lookup tables to implement the FSMs have been in use for almost a decade. More recently, software-based applications have benefited form comparable speed increases. This paper provides speed comparisons between software implementations using lookup tables and those using direct implementations of the FSMs, for a range of SE sizes and shapes.

Citation Download Citation

Frederick M. Waltz and John W. V. Miller "Execution speed comparisons for binary morphology", Proc. SPIE 3836, Machine Vision Systems for Inspection and Metrology VIII, (27 August 1999); https://doi.org/10.1117/12.360258

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