Share Email Print

Proceedings Paper

New method for chain coding based on convolution
Author(s): Kent Pu Qing; Robert W. Means
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Shape analysis and synthesis are important capabilities in many image processing applications such as scene analysis, computer-aided design, and cartoon generation. A very important aspect of shape analysis is proper representation of object boundaries. Chain coding is an efficient, often-used method of representing these boundaries. The conventional method to generate a chain code is: (1) find and select an object boundary pixel; (2) find the nearest edge pixel, code its orientation, and mark it as used once; (3) repeat step (2) until there are no more boundary pixels. This procedure is computationally expensive. The bottleneck of the process is determining the direction to the nearest edge pixel. In the worst case, six of the eight surrounding pixels must be checked for 8-neighbor connectivity. We present a new, fast method for determining the connectivity for each pixel in the entire image using a 3 X 3 convolution kernel that produces an oriented connectivity map for the entire image. The chain code is then generated by following the map. The significant advantage is the ability to exploit high-speed convolutional processors such as HNC's Vision Processor (ViP). Using the ViP, the necessary convolution can be accomplished in less than 7 milliseconds for a 512 X 512 image. The ViP also can perform most other image processing functions within 7 milliseconds. Here we introduce the chain code algorithm based on a convolution result.

Paper Details

Date Published: 1 December 1991
PDF: 7 pages
Proc. SPIE 1567, Applications of Digital Image Processing XIV, (1 December 1991); doi: 10.1117/12.50833
Show Author Affiliations
Kent Pu Qing, HNC, Inc. (United States)
Robert W. Means, HNC, Inc. (United States)

Published in SPIE Proceedings Vol. 1567:
Applications of Digital Image Processing XIV
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top