Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines
暂无分享,去创建一个
Efficient parallel algorithms developed on hypercube SIMD (single-instruction multiple data-stream) machines for image template matching are presented. Most of these parallel algorithms are asymptotically optimal in their time complexities. These results improve the known bounds in the literature. >
[1] Viktor K. Prasanna,et al. Efficient Image Template Matching on Hypercube SIMD Arrays , 1987, International Conference on Parallel Processing.
[2] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .
[3] Xiaobo Li,et al. Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.