• DocumentCode
    2405002
  • Title

    Quadtree algorithms for template matching on mesh connected computer

  • Author

    Senoussi, H. ; Saoudi, A.

  • Author_Institution
    Inst. Galilee, Univ. Paris XIII, Villetaneuse, France
  • fYear
    1993
  • fDate
    15-17 Dec 1993
  • Firstpage
    27
  • Lastpage
    33
  • Abstract
    The authors present two parallel algorithms to perform template matching of an N × N image with an M × M template on an SIMD mesh connected computer with N × N processors. In the first algorithm, both the image and the template are represented by quadtrees, whereas in the second, the template is represented by a quadtree, and the image is represented by a matrix. The time complexities of the two algorithms are respectively upperbounded by α1N + β1M2, and β2M2, where α1, β1, and β2 are constants
  • Keywords
    parallel algorithms; SIMD mesh connected computer; parallel algorithms; quadtrees; template matching; time complexities; Algorithm design and analysis; Broadcasting; Centralized control; Computer architecture; Computer vision; Concurrent computing; Data structures; Fans; Parallel algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Architectures for Machine Perception, 1993. Proceedings
  • Conference_Location
    New Orleans, LA
  • Print_ISBN
    0-8186-5420-1
  • Type

    conf

  • DOI
    10.1109/CAMP.1993.622454
  • Filename
    622454
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2405002