1 July 2002 Well-shaped skeletons and fast computation of the (3,4) distance transform
Author Affiliations +
Abstract
In this paper we describe a time efficient approach for computing the (3,4) distance transform and a method of producing intuitively well-shaped nonsensitive skeletons. The need and usefulness of abstracting both skeletal and distance transform information have been demonstrated in various earlier work. However, the approach presented here is intended to overcome several weaknesses while possibly permitting real-time computation on low-cost single or multiprocessor systems for applications such as video processing. Specifically, an incremental improvement to Kwok’s thinning algorithm is presented which allows the distance transform to be computed during thinning using significantly fewer addition and comparison operations. Additionally, efficient techniques are given which then further process the resultant skeleton using the computed distance transform information as well as information gathered about the surrounding chain codes. These techniques efficiently remove various skeletal artifacts, leaving well-shaped graph representations annotated with distance transform values.
© (2002) Society of Photo-Optical Instrumentation Engineers (SPIE)
David A. Goldman, David A. Goldman, Nikolaos G. Bourbakis, Nikolaos G. Bourbakis, } "Well-shaped skeletons and fast computation of the (3,4) distance transform," Journal of Electronic Imaging 11(3), (1 July 2002). https://doi.org/10.1117/1.1479704 . Submission:
JOURNAL ARTICLE
10 PAGES


SHARE
RELATED CONTENT

Script determination in document images
Proceedings of SPIE (March 29 1995)
Variable Rate, Adaptive Transform Tree Coding Of Images
Proceedings of SPIE (October 24 1988)
Fast modular RLE-based inspection scheme for PCBs
Proceedings of SPIE (December 08 1997)
Combined Peano scan and VQ approach to image compression
Proceedings of SPIE (April 07 1993)

Back to Top