Share Email Print

Proceedings Paper

Pyramid Linking Algorithms For Image Segmentation On The Connection Machine(Tm)
Author(s): B. P. Kjell; P. Y. Wang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We examine several image segmentation methods that are well-suited for implementation on SIMD computers. The pyramid segmentation algorithm of Burt, Hong, and Rosenfeld [1,2,3] was implemented two different1 ways on the Connection Machine System. Timing results and comparisons of the methods are presented. Another algorithm which makes better use of the data parallelism available on the CM is discussed. This algorithm was implemented on an ordinary serial machine and its performance is compared with the pyramid algorithm of Cibulskis and Dyer [4] and with optimum thresholding.

Paper Details

Date Published: 19 February 1988
PDF: 7 pages
Proc. SPIE 0848, Intelligent Robots and Computer Vision VI, (19 February 1988); doi: 10.1117/12.942741
Show Author Affiliations
B. P. Kjell, George Mason University (United States)
P. Y. Wang, George Mason University (United States)

Published in SPIE Proceedings Vol. 0848:
Intelligent Robots and Computer Vision VI
David P. Casasent; Ernest L. Hall, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?