Abstract This paper describes a method that accelerates pattern matching. The distance between a pattern and a window is usually close to the distance of the pattern to the adjacement windows due to image smoothness. We show how to exploit this fact to reduce the running time of pattern matching by adaptively sliding the window often by more than one pixel. The decision how much we can slide is based on a novel rank we define for each feature in the pattern. Implemented on a Pentium 4 3GHz processor, detection of a pattern with 7569 pixels in a 640 × 480 pixel image requires only 3.4ms.
Accelerating Pattern Matching or How Much Can You Slide?
Computer Vision – ACCV 2007 ; 6 ; 435-446
Lecture Notes in Computer Science ; 4844 , 6
2007-01-01
12 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Pattern Match , False Detection , Sequential Algorithm , JPEG Compression , Rotation Test Computer Science , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics , Pattern Recognition , Artificial Intelligence (incl. Robotics) , Biometrics , Algorithm Analysis and Problem Complexity
Wiley | 2014
|Wiley | 2014
|Irregular pattern matching using projections
IEEE | 2005
|Pattern matching expands visual inspection
British Library Online Contents | 2001
|Irregular Pattern Matching using Projections
British Library Conference Proceedings | 2005
|