Time Complexity For Serial And Parallel Propagation In Images.

P. E. Danielsson; S. Tanimoto

doi:10.1117/12.936970

9 January 1984 Time Complexity For Serial And Parallel Propagation In Images.

P. E. Danielsson, S. Tanimoto

Proceedings Volume 0435, Architectures and Algorithms for Digital Image Processing; (1984) https://doi.org/10.1117/12.936970
Event: 27th Annual Technical Symposium, 1983, San Diego, United States

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.

Citation Download Citation

P. E. Danielsson and S. Tanimoto "Time Complexity For Serial And Parallel Propagation In Images.", Proc. SPIE 0435, Architectures and Algorithms for Digital Image Processing, (9 January 1984); https://doi.org/10.1117/12.936970

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available