Image matching based on image feature pixels involves heavily iterated computation and frequent memory access. The key to increase the speed is to employ parallelism on either parallel machines or workstation clusters. This paper presents the development of a parallel image matching system which uses a divide-and-conquer method to implement the proposed hierarchical matching scheme on a networked workstation cluster. Our investigation shows that a distributed workstation cluster can best meet the demand of high computation and memory access in image processing. The performance of our proposed matching scheme is evaluated in terms of execution time.
|Number of pages||8|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|Publication status||Published - 1 Dec 1995|
|Event||Proceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing - San Antonio, TX, United States|
Duration: 25 Oct 1995 → 28 Oct 1995
ASJC Scopus subject areas