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 e...Show MoreMetadata
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/spl times/1,024 image, speed-ups of 27.6 and 56.0 on a 32-node SP2 and a 64-node T3D can be achieved.
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence ( Volume: 20, Issue: 12, December 1998)
DOI: 10.1109/34.735814
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Image Features ,
- Parallelization ,
- Image Feature Extraction ,
- Extraction Algorithm ,
- Parallel Algorithm ,
- Feature Extraction Algorithm ,
- Synchronization ,
- Visual Impairment ,
- Input Image ,
- Linear Approximation ,
- Line Segment ,
- Edge Detection ,
- Algorithm For Problem ,
- Open Windows ,
- Neighboring Pixels ,
- Landsat Images ,
- Boundary Line ,
- Multiple Streams ,
- Task Scheduling ,
- Message Passing Interface ,
- Parallel Machines ,
- Task Queue ,
- Multiple Data Streams
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Image Features ,
- Parallelization ,
- Image Feature Extraction ,
- Extraction Algorithm ,
- Parallel Algorithm ,
- Feature Extraction Algorithm ,
- Synchronization ,
- Visual Impairment ,
- Input Image ,
- Linear Approximation ,
- Line Segment ,
- Edge Detection ,
- Algorithm For Problem ,
- Open Windows ,
- Neighboring Pixels ,
- Landsat Images ,
- Boundary Line ,
- Multiple Streams ,
- Task Scheduling ,
- Message Passing Interface ,
- Parallel Machines ,
- Task Queue ,
- Multiple Data Streams