Abstract
Image matching based on image feature pixels involves heavily iterated computation and repeated memory access. In our previous work the detection of interesting points has been reported as an efficient pre-processing step to extract binary images for further matching in terms of certain distance measurement. This paper presents our extension to a parallel implementation of the matching scheme for object recognition on a low cost heterogeneous PVM (Parallel virtual Machine) network. While most of the sequential execution time is spent on image feature extraction, distance transform and matching measurement, our investigation shows that a distributed memory multicomputer can best meet the high computational and memory access demands in image processing. The performance is evaluated in terms of execution time. We conclude that parallel image processing can be implemented on a general distributed system to achieve the speedup without specific hardware requirement.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Algorithms and Architectures for Parallel Processing |
| Publisher | IEEE |
| Pages | 870-873 |
| Number of pages | 4 |
| Publication status | Published - 1 Jan 1995 |
| Externally published | Yes |
| Event | Proceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2) - Brisbane, Australia Duration: 19 Apr 1995 → 21 Apr 1995 |
Conference
| Conference | Proceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2) |
|---|---|
| Country/Territory | Australia |
| City | Brisbane |
| Period | 19/04/95 → 21/04/95 |
ASJC Scopus subject areas
- General Computer Science
- General Engineering