一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級(jí)搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號(hào)碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

基于LS MPP的圖像分塊模板匹配并行算法

李俊山,  沈緒榜

李俊山, 沈緒榜. 基于LS MPP的圖像分塊模板匹配并行算法[J]. 電子與信息學(xué)報(bào), 2001, 23(9): 868-874.
引用本文: 李俊山, 沈緒榜. 基于LS MPP的圖像分塊模板匹配并行算法[J]. 電子與信息學(xué)報(bào), 2001, 23(9): 868-874.
Li Junshan, Shen Xubang. PARALLEL ALGORITHM FOR TEMPLATE MATCHING OF IMAGE DIVISION BLOCK BASED ON LS MPP[J]. Journal of Electronics & Information Technology, 2001, 23(9): 868-874.
Citation: Li Junshan, Shen Xubang. PARALLEL ALGORITHM FOR TEMPLATE MATCHING OF IMAGE DIVISION BLOCK BASED ON LS MPP[J]. Journal of Electronics & Information Technology, 2001, 23(9): 868-874.

基于LS MPP的圖像分塊模板匹配并行算法

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

  • 摘要: 該文提出了一種新穎的在基于K元2-立方體網(wǎng)絡(luò)的SIMD計(jì)算機(jī)上運(yùn)行的圖像分塊模板匹配并行算法。該算法對(duì)于NN的圖像、MM的模板和KK的處理元陣列(M K, N = BK, B 1), 可通過將圖像分成BB個(gè)圖像塊的分塊模板匹配來實(shí)現(xiàn)。與已知的各算法相比,該算法具有可處理比處理元陣列尺寸大的圖像的優(yōu)越性。
    Abstract: This paper proposes a novel parallel algorithm for template matching of image division block based on a K-ary 2-cube network SIMD computer. For the template matching on an N by N image, M by M template and K by K processing unit array (M K, N = BK, B 1), the algorithm is able to realize template matching by dividing an image into blocks. Compared with known algorithms, the algorithm is able to process an image whose size is larger than that of the processing unit.
    • HTML全文
  • 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嵌入式計(jì)算機(jī)設(shè)計(jì),北京,清華大學(xué)出版社,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]張大鵬,模式識(shí)別與圖像處理并行計(jì)算機(jī)設(shè)計(jì),哈爾濱,工業(yè)大學(xué)出版社,1998,1-8.
  • 加載中
計(jì)量
  • 文章訪問數(shù):  2346
  • HTML全文瀏覽量:  127
  • PDF下載量:  1080
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2000-06-20
  • 修回日期:  2000-12-07
  • 刊出日期:  2001-09-19

目錄

    /

    返回文章
    返回