• Publication
  • PrePrints
  • Abstract - Fast Orthogonal Haar Transform Pattern Matching via Image Square Sum
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Orthogonal Haar Transform Pattern Matching via Image Square Sum
PrePrint
ISSN: 0162-8828
Although using image strip sum, an orthogonal Haar transform (OHT) pattern matching algorithm may have good performance, it requires 3 subtractions to calculate each Haar projection value on the sliding windows. By establishing a solid mathematical foundation for OHT, this paper based on the concept of image square sum, proposes a novel fast orthogonal Haar transform (FOHT) pattern matching algorithm, from which a Haar projection value can be obtained by only 1 subtraction. Thus, higher speed-ups can be achieved, while producing the same results with the full search pattern matching. A large number of experiments show that the speed-ups of FOHT are very competitive with OHT in most cases of matching one single pattern, and generally higher than OHT in all cases of matching multiple patterns, exceeding other high-level full search equivalent algorithms.
Citation:
Houjun Li, Zhi Cai, "Fast Orthogonal Haar Transform Pattern Matching via Image Square Sum," IEEE Transactions on Pattern Analysis and Machine Intelligence, 04 Feb. 2014. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2014.2303082>
Usage of this product signifies your acceptance of the Terms of Use.