By Topic

Parallelization of perceptual grouping on distributed memory machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cho-Li Wang ; Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA ; V. K. Prasanna ; Young Won Lim

We propose architecture independent parallel algorithms for solving perceptual grouping tasks on distributed memory machines. Given an n×n image, using P processors, we show that these tasks can be performed in O(n2/P) computation time and 20√(P)Td +8(logP)Td+(40n/√(P)+20P)τd communication time, where Td is the communication startup time and τd is the transmission rate. Our implementations show that, given 7K line segments extracted from a 1K×1K image, the line grouping task can be performed in 1.115 seconds using a partition of CM-5 having 256 processing nodes and in 0.382 seconds using a 16 node Cray T3D. Our code is written in C and MPI message passing standard and can be easily ported to other high performance computing platforms

Published in:

Computer Architectures for Machine Perception, 1995. Proceedings. CAMP '95

Date of Conference:

18-20 Sep 1995