Pyramid Linking Algorithms For Image Segmentation On The Connection Machine(Tm)

B. P. Kjell; P. Y. Wang

doi:10.1117/12.942741

19 February 1988 Pyramid Linking Algorithms For Image Segmentation On The Connection Machine(Tm)

B. P. Kjell, P. Y. Wang

Proceedings Volume 0848, Intelligent Robots and Computer Vision VI; (1988) https://doi.org/10.1117/12.942741
Event: Advances in Intelligent Robotics Systems, 1987, Cambridge, CA, United States

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.

Citation Download Citation

B. P. Kjell and P. Y. Wang "Pyramid Linking Algorithms For Image Segmentation On The Connection Machine(Tm)", Proc. SPIE 0848, Intelligent Robots and Computer Vision VI, (19 February 1988); https://doi.org/10.1117/12.942741

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