CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2014 vol.36 Issue No.09 - Sept.
Issue No.09 - Sept. (2014 vol.36)
Zhi Cai , College of Computer Science and Technology, Beijing University of Technology, Beijing, China
Although using image strip sum, an orthogonal Haar transform (OHT) pattern matching algorithm may have good performance, it requires three 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 one 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.
Pattern matching, Strips, Vectors, Transforms, Approximation algorithms, Algorithm design and analysis, Complexity theory,full search equivalent algorithm, Square sum, strip sum, pattern matching, template matching, orthogonal Haar transform
Zhi Cai, "Fast Orthogonal Haar Transform PatternMatching via Image Square Sum", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.36, no. 9, pp. 1748-1760, Sept. 2014, doi:10.1109/TPAMI.2014.2303082