PARALLEL ALGORITHM FOR TEMPLATE MATCHING OF IMAGE DIVISION BLOCK BASED ON LS MPP

Z.X. Fang, X. B. Li, L. M. Ni, Parallel algorithms for image template matching on hypercube SIMD computers, IEEE Trans. on PAMI., 1987, PAMI-9(6), 835-841.[2]V.K.P. Kumar, V. Krishnan, Efficient image template matching on hypercube SIMD arrays,Proc. Int. Conf. on Parallel Processing, 1987, 765-771 .[3]S.J. Horng, W. T. Chen, M. Y. Fang, Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessing with restricted local memory, Information Processing Letters,1991, 38(1), 29-37.[4]H.R. Tsai, S. J. Horng, et al., Optimal speed-up parallel image template matching algorithms on processor arrays with a reconfigurable bus system, Computer and Vision Image Understanding,1998, 71(3), 393 412.[5]沈绪榜,MPP嵌入式计算机设计,北京,清华大学出版社,1999,93-110[6]K. Huang, Advanced Computer Architecture Parallelism Scalability Programmability, New York City, McGraw-Hill Book Co., 1993, chapter 2.[7]Z. Fang, L. M. Ni, On the communication complexity of generalized 2-D convolution on array processors, IEEE Trans. oIa Comput., 1989, C-38(2), 184-193.[8]张大鹏,模式识别与图像处理并行计算机设计,哈尔滨,工业大学出版社,1998,1-8.