Tiling Strategies For Image Parallelism

M. Chen; T. Pavlidis; M. Noga

doi:10.1117/12.952686

29 March 1989 Tiling Strategies For Image Parallelism

M. Chen, T. Pavlidis, M. Noga

Proceedings Volume 1076, Image Understanding and the Man-Machine Interface II; (1989) https://doi.org/10.1117/12.952686
Event: OE/LASE '89, 1989, Los Angeles, CA, United States

Abstract

We discuss some basic problems encountered when we assemble the results of image analysis on architectures with coarse grain parallelism. Emphasis is placed on strategies that minimize distortions during the recombination of independently processed image tiles. A seaming algorithm is presented which merges the results of mean difference or max-min region based split-and-merge segmentations of individual tiles. Benchmarks obtained on a Sequent B/21 multiprocessor are given to illustrate the performance of the algorithm.

Citation Download Citation

M. Chen, T. Pavlidis, and M. Noga "Tiling Strategies For Image Parallelism", Proc. SPIE 1076, Image Understanding and the Man-Machine Interface II, (29 March 1989); https://doi.org/10.1117/12.952686

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