• DocumentCode
    430983
  • Title

    A cost optimal parallel algorithm for histogram image matching

  • Author

    Arya, K.V. ; Gupta, P. ; Kalra, Pren K.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India
  • Volume
    B
  • fYear
    2004
  • fDate
    21-24 Nov. 2004
  • Firstpage
    116
  • Abstract
    This paper presents a parallel algorithm for histogram image template matching using an SIMD array processor with a hypercube interconnection network. For an N×N image and M×M template window, the time complexity is shown to be reduced to O(M+log2M+logN) as compared to O(N2M2) for the sequential algorithm, for the N2 processing element (PE) multiprocessor systems. Each PE requires only a small local memory. The algorithm is shown to be cost optimal with total cost of computation is O(N2M+N2log2M+N2logN).
  • Keywords
    hypercube networks; image matching; multiprocessing systems; parallel algorithms; SIMD array processor; histogram image template matching; hypercube interconnection network; local memory; parallel algorithm; processing element multiprocessor system; sequential algorithm; Cost function; Histograms; Image matching; Parallel algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2004. 2004 IEEE Region 10 Conference
  • Print_ISBN
    0-7803-8560-8
  • Type

    conf

  • DOI
    10.1109/TENCON.2004.1414545
  • Filename
    1414545
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=430983