Share Email Print
cover

Proceedings Paper

A Fast Algorithm For The Morphological Coding Of Binary Images
Author(s): Dan Schonfeld; John Goutsias
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper we investigate the computational performance of a number of morphological skeletons. We also develop the reduced-cardinality geometric-step morphological skeleton which is shown to achieve logarithmic computational complexity, compared to the linear computational complexity of the uniform-step morphological skeleton, when implemented on a large neighborhood pipelined morphological processor. Furthermore, an upper bound on the skeleton cardinality is derived.

Paper Details

Date Published: 25 October 1988
PDF: 8 pages
Proc. SPIE 1001, Visual Communications and Image Processing '88: Third in a Series, (25 October 1988); doi: 10.1117/12.968947
Show Author Affiliations
Dan Schonfeld, The Johns Hopkins University (United States)
John Goutsias, The Johns Hopkins University (United States)


Published in SPIE Proceedings Vol. 1001:
Visual Communications and Image Processing '88: Third in a Series
T. Russell Hsing, Editor(s)

© SPIE. Terms of Use
Back to Top