Image template matching on MIMD hypercube multicomputers
Journal Article
·
· Journal of Parallel and Distributed Computing; (USA)
- Minnesota Univ., Minneapolis, MN (USA). Dept. of Computer Science
Efficient algorithms for image template matching on fine grained as well as on medium grained MIMD hypercube multicomputers are developed. The medium grained MIMD algorithm is developed specifically for the NCUBE multicomputer. This algorithm is compared experimentally with an algorithm that is optimized for the Cray 2 supercomputer.
- OSTI ID:
- 6274553
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 10:1; ISSN 0743-7315; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient hypercube algorithms
Computing the Hough transform on an MIMD hypercube
Efficient parallel algorithms for image template matching on hypercube SIMD machines
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5923909
Computing the Hough transform on an MIMD hypercube
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5970445
Efficient parallel algorithms for image template matching on hypercube SIMD machines
Journal Article
·
Thu Jun 01 00:00:00 EDT 1989
· IEEE Transactions on Pattern Analysis and Machine Intelligence; (USA)
·
OSTI ID:5145247