Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 381-385 |
Number of pages | 5 |
Journal | Computer Systems Science and Engineering |
Volume | 12 |
Issue number | 6 |
Publication status | Published - 1 Nov 1997 |
Externally published | Yes |
Keywords
- Distance transform
- Distributed system
- Hierarchical image matching
- Interesting points
- Message-passing
- Multiprocessors
- Parallel processing
- Workstation cluster
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- General Computer Science