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.
No takes yet. Share an insight, caveat, or question.
Schonfeld et al. (1988) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: