Parallel image matching in a distributed system

Jia You, W. P. Zhu, E. Pissaloux, H. A. Cohen

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

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 languageEnglish
Title of host publicationIEEE International Conference on Algorithms and Architectures for Parallel Processing
PublisherIEEE
Pages870-873
Number of pages4
Publication statusPublished - 1 Jan 1995
Externally publishedYes
EventProceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2) - Brisbane, Australia
Duration: 19 Apr 199521 Apr 1995

Conference

ConferenceProceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2)
CountryAustralia
CityBrisbane
Period19/04/9521/04/95

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this