Share Email Print

Proceedings Paper

Novel approach for image skeleton and distance transformation parallel algorithms
Author(s): Kent Pu Qing; Robert W. Means
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Image Understanding is more important in medical imaging than ever, particularly where real-time automatic inspection, screening and classification systems are installed. Skeleton and distance transformations are among the common operations that extract useful information from binary images and aid in Image Understanding. The distance transformation describes the objects in an image by labeling every pixel in each object with the distance to its nearest boundary. The skeleton algorithm starts from the distance transformation and finds the set of pixels that have a locally maximum label. The distance algorithm has to scan the entire image several times depending on the object width. For each pixel, the algorithm must access the neighboring pixels and find the maximum distance from the nearest boundary. It is a computational and memory access intensive procedure. In this paper, we propose a novel parallel approach to the distance transform and skeleton algorithms using the latest VLSI high- speed convolutional chips such as HNC's ViP. The algorithm speed is dependent on the object's width and takes (k + [(k-1)/3]) * 7 milliseconds for a 512 X 512 image with k being the maximum distance of the largest object. All objects in the image will be skeletonized at the same time in parallel.

Paper Details

Date Published: 11 May 1994
PDF: 6 pages
Proc. SPIE 2167, Medical Imaging 1994: Image Processing, (11 May 1994); doi: 10.1117/12.175111
Show Author Affiliations
Kent Pu Qing, HNC, Inc. (United States)
Robert W. Means, HNC, Inc. (United States)

Published in SPIE Proceedings Vol. 2167:
Medical Imaging 1994: Image Processing
Murray H. Loew, Editor(s)

© SPIE. Terms of Use
Back to Top