Share Email Print

Proceedings Paper

Optimal decomposition of arbitrary-shaped structuring elements into neighborhood subsets
Author(s): Xiaoyi Jiang; Horst Bunke
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 1 March 1992
PDF: 12 pages
Proc. SPIE 1708, Applications of Artificial Intelligence X: Machine Vision and Robotics, (1 March 1992); doi: 10.1117/12.58615
Show Author Affiliations
Xiaoyi Jiang, Univ. Bern (Switzerland)
Horst Bunke, Univ. Bern (Switzerland)

Published in SPIE Proceedings Vol. 1708:
Applications of Artificial Intelligence X: Machine Vision and Robotics
Kevin W. Bowyer, 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?