9 January 1984 Time Complexity For Serial And Parallel Propagation In Images.
Author Affiliations +
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.
© (1984) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
P. E. Danielsson, P. E. Danielsson, S. Tanimoto, S. Tanimoto, } "Time Complexity For Serial And Parallel Propagation In Images.", Proc. SPIE 0435, Architectures and Algorithms for Digital Image Processing, (9 January 1984); doi: 10.1117/12.936970; https://doi.org/10.1117/12.936970
PROCEEDINGS
10 PAGES


SHARE
Back to Top