• DocumentCode
    840133
  • Title

    Fast Algorithm for Walsh Hadamard Transform on Sliding Windows

  • Author

    Ouyang, Wanli ; Cham, Wai-Kuen

  • Author_Institution
    Dept. of Electron. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
  • Volume
    32
  • Issue
    1
  • fYear
    2010
  • Firstpage
    165
  • Lastpage
    171
  • Abstract
    This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational requirement of the proposed algorithm is about 1.5 additions per projection vector per sample, which is the lowest among existing fast algorithms for Walsh Hadamard Transform on sliding windows.
  • Keywords
    Hadamard transforms; Walsh functions; pattern matching; Walsh Hadamard transform; computational requirement; pattern matching; sliding window; Fast algorithm; Walsh Hadamard Transform; feature extraction.; pattern matching; template matching;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/TPAMI.2009.104
  • Filename
    4912221
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=840133