Share Email Print

Proceedings Paper

New real-time parallel thinning algorithm using convolution approach
Author(s): Kent Pu Qing; Robert W. Means
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A new parallel thinning algorithm is proposed here that is based on a convolution approach. This algorithm works for both four neighbor and eight neighbor connectivity. This algorithm gives good results and requires very little computation time if we exploit a high speed convolutional processor such as HNC's Vision Processor (ViP). The algorithm executes in a parallel fashion using 3 X 3 convolutions. It checks all possible 512 patterns within the 3 X 3 windows in each pass where each pass takes less than 7 milliseconds with the ViP. To maintain original connectivity, we divide the 100 patterns into two large and four small groups that avoid possible conflict. The high speed (70 milliseconds for most 512 X 512 images with objects that have a 10 pixel width or less) is due to the parallelism in HNC's ViP chip and enables real time applications. Because this algorithm takes advantage of the current VLSI technology, it checks as many as 512 patterns at the same time using a lookup table and provides the best result.

Paper Details

Date Published: 23 March 1994
PDF: 8 pages
Proc. SPIE 2182, Image and Video Processing II, (23 March 1994);
Show Author Affiliations
Kent Pu Qing, HNC, Inc. (United States)
Robert W. Means, HNC, Inc. (United States)

Published in SPIE Proceedings Vol. 2182:
Image and Video Processing II
Sarah A. Rajala; Robert L. Stevenson, 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?