Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets

Xiaoyi Jiang; Horst Bunke

doi:10.1117/12.58615

1 March 1992 Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets

Xiaoyi Jiang, Horst Bunke

Proceedings Volume 1708, Applications of Artificial Intelligence X: Machine Vision and Robotics; (1992) https://doi.org/10.1117/12.58615
Event: Aerospace Sensing, 1992, Orlando, FL, United States

Abstract

To efficiently perform morphological operations on neighborhood-processing-based parallel image computers, we need to decompose structuring elements larger than the neighborhood that can be directly handled into neighborhood subsets. In this paper we give an algorithm for the optimal decomposition of arbitrary-shaped structuring elements.

Citation Download Citation

Xiaoyi Jiang and Horst Bunke "Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets", Proc. SPIE 1708, Applications of Artificial Intelligence X: Machine Vision and Robotics, (1 March 1992); https://doi.org/10.1117/12.58615

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