Parallelizing image feature extraction on coarse-grain machines
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20 (12) , 1389-1394
- https://doi.org/10.1109/34.735814
Abstract
In this paper, we present a fast parallel algorithm for feature extraction on coarse-grain MIMD machines. By maintaining algorithmic threads at each node, our algorithm enhances processor utilization and obtains large speed-ups. Our implementations show that, given a 1,024×1,024 image, speed-ups of 27.6 and 56.0 on a 32-node SP2 and a 64-node T3D can be achievedKeywords
This publication has 9 references indexed in Scilit:
- A fast asynchronous algorithm for linear feature extraction on IBM SP-2Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel Algorithms for Perceptual Grouping on Distributed Memory MachinesJournal of Parallel and Distributed Computing, 1998
- A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection MachineJournal of Parallel and Distributed Computing, 1994
- Connected Component Labeling on Coarse Grain Parallel Computers: An Experimental StudyJournal of Parallel and Distributed Computing, 1994
- List scheduling with and without communication delaysParallel Computing, 1993
- Load balancing requirements in parallel implementations of image feature extraction tasksIEEE Transactions on Parallel and Distributed Systems, 1993
- A Computational Approach to Edge DetectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A data reduction algorithm for planar curvesComputer Vision, Graphics, and Image Processing, 1985
- Linear feature extraction and descriptionComputer Graphics and Image Processing, 1980