Share Email Print

Proceedings Paper

Time Complexity For Serial And Parallel Propagation In Images.
Author(s): P. E. Danielsson; S. Tanimoto
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

Several useful algorithms in image processing involve the spreading of a certain pixel state over large areas and distances. Very often this is a kind of growth from a "seed" conditioned by a binary mask image so that the final states of labels form connected regions. This labeling operation may well be considered to be the archetype of the propagating operations we have in mind but there are several others, e.g. distance mapping in a plane with obstacles.1,2.

Paper Details

Date Published: 9 January 1984
PDF: 10 pages
Proc. SPIE 0435, Architectures and Algorithms for Digital Image Processing, (9 January 1984); doi: 10.1117/12.936970
Show Author Affiliations
P. E. Danielsson, Linkoping University (Sweden)
S. Tanimoto, Linkoping University (Sweden)

Published in SPIE Proceedings Vol. 0435:
Architectures and Algorithms for Digital Image Processing
Per-Erik Danielsson; Andre J. Oosterlinck, Editor(s)

© SPIE. Terms of Use
Back to Top